More Problems

• Implement a function to find the minimum cut in an undirected graph.
• Write a program to check if a directed graph is semi-connected.
• Implement a function to check if a graph is Eulerian.
• Write a program to find the minimum spanning forest of a graph.
• Implement a function to check if a graph contains a perfect matching.
• Write a program to print all strongly connected components of a directed graph.
• Implement a function to find the smallest cycle in an undirected graph.
• Write a program to find all minimum spanning trees of a graph.