Topic: graph-theory-problem / Level: intermediate

• 1101. Write a program to check if a given graph contains any odd-length cycles.
• 1102. Implement an algorithm to calculate the minimum spanning tree using Boruvkas algorithm.
• 1103. Write a program to find the maximum number of edge-disjoint Hamiltonian paths in a graph.
• 1104. Implement an algorithm to solve the "Feedback Vertex Set Problem" in a directed graph.
• 1105. Write a program to find the minimum number of vertex disjoint paths between two vertices.
• 1106. Implement an algorithm to calculate the maximum flow using the preflow-push algorithm.
• 1107. Write a program to find the minimum number of edges to remove to make a graph strongly connected.
• 1108. Implement an algorithm to solve the vertex cover problem using dynamic programming.
• 1109. Write a program to find all simple paths in a graph using DFS.
• 1110. Implement an algorithm to solve the maximum independent set problem in a bipartite graph.
• 1111. Write a program to find the minimum feedback edge set in a directed graph.
• 1112. Implement an algorithm to find all 2-edge-connected components in a graph.
• 1113. Write a program to calculate the number of spanning trees in a graph using the Matrix Tree Theorem.
• 1114. Implement an algorithm to calculate the edge-disjoint spanning trees in a graph.
• 1115. Write a program to find the diameter of a graph using BFS.
• 1116. Implement an algorithm to find all biconnected components in a directed graph.
• 1117. Write a program to calculate the number of connected subgraphs in a given undirected graph.
• 1118. Implement an algorithm to find the vertex connectivity of a directed graph.
• 1119. Write a program to find all maximal independent sets in a graph.
• 1120. Implement an algorithm to calculate the minimum spanning forest in a weighted graph.
• 1121. Write a program to find the longest simple path in a graph with negative edge weights.
• 1122. Implement an algorithm to find all paths between two vertices in a weighted graph.
• 1123. Write a program to check if a graph is semi-Eulerian.
• 1124. Implement an algorithm to find the longest common subsequence between two sequences using graph techniques.
• 1125. Write a program to calculate the number of maximal cliques in a graph.
• 1126. Implement an algorithm to find all articulation points in a weighted graph.
• 1127. Write a program to find the minimum number of colors required to color a graph.
• 1128. Implement an algorithm to calculate the number of edge-disjoint spanning trees in a directed graph.
• 1129. Write a program to solve the "Maximum Flow with Minimum Cost" problem using the cycle-canceling algorithm.
• 1130. Implement an algorithm to check if a graph is a bipartite graph using DFS.
• 1131. Write a program to find the longest simple cycle in a weighted undirected graph.
• 1132. Implement an algorithm to solve the "Graph Partition Problem."
• 1133. Write a program to calculate the number of strongly connected components in a directed graph.
• 1134. Implement an algorithm to find the shortest path from a source to multiple targets in a graph.
• 1135. Write a program to find the chromatic number of a directed graph.
• 1136. Implement an algorithm to solve the "Chinese Postman Problem" for directed graphs.
• 1137. Write a program to calculate the radius and diameter of a tree.
• 1138. Implement an algorithm to find the longest increasing path in a weighted graph.
• 1139. Write a program to check if two graphs have the same degree distribution.
• 1140. Implement an algorithm to find the minimum number of cuts needed to partition a graph into strongly connected components.
• 1141. Write a program to calculate the number of Hamiltonian paths in a graph.
• 1142. Implement an algorithm to solve the "Max Flow with Vertex Capacities" problem.
• 1143. Write a program to find the minimum number of edges required to make a directed graph acyclic.
• 1144. Implement an algorithm to calculate the transitive reduction of a directed graph.
• 1145. Write a program to solve the "Minimum Dominating Set Problem" in a graph.
• 1146. Implement an algorithm to find the maximum number of vertex-disjoint paths in a graph.
• 1147. Write a program to calculate the number of edge cuts required to disconnect a graph.
• 1148. Implement an algorithm to solve the "Weighted Vertex Cover Problem."
• 1149. Write a program to find the shortest path that visits all vertices in a graph.
• 1150. Implement an algorithm to find the longest path in a graph with both positive and negative edge weights.

• More Levels

• Beginner
• Advanced