More Problems

• Write a program to find the shortest cycle in a directed graph using BFS.
• Implement a function to find all nodes at a given distance from a starting node in a tree.
• Write a program to print all the vertices that belong to the shortest path between two nodes.
• Implement a function to calculate the number of connected components in a directed graph.
• Write a program to print all strongly connected components in a directed graph using BFS.
• Implement a function to find the shortest path between two vertices in a weighted graph.
• Write a program to check if two directed graphs are isomorphic.
• Implement a function to print all vertices with no incoming or outgoing edges in a graph.