More Problems

• Implement a function to check if an undirected graph is strongly connected.
• Write a program to print all vertices with degree 3 in an undirected graph.
• Implement a function to find the number of edges in the longest path of a directed acyclic graph.
• Write a program to check if two undirected graphs are isomorphic.
• Implement a function to check if a directed graph is acyclic.
• Write a program to find all articulation points in an undirected graph.
• Implement a function to print all bridges in a graph.
• Write a program to find the shortest path from the root to any leaf node in a binary tree.