More Problems

• Write a program to find the minimum number of vertex disjoint paths between two vertices.
• Implement an algorithm to calculate the maximum flow using the preflow-push algorithm.
• Write a program to find the minimum number of edges to remove to make a graph strongly connected.
• Implement an algorithm to solve the vertex cover problem using dynamic programming.
• Write a program to find all simple paths in a graph using DFS.
• Implement an algorithm to solve the maximum independent set problem in a bipartite graph.
• Write a program to find the minimum feedback edge set in a directed graph.
• Implement an algorithm to find all 2-edge-connected components in a graph.