More Problems

• Implement an algorithm to check if two directed graphs are isomorphic using their adjacency lists.
• Write a program to find the longest increasing path in a bipartite graph using dynamic programming.
• Implement an algorithm to find the longest simple path that visits every vertex in a directed bipartite graph.
• Write a program to check if a directed graph contains any cycles using Kahns algorithm.
• Implement an algorithm to find the maximum matching in a weighted directed graph using augmenting paths.
• Write a program to find all Hamiltonian paths in a bipartite graph using dynamic programming.
• Implement an algorithm to calculate the average distance from a source vertex to all other vertices in a directed graph.
• Write a program to find the longest path that visits every edge in a directed bipartite graph.