More Problems

• Write a program to find the number of articulation points in a directed acyclic graph using BFS and DFS.
• Implement a function to calculate the total number of edge-disjoint paths between two vertices in a directed graph using DFS.
• Write a program to implement Dijkstras algorithm for finding the shortest path in a weighted graph.
• 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.