More Problems

• Write a program to find the maximum matching in a bipartite graph using augmenting paths.
• Implement an algorithm to find the longest increasing path in a weighted directed graph.
• Write a program to find the number of edges in a directed bipartite graph that do not form a cycle.
• Implement an algorithm to check if a directed graph contains any back edges using Kahns algorithm.
• Write a program to find all simple paths in a weighted directed graph using dynamic programming.
• Implement an algorithm to find the longest path that visits every vertex in a directed bipartite graph.
• Write a program to calculate the average distance from a source vertex to all other vertices in a directed graph.
• Implement an algorithm to find all Hamiltonian paths in a directed graph using dynamic programming.