More Problems

• Write a program to find the shortest path in a weighted graph using the Bellman-Ford algorithm.
• Implement a function to check if a graph contains any back edges.
• Write a program to print all edges of a graph with weights above a given threshold.
• 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.