More Problems

• Write a program to check if a directed graph is strongly connected using Kosarajus algorithm.
• Implement an algorithm to find the longest increasing path in a directed graph using dynamic programming.
• Write a program to find the number of edges in a bipartite graph that do not form a cycle.
• Implement an algorithm to find all Hamiltonian paths in a directed graph using dynamic programming.
• Write a program to check if a directed graph contains any articulation points using DFS.
• Implement an algorithm to find the longest path in a directed graph using depth-first search.
• Write a program to calculate the number of edges in a minimum spanning tree using Prims algorithm.
• Implement an algorithm to find the longest increasing path in a bipartite graph using dynamic programming.