More Problems

• Write a program to calculate the number of strongly connected components in a directed graph using Kosarajus algorithm.
• Implement an algorithm to find the longest path in a directed acyclic graph using dynamic programming.
• Write a program to check if a bipartite graph contains any cycles using the DFS approach.
• 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.