More Problems

• Implement an algorithm to calculate the distance between all pairs of vertices in a graph using Floyd-Warshall.
• Write a program to find the number of Hamiltonian cycles in a weighted graph using dynamic programming.
• Implement an algorithm to check if a bipartite graph contains any cycles using DFS.
• Write a program to find the longest path in a directed acyclic graph using dynamic programming.
• Implement an algorithm to find the number of edges in a minimum spanning tree using Prims algorithm.
• Write a program to check if a directed graph is a valid topological sort using DFS.
• Implement an algorithm to find all paths from a source vertex to all other vertices in a directed graph.
• Write a program to solve the "Max-Flow Min-Cut Problem" in a weighted graph.