More Problems

• Write a program to find all vertices with no incoming edges in a directed acyclic graph.
• Implement a function to calculate the average degree of vertices in a graph.
• Write a program to check if a directed graph contains any cycles.
• Implement a function to find the longest simple path in a directed graph.
• Write a program to calculate the number of vertices that are part of a cycle in an undirected graph.
• Implement a function to find all articulation points in a graph using DFS.
• Write a program to print all nodes in a graph in decreasing order of their degree.
• Implement a function to check if a graph is strongly connected using BFS.