More Problems

• Implement a function to check if a graph is connected after removing a vertex.
• Write a program to find the minimum vertex cover of a graph.
• Implement a function to find the shortest Hamiltonian path in a DAG.
• Write a program to print all edge-disjoint cycles in a graph.
• 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.