More Problems

• Write a program to check if two nodes in a directed graph are reachable from each other.
• Implement a function to check if two nodes are part of the same connected component in an undirected graph.
• Write a program to find the number of edges in a directed acyclic graph (DAG).
• Implement a function to calculate the number of spanning trees in a directed graph.
• Write a program to find the shortest path between two nodes in a weighted undirected graph using BFS.
• Implement a function to check if a graph is 3-connected.
• Write a program to find all paths of a given length in a graph using BFS.
• Implement a function to find the number of vertices in the largest connected component of a graph.