More Problems

• Implement an algorithm to check if a directed graph is strongly connected using Tarjans algorithm.
• Write a program to find the maximum flow in a directed graph using the Edmonds-Karp algorithm.
• Implement an algorithm to find the longest path that visits every vertex in a weighted bipartite graph.
• Write a program to check if a directed graph contains any simple cycles using DFS.
• Implement an algorithm to find all simple paths in a directed graph using backtracking.
• Write a program to find the longest path that visits every edge in a bipartite graph.
• Implement an algorithm to find the number of edges in a directed graph that form a cycle.
• Write a program to check if a bipartite graph can be made bipartite by adding edges.