More Problems

• 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.
• Write a program to find the number of bridges in a graph using BFS.
• Implement a function to calculate the eccentricity of each vertex in a directed acyclic graph.
• Write a program to print all vertices with degree 1 in a directed graph.