More Problems

• Implement Tarjans algorithm to find the strongly connected components of a directed graph.
• Write a program to compute the minimum cut in a flow network using the Stoer-Wagner algorithm.
• Implement an algorithm to find the maximum bipartite matching in a weighted bipartite graph.
• Write a program to solve the "Traveling Salesman Problem" using dynamic programming.
• Implement an algorithm to find the longest path in a directed acyclic graph (DAG).
• Write a program to check if a directed graph is strongly connected using Kosarajus algorithm.
• Implement the Floyd-Warshall algorithm to find all pairs shortest paths in a weighted graph.
• Write a program to compute the minimum spanning tree using Prims algorithm with a Fibonacci heap.