More Problems

• Write a program to find the maximum weight bipartite matching using the Hungarian algorithm.
• Implement an algorithm to calculate the number of edge-disjoint paths in a weighted bipartite graph.
• Write a program to find the longest path in a tree with weights.
• Implement an algorithm to check if a bipartite graph contains any Hamiltonian cycles using dynamic programming.
• Write a program to find the shortest path in a directed graph using the A* algorithm.
• Implement an algorithm to find all paths from a source to a target in a directed acyclic graph.
• Write a program to solve the "Max-Flow Min-Cut Theorem" in a weighted bipartite graph.
• Implement an algorithm to check if a directed graph contains any cycles using DFS.