More Problems

• Write a program to find the longest path that visits every edge of a graph.
• Implement an algorithm to find the shortest cycle in a weighted graph using Bellman-Ford.
• Write a program to implement the Kahn’s algorithm for topological sorting in a directed graph.
• Implement an algorithm to check if a directed graph can be topologically sorted.
• Write a program to calculate the minimum spanning tree using the Reverse-Delete algorithm.
• Implement an algorithm to find all the shortest paths from a single source in a graph.
• Write a program to find the maximum flow in a bipartite graph using the Ford-Fulkerson method.
• Implement an algorithm to calculate the distance between two nodes in a weighted graph.