More Problems

• Implement an algorithm to check if a directed graph can be made bipartite by adding edges.
• Write a program to find all simple paths in a bipartite graph.
• Implement an algorithm to find the longest simple path in a directed bipartite graph.
• Write a program to check if a directed graph is strongly connected using Kosarajus algorithm.
• Implement an algorithm to find the maximum matching in a weighted bipartite graph using the Hungarian method.
• Write a program to find the longest path that visits every vertex in a directed graph.
• Implement an algorithm to calculate the number of edges in a minimum spanning tree using Prims algorithm.
• Write a program to check if a directed graph can be made strongly connected by removing edges.