More Problems

• Implement Kruskal’s algorithm to find the minimum spanning tree of a given graph.
• Write a program to find the minimum spanning tree using Prims algorithm.
• Implement the Floyd-Warshall algorithm to find all pairs of shortest paths in a graph.
• Write a program to check if a directed graph is strongly connected using Kosarajus algorithm.
• Implement the Bellman-Ford algorithm to find the shortest path from a single source in a graph with negative weights.
• Write a program to find the longest path in a directed acyclic graph.
• Implement Tarjans algorithm to find all strongly connected components in a directed graph.
• Write a program to detect all bridges in an undirected graph using DFS.