More Problems

• Implement Breadth-First Search (BFS) for a given graph.
• Implement Depth-First Search (DFS) for a given graph.
• Write a function to check if a given graph is connected.
• Implement a function to count the number of connected components in an undirected graph.
• Find the shortest path between two nodes in an unweighted graph using BFS.
• Write a program to detect a cycle in an undirected graph.
• Calculate the in-degree and out-degree of each vertex in a directed graph.
• Write a program to print all vertices reachable from a given vertex using DFS.