More Problems

• Implement a function to print all vertices in an undirected graph sorted by degree.
• Write a program to check if a graph contains any cut vertices using BFS.
• Implement a function to calculate the number of simple cycles in a directed acyclic graph.
• Write a program to print the adjacency list of a graph with edge weights.
• Implement a function to calculate the number of connected components in a weighted directed graph.
• Write a program to find all strongly connected components in a directed acyclic graph using BFS.
• Implement a function to check if a directed graph contains any articulation points using DFS.
• Write a program to print all vertices that form a cycle in an undirected graph using DFS.