More Problems

• Write a function to print all edge-disjoint paths in a graph.
• Implement a program to check if a directed graph contains a Hamiltonian path.
• Write a function to find the maximum flow between two vertices in a flow network.
• Implement a program to find the longest cycle in a graph.
• Write a program to find the minimum number of edges to remove to make a graph acyclic.
• Implement a function to find the number of reachable nodes from a given vertex using DFS.
• Write a program to count the number of distinct cycles in an undirected graph.
• Implement a function to find the shortest path in a graph with negative edge weights using Bellman-Ford.