More Problems

• Write a program to check if a directed graph contains a unique path between any two vertices.
• Implement an algorithm to find the number of edge-disjoint paths in a directed graph.
• Write a program to calculate the maximum flow in a weighted bipartite graph.
• 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.