More Problems

• Implement a function to calculate the number of strongly connected components in a directed acyclic graph.
• Write a program to find the shortest path between two nodes in a weighted directed graph using BFS.
• Implement a function to check if a directed graph contains any back edges using DFS.
• Write a program to print all bridges in a weighted graph using BFS.
• Implement a function to check if a directed graph contains any cut vertices.
• Write a program to calculate the number of simple cycles in a directed graph.
• Implement a function to print all vertices in a directed graph that form a Hamiltonian cycle.
• Write a program to check if a graph contains any articulation points using BFS and DFS.