More Problems

• Implement an algorithm to find the longest path in a weighted bipartite graph.
• Write a program to check if a directed graph is a valid topological sort using DFS.
• Implement an algorithm to find the maximum weight independent set in a directed graph.
• Write a program to calculate the total number of paths in a directed acyclic graph.
• Implement an algorithm to check if a directed graph contains any back edges using Kahns algorithm.
• Write a program to find the longest path in a tree using dynamic programming.
• Implement an algorithm to find the minimum cut in a directed graph using the Max-Flow Min-Cut Theorem.
• Write a program to find the number of simple cycles in a bipartite graph.