More Problems

• Implement an algorithm to find the shortest path between two vertices in a bipartite graph.
• Write a program to calculate the average distance from a source vertex to all other vertices in a weighted graph.
• Implement an algorithm to find all Hamiltonian paths in a directed bipartite graph.
• 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.