More Problems

• Write a program to check if two nodes in a graph are in the same connected component.
• Implement a function to find the total number of simple paths in a directed acyclic graph.
• Write a program to print all the strongly connected components of a directed acyclic graph.
• Implement a function to calculate the number of spanning trees in an undirected graph.
• Write a program to check if two undirected graphs are strongly isomorphic.
• Implement a function to find the number of leaf nodes in a binary tree using BFS.
• Write a program to print all articulation points in a directed graph using BFS.
• Implement a function to check if a graph is bipartite using DFS and BFS.