Topic: graph-theory-problem / Level: intermediate

• 1051. Write a program to find the longest simple cycle in an undirected graph.
• 1052. Implement an algorithm to calculate the minimum spanning forest of a graph.
• 1053. Write a program to check if a graph has a Hamiltonian cycle using DFS.
• 1054. Implement the branch and bound algorithm to solve the traveling salesman problem.
• 1055. Write a program to check if a directed acyclic graph has any Hamiltonian paths.
• 1056. Implement an algorithm to calculate the minimum vertex cut of a graph.
• 1057. Write a program to find the longest simple path between two vertices in a graph.
• 1058. Implement an algorithm to find the maximum clique in a graph.
• 1059. Write a program to calculate the edge connectivity of a graph.
• 1060. Implement the Matroid intersection algorithm for finding the maximum matching.
• 1061. Write a program to find the number of spanning forests in a graph.
• 1062. Implement an algorithm to solve the 2-SAT problem using graph representation.
• 1063. Write a program to calculate the minimum number of edges to remove to make a graph acyclic.
• 1064. Implement an algorithm to find the maximum cut in a graph.
• 1065. Write a program to find the maximum flow in a directed graph using DFS.
• 1066. Implement an algorithm to find all edge-biconnected components in a graph.
• 1067. Write a program to solve the "Chinese Postman Problem" in an undirected graph.
• 1068. Implement the Rabin-Karp algorithm for detecting subgraphs in a larger graph.
• 1069. Write a program to find the maximum number of edge-disjoint spanning trees in a graph.
• 1070. Implement an algorithm to find the minimum weight matching in a bipartite graph.
• 1071. Write a program to check if a given directed graph contains a Hamiltonian cycle.
• 1072. Implement an algorithm to find the longest path in a tree.
• 1073. Write a program to find the minimum weight edge in a cycle in a directed graph.
• 1074. Implement the Reed’s algorithm to find the chromatic number of a graph.
• 1075. Write a program to find the minimum number of swaps required to sort a graph.
• 1076. Implement an algorithm to calculate the minimum spanning tree in a directed graph.
• 1077. Write a program to solve the "Steiner Tree Problem" in a weighted graph.
• 1078. Implement an algorithm to find all shortest paths in a graph using the A* algorithm.
• 1079. Write a program to check if a directed acyclic graph is bipartite.
• 1080. Implement an algorithm to find all Hamiltonian cycles in a graph.
• 1081. Write a program to check if two trees are isomorphic.
• 1082. Implement an algorithm to find the longest simple path in a weighted graph.
• 1083. Write a program to calculate the degree distribution of a graph.
• 1084. Implement an algorithm to solve the "Graph Coloring Problem."
• 1085. Write a program to find the maximum number of edge-disjoint cycles in a graph.
• 1086. Implement an algorithm to find the minimum edge cut in a directed graph.
• 1087. Write a program to check if a graph is Eulerian using BFS.
• 1088. Implement an algorithm to find the minimum path cover in a directed acyclic graph.
• 1089. Write a program to find the longest cycle in an undirected graph using BFS.
• 1090. Implement an algorithm to calculate the graph’s radius and diameter.
• 1091. Write a program to check if a directed graph contains any simple cycles.
• 1092. Implement an algorithm to find the minimum number of cuts required to make a graph bipartite.
• 1093. Write a program to calculate the vertex connectivity of a graph.
• 1094. Implement an algorithm to find the number of Hamiltonian cycles in a graph.
• 1095. Write a program to check if a graph is a k-connected graph.
• 1096. Implement an algorithm to solve the "Min Cut-Max Flow" problem.
• 1097. Write a program to find the maximum number of edge-disjoint paths in a directed graph.
• 1098. Implement an algorithm to calculate the transitive closure of a directed graph.
• 1099. Write a program to check if a graph contains any Hamiltonian paths.
• 1100. Implement an algorithm to solve the "Max-Cut Problem."

• More Levels

• Beginner
• Advanced