More Problems

• Implement a function to find all cycles in a directed graph using DFS.
• Write a program to print all articulation points in a weighted graph.
• Implement a function to calculate the number of connected components in an undirected graph using BFS.
• Write a program to print all vertices with no incoming edges in a weighted directed graph.
• 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.