More Problems

• Write a program to print all vertices that form a simple path in a directed graph.
• Implement a function to calculate the number of spanning trees in a weighted graph using DFS.
• Write a program to find all bridges in a directed graph using BFS.
• Implement a function to print all vertices that form a cycle in a directed graph using adjacency lists.
• Write a program to check if a graph contains any self-loops using BFS.
• Implement a function to calculate the total number of strongly connected components in a graph using adjacency lists.
• Write a program to print all vertices in a directed graph with degree greater than 2.
• Implement a function to check if a graph contains any Hamiltonian cycles using adjacency lists.