More Problems

• Implement an algorithm to find the number of edge-disjoint paths in a bipartite graph.
• Write a program to find the shortest path from a source vertex to all other vertices in a weighted directed graph.
• Implement an algorithm to check if a directed graph can be made strongly connected by removing edges.
• Write a program to find the longest path that visits every edge in a weighted bipartite graph.
• Implement an algorithm to find the longest path in a directed acyclic graph using dynamic programming.
• Write a program to find all Hamiltonian cycles in a directed bipartite graph using dynamic programming.
• Implement an algorithm to check if a directed graph contains any articulation points using DFS.
• Write a program to find the maximum matching in a directed graph using augmenting paths.