More Problems

• Write a program to find the number of edge-disjoint paths in a directed bipartite graph.
• Implement an algorithm to find the longest path that visits every vertex in a directed graph.
• Write a program to find the maximum matching in a weighted bipartite graph using the Hungarian method.
• Implement an algorithm to calculate the average distance from a source vertex to all other vertices in a weighted directed graph.
• Write a program to check if a directed graph can be made strongly connected by adding edges.
• Implement an algorithm to find all simple paths from a source vertex to all other vertices in a directed graph.
• Write a program to find the longest increasing path in a bipartite graph using dynamic programming.
• Implement an algorithm to check if a directed graph is strongly connected using Tarjans algorithm.