More Problems

• Implement a function to print all vertices with no outgoing edges in a directed acyclic graph.
• Write a program to find all the leaf nodes in a tree using DFS.
• Implement a function to calculate the radius of a graph using BFS.
• Write a program to print all vertices in decreasing order of their degree.
• Implement a function to check if two directed graphs have the same degree sequence.
• Write a program to find the longest path in a graph using DFS.
• Implement a function to calculate the number of strongly connected components in a directed graph.
• Write a program to find all edges in a graph that are part of a simple cycle.