More Problems

• Write a program to find the shortest cycle in a directed graph using Bellman-Ford.
• Implement an algorithm to find all paths from a source to a target in a weighted directed graph using DFS.
• Write a program to calculate the minimum cut in a bipartite graph using the Max-Flow Min-Cut Theorem.
• Implement an algorithm to check if a graph is Eulerian using Fleurys algorithm.
• Write a program to find the longest path in a directed graph with unit weights.
• Implement an algorithm to find all paths of length k in a bipartite graph.
• Write a program to check if a directed graph can be made strongly connected.
• Implement an algorithm to find the minimum number of edges required to make a directed graph strongly connected.