More Problems

• Implement an algorithm to find all Hamiltonian paths in a bipartite graph using backtracking.
• Write a program to check if a directed graph contains any back edges using Kahns algorithm.
• Implement an algorithm to find the longest path that visits every edge in a directed graph.
• Write a program to calculate the maximum flow in a directed bipartite graph using augmenting paths.
• Implement an algorithm to check if a bipartite graph contains any cycles using DFS.
• Write a program to find the longest increasing subsequence in a directed graph 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 edges in a directed graph that form a path.