More Problems

• Implement a function to calculate the number of edge-disjoint cycles in a weighted graph.
• Write a program to print all vertices in a graph that belong to strongly connected components.
• Implement a function to check if two vertices in a directed graph are adjacent using BFS.
• Write a program to calculate the total number of connected components in a directed graph using BFS.
• Implement a function to find the longest cycle in a directed graph using DFS.
• Write a program to check if a directed graph contains any Hamiltonian cycles using BFS.
• Implement a function to calculate the number of spanning trees in a directed acyclic graph.
• Write a program to print all edges in a directed graph that form a cycle.