More Problems

• Implement an algorithm to calculate the longest increasing path in a directed graph using dynamic programming.
• Write a program to find all Hamiltonian paths in a bipartite graph using dynamic programming.
• Implement an algorithm to check if a directed graph is strongly connected using Kosarajus algorithm.
• Write a program to calculate the distance from a source vertex to all other vertices in a weighted directed graph.
• Implement an algorithm to find the maximum matching in a bipartite graph using the Hungarian method.
• Write a program to check if a bipartite graph is k-colorable using a greedy algorithm.
• Implement an algorithm to find all simple paths from a source vertex in a directed graph.
• Write a program to find the longest path in a directed graph using dynamic programming.