More Problems

• Write a program to find all paths between two vertices in an undirected graph.
• Implement an algorithm to detect a cycle in a directed graph.
• Write a program to check if a graph is 2-connected.
• Implement an algorithm to find the maximum flow in a flow network using the Edmonds-Karp algorithm.
• Write a program to find the maximum bipartite matching using the Hopcroft-Karp algorithm.
• Implement a function to calculate the minimum cut in an undirected graph using DFS.
• Write a program to find the longest cycle in a directed graph using DFS.
• Implement the Hungarian algorithm to solve the assignment problem in a bipartite graph.