Topic: graph-theory-problem / Level: intermediate

• 1001. Write a program to implement Dijkstras algorithm for finding the shortest path in a weighted graph.
• 1002. Implement Kruskal’s algorithm to find the minimum spanning tree of a given graph.
• 1003. Write a program to find the minimum spanning tree using Prims algorithm.
• 1004. Implement the Floyd-Warshall algorithm to find all pairs of shortest paths in a graph.
• 1005. Write a program to check if a directed graph is strongly connected using Kosarajus algorithm.
• 1006. Implement the Bellman-Ford algorithm to find the shortest path from a single source in a graph with negative weights.
• 1007. Write a program to find the longest path in a directed acyclic graph.
• 1008. Implement Tarjans algorithm to find all strongly connected components in a directed graph.
• 1009. Write a program to detect all bridges in an undirected graph using DFS.
• 1010. Implement a function to find all articulation points in a graph using DFS.
• 1011. Write a program to check if a graph is bipartite using both BFS and DFS.
• 1012. Implement an algorithm to check if a directed graph contains a cycle.
• 1013. Write a program to perform topological sorting of a directed acyclic graph (DAG).
• 1014. Implement an algorithm to find the shortest path in a graph using A* search.
• 1015. Write a program to find all paths between two vertices in an undirected graph.
• 1016. Implement an algorithm to detect a cycle in a directed graph.
• 1017. Write a program to check if a graph is 2-connected.
• 1018. Implement an algorithm to find the maximum flow in a flow network using the Edmonds-Karp algorithm.
• 1019. Write a program to find the maximum bipartite matching using the Hopcroft-Karp algorithm.
• 1020. Implement a function to calculate the minimum cut in an undirected graph using DFS.
• 1021. Write a program to find the longest cycle in a directed graph using DFS.
• 1022. Implement the Hungarian algorithm to solve the assignment problem in a bipartite graph.
• 1023. Write a program to find the shortest path in a graph with negative weights using the Johnson algorithm.
• 1024. Implement an algorithm to find the chromatic number of a graph using greedy coloring.
• 1025. Write a program to find all edge-disjoint paths between two vertices in a graph.
• 1026. Implement the Dinic’s algorithm to find the maximum flow in a flow network.
• 1027. Write a program to find the center of a tree.
• 1028. Implement the Kirchhoff’s theorem to find the number of spanning trees in a graph.
• 1029. Write a program to find the maximum independent set in a graph.
• 1030. Implement an algorithm to find all Hamiltonian paths in a graph.
• 1031. Write a program to check if a graph has an Eulerian cycle using DFS.
• 1032. Implement an algorithm to find the longest path in a weighted directed graph.
• 1033. Write a program to find the largest strongly connected component in a directed graph.
• 1034. Implement an algorithm to check if two graphs are isomorphic.
• 1035. Write a program to find all simple cycles in a directed graph using DFS.
• 1036. Implement an algorithm to find the minimum vertex cover of a graph.
• 1037. Write a program to check if a graph is k-regular.
• 1038. Implement the Bellman-Ford algorithm to find the shortest path in a graph with negative weight cycles.
• 1039. Write a program to perform a binary search on a graph.
• 1040. Implement an algorithm to find the maximum matching in a bipartite graph using DFS.
• 1041. Write a program to find all paths from the source to the target in a directed graph.
• 1042. Implement the Stoer-Wagner algorithm to find the minimum cut in an undirected graph.
• 1043. Write a program to check if two graphs are strongly isomorphic.
• 1044. Implement an algorithm to find the maximum matching in a general graph.
• 1045. Write a program to check if a given graph is chordal.
• 1046. Implement the Bron-Kerbosch algorithm to find all maximal cliques in a graph.
• 1047. Write a program to find all minimal vertex covers in a bipartite graph.
• 1048. Implement the Push-Relabel algorithm to find the maximum flow in a flow network.
• 1049. Write a program to find the minimum vertex cover in a bipartite graph.
• 1050. Implement the Courcelle’s theorem to check graph properties using monadic second-order logic.

• More Levels

• Beginner
• Advanced