More Problems

• Implement an algorithm to find the number of edges in a minimum spanning tree using Prims algorithm.
• Write a program to find all Hamiltonian cycles in a directed bipartite graph using backtracking.
• Implement an algorithm to find the longest path that visits every vertex in a directed graph.
• Write a program to check if a directed graph is strongly connected using Tarjans algorithm.
• Implement an algorithm to calculate the average distance from a source vertex to all other vertices in a directed bipartite graph.
• Write a program to check if a directed graph contains any back edges using DFS.
• Implement an algorithm to find the longest path that visits every edge in a bipartite graph.
• Write a program to find the longest increasing subsequence in a directed graph.