More Problems

• Write a program to find the longest increasing path in a bipartite graph.
• Implement an algorithm to check if a directed graph contains any cycles using Kahns algorithm.
• Write a program to find the number of edges in a bipartite graph that form a path.
• Implement an algorithm to find all paths from a source vertex in a directed graph.
• Write a program to find the shortest path in a directed graph with negative weights using Bellman-Ford.
• Implement an algorithm to check if a directed graph is a valid topological sort using the in-degree method.
• Write a program to find the longest path in a weighted graph using dynamic programming.
• Implement an algorithm to calculate the maximum flow in a directed graph using augmenting paths.