Topic: graph-theory-problem / Level: intermediate

• 1201. Write a program to find the minimum vertex cover in a weighted graph using DFS.
• 1202. Implement an algorithm to solve the "Generalized Steiner Tree Problem" in a directed graph.
• 1203. Write a program to calculate the number of Hamiltonian cycles in a bipartite graph.
• 1204. Implement an algorithm to calculate the maximum flow in a flow network with vertex capacities.
• 1205. Write a program to find the longest simple cycle in a weighted bipartite graph.
• 1206. Implement an algorithm to solve the "Shortest Path with Multiple Constraints" problem using BFS.
• 1207. Write a program to check if a directed acyclic graph contains any simple paths.
• 1208. Implement an algorithm to find all maximal independent sets in a weighted graph.
• 1209. Write a program to calculate the minimum number of edges to remove to make a graph bipartite.
• 1210. Implement an algorithm to solve the "Maximum Cardinality Matching" problem in a bipartite graph.
• 1211. Write a program to find the longest Hamiltonian path in a weighted directed graph.
• 1212. Implement an algorithm to calculate the minimum spanning forest in a bipartite graph.
• 1213. Write a program to check if a given graph is a planar graph using DFS.
• 1214. Implement an algorithm to calculate the number of spanning forests in a bipartite graph.
• 1215. Write a program to solve the "Perfect Matching Problem" in a bipartite graph.
• 1216. Implement an algorithm to calculate the number of edge-disjoint Hamiltonian cycles in a graph.
• 1217. Write a program to find the maximum number of vertex-disjoint paths in a weighted graph.
• 1218. Implement an algorithm to solve the "Travelling Salesman Problem" in a weighted bipartite graph.
• 1219. Write a program to find all Hamiltonian cycles in a weighted directed graph.
• 1220. Implement an algorithm to solve the "Vertex Feedback Problem" in a directed graph.
• 1221. Write a program to calculate the number of maximal independent sets in a bipartite graph.
• 1222. Implement an algorithm to find the longest simple path between two vertices in a bipartite graph.
• 1223. Write a program to solve the "All-Pairs Shortest Path Problem" using Johnsons algorithm.
• 1224. Implement an algorithm to calculate the total number of Hamiltonian paths in a weighted graph.
• 1225. Write a program to check if a bipartite graph contains any Hamiltonian paths.
• 1226. Implement an algorithm to solve the "Graph Coloring Problem" for weighted bipartite graphs.
• 1227. Write a program to find the maximum flow in a bipartite graph with vertex capacities.
• 1228. Implement an algorithm to calculate the vertex connectivity of a bipartite graph.
• 1229. Write a program to calculate the number of spanning trees in a directed bipartite graph.
• 1230. Implement an algorithm to solve the "Minimum Dominating Set Problem" in a bipartite graph.
• 1231. Write a program to find the longest path in a weighted bipartite graph using DFS.
• 1232. Implement an algorithm to check if a bipartite graph is strongly connected.
• 1233. Write a program to solve the "Maximal Independent Set Problem" in a directed graph.
• 1234. Implement an algorithm to calculate the chromatic number of a bipartite graph using BFS.
• 1235. Write a program to find the number of edge-disjoint paths in a weighted bipartite graph.
• 1236. Implement an algorithm to solve the "All-Pairs Maximum Flow Problem" in a directed graph.
• 1237. Write a program to check if a bipartite graph contains any Hamiltonian cycles.
• 1238. Implement an algorithm to calculate the number of edge cuts in a bipartite graph.
• 1239. Write a program to find the longest simple cycle in a weighted bipartite graph.
• 1240. Implement an algorithm to check if two bipartite graphs are isomorphic.
• 1241. Write a program to calculate the minimum cut in a bipartite graph using DFS.
• 1242. Implement an algorithm to find the maximum independent set in a directed bipartite graph.
• 1243. Write a program to check if a bipartite graph is strongly connected using BFS.
• 1244. Implement an algorithm to solve the "Vertex Cover Problem" in a weighted bipartite graph.
• 1245. Write a program to calculate the number of strongly connected components in a bipartite graph.
• 1246. Implement an algorithm to calculate the number of spanning forests in a directed graph.
• 1247. Write a program to find all maximal cliques in a weighted bipartite graph using DFS.
• 1248. Implement an algorithm to check if a bipartite graph contains any back edges.
• 1249. Write a program to solve the "Vertex Splitting Problem" in a bipartite graph.
• 1250. Implement an algorithm to calculate the chromatic number of a directed bipartite graph.

• More Levels

• Beginner
• Advanced