More Problems

• Write a program to check if a directed graph is strongly connected using Kosarajus algorithm.
• Implement an algorithm to find the longest path in a weighted directed graph using dynamic programming.
• Write a program to calculate the average distance from a source vertex to all other vertices in a directed bipartite graph.
• Implement an algorithm to find all maximal independent sets in a bipartite graph using backtracking.
• Write a program to find the maximum weight independent set in a bipartite graph using dynamic programming.
• Implement an algorithm to find the longest path that visits every vertex in a weighted directed graph.
• Write a program to check if a directed graph contains any articulation points using DFS.
• Implement an algorithm to find the number of edges in a minimum spanning tree using Prims algorithm with a priority queue.