More Problems

• Write a program to find the number of trees in a forest.
• Implement a function to check if a graph is a tree.
• Write a program to find all the edges of a graph.
• Implement a function to find the number of bridges in a directed graph.
• Write a program to print all connected components in an undirected graph.
• Implement a function to check if a graph is weakly connected.
• Write a program to check if a graph is complete.
• Implement a function to print the topological order of a DAG.