More Problems

• Implement an algorithm to check if a directed graph contains any back edges using Kahns algorithm.
• Write a program to find all Hamiltonian paths in a weighted bipartite graph.
• Implement an algorithm to find the maximum flow in a directed graph using augmenting paths.
• Write a program to find the shortest path between all pairs of vertices in a directed graph using the Floyd-Warshall algorithm.
• Implement an algorithm to check if a directed graph can be made bipartite by adding edges.
• Write a program to find all paths of length k in a directed graph.
• Implement an algorithm to calculate the distance from a source vertex to all other vertices in a weighted directed graph.
• Write a program to find the number of edges in a bipartite graph that do not form a cycle.