More Problems

• Implement a function to print all strongly connected components using Kosaraju’s algorithm.
• Write a program to find the shortest path between all pairs of nodes in an undirected graph.
• Implement a function to check if a graph is planar using Kuratowskis theorem.
• Write a program to find the length of the shortest cycle in a directed graph.
• Implement a function to count the number of connected subgraphs in a given undirected graph.
• Write a program to find the number of edges in the transitive closure of a directed graph.
• Implement a function to find the maximum degree in an undirected graph.
• Write a program to find the minimum degree in a directed graph.