Topic: graph-theory-problem / Level: intermediate

• 1151. Write a program to check if a graph has a perfect matching.
• 1152. Implement an algorithm to solve the "Maximum Bipartite Matching Problem" using DFS.
• 1153. Write a program to find the longest simple path in a tree using DFS.
• 1154. Implement an algorithm to calculate the total number of simple cycles in a directed graph.
• 1155. Write a program to solve the "2-Edge Connected Subgraph Problem."
• 1156. Implement an algorithm to calculate the number of spanning forests in a directed graph.
• 1157. Write a program to check if a given graph is 3-connected.
• 1158. Implement an algorithm to solve the "Minimum Steiner Tree Problem."
• 1159. Write a program to calculate the edge connectivity of a directed graph.
• 1160. Implement an algorithm to calculate the minimum cut in a directed acyclic graph.
• 1161. Write a program to find the maximum number of vertex-disjoint paths between two vertices in a graph.
• 1162. Implement an algorithm to solve the "Travelling Salesman Problem" using graph techniques.
• 1163. Write a program to find the longest Hamiltonian cycle in a weighted graph.
• 1164. Implement an algorithm to calculate the number of edge-disjoint spanning forests in a graph.
• 1165. Write a program to check if two graphs are edge isomorphic.
• 1166. Implement an algorithm to find the longest simple cycle in a weighted directed graph.
• 1167. Write a program to calculate the number of vertex-disjoint cycles in a graph.
• 1168. Implement an algorithm to solve the "Minimum Feedback Arc Set Problem" in a directed graph.
• 1169. Write a program to find all the bridges in a weighted undirected graph.
• 1170. Implement an algorithm to check if a directed graph is strongly regular.
• 1171. Write a program to calculate the number of spanning subgraphs in a directed graph.
• 1172. Implement an algorithm to calculate the maximum matching in a general graph using DFS.
• 1173. Write a program to solve the "Cut Vertex Problem" in a graph.
• 1174. Implement an algorithm to calculate the edge-disjoint paths in a directed acyclic graph.
• 1175. Write a program to check if a directed graph contains any Hamiltonian cycles.
• 1176. Implement an algorithm to calculate the longest path in a directed acyclic graph with negative edge weights.
• 1177. Write a program to find the number of maximal cliques in a bipartite graph.
• 1178. Implement an algorithm to solve the "Generalized Max-Flow Problem."
• 1179. Write a program to find all minimal vertex covers in a general graph.
• 1180. Implement an algorithm to solve the "Shortest Path with Constraints" problem using graph representation.
• 1181. Write a program to calculate the number of strongly connected components in a graph using BFS.
• 1182. Implement an algorithm to solve the "All-Pairs Shortest Paths" problem using Floyd-Warshall.
• 1183. Write a program to find the maximum number of edge-disjoint Hamiltonian cycles in a graph.
• 1184. Implement an algorithm to calculate the minimum cut in a flow network using BFS.
• 1185. Write a program to solve the "Multi-Commodity Flow Problem" in a graph.
• 1186. Implement an algorithm to find the longest simple path between two vertices in a directed graph.
• 1187. Write a program to calculate the number of edge cuts required to partition a graph into two equal parts.
• 1188. Implement an algorithm to solve the "Vertex Splitting Problem" using graph techniques.
• 1189. Write a program to find the minimum number of vertex-disjoint Hamiltonian paths in a graph.
• 1190. Implement an algorithm to calculate the longest increasing sequence in a graph.
• 1191. Write a program to solve the "Subgraph Isomorphism Problem" using graph techniques.
• 1192. Implement an algorithm to calculate the vertex connectivity of a weighted directed graph.
• 1193. Write a program to find the maximum flow in a graph with vertex capacities.
• 1194. Implement an algorithm to solve the "All-Pairs Shortest Path Problem" in a directed graph with negative edge weights.
• 1195. Write a program to calculate the total number of edge cuts required to make a graph acyclic.
• 1196. Implement an algorithm to check if two graphs are vertex isomorphic.
• 1197. Write a program to find the maximum number of edge-disjoint spanning trees in a directed graph.
• 1198. Implement an algorithm to solve the "Longest Path Problem" in a weighted graph using DFS.
• 1199. Write a program to find all maximal cliques in a weighted graph using BFS.
• 1200. Implement an algorithm to calculate the total number of spanning forests in a weighted graph.

• More Levels

• Beginner
• Advanced