More Problems

• Implement a function to calculate the number of connected subgraphs in a directed graph.
• Write a program to find the shortest path between two nodes in a directed graph using BFS.
• Implement a function to print the adjacency list of a graph sorted by degree.
• Write a program to find the longest path from a source node to all other nodes in a graph.
• Implement a function to print all the nodes in a graph in increasing order of their degrees.
• Write a program to find all leaf nodes in an undirected graph.
• Implement a function to check if a directed graph contains any self-loops using BFS.
• Write a program to print all the edges of a graph sorted by weight.