More Problems

• Write a program to find the number of vertices in the smallest strongly connected component in a directed graph.
• Implement a function to check if a directed graph contains any articulation points.
• Write a program to calculate the diameter of a binary tree using DFS.
• 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.