More Problems

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