More Problems

• Implement an algorithm to find the longest increasing subsequence in a directed acyclic graph.
• Write a program to find all Hamiltonian paths in a directed graph using backtracking.
• Implement an algorithm to calculate the distance from a source vertex to all other vertices in a weighted graph.
• Write a program to find the shortest path that visits every edge in a directed graph.
• Implement an algorithm to check if two directed graphs are equivalent using adjacency lists.
• Write a program to find the maximum matching in a bipartite graph using the Hopcroft-Karp algorithm.
• Implement an algorithm to find the longest simple cycle in a directed graph.
• Write a program to check if a bipartite graph contains any simple paths.