More Problems

• Write a program to check if a directed graph contains any back edges using Kahns algorithm.
• Implement an algorithm to find the minimum spanning tree using Prims algorithm with a priority queue.
• Write a program to find the number of edge-disjoint spanning trees in a weighted directed graph.
• Implement an algorithm to check if a directed graph can be made strongly connected by adding edges.
• Write a program to calculate the distance from a source vertex to all other vertices in a directed bipartite graph.
• Implement an algorithm to find the maximum flow in a directed graph using augmenting paths.
• Write a program to find the longest simple cycle in a directed graph using DFS.
• Implement an algorithm to check if a directed graph contains any cycles using the Floyd-Warshall algorithm.