More Problems

• Implement an algorithm to check if a directed graph can be made strongly connected by removing edges.
• Write a program to find the shortest cycle in a bipartite graph using BFS.
• Implement an algorithm to find all simple paths in a directed graph using depth-first search.
• Write a program to find the longest path in a directed graph with both positive and negative weights.
• Implement an algorithm to find the number of strongly connected components in a directed graph using BFS.
• Write a program to check if two directed graphs are edge isomorphic using adjacency lists.
• Implement an algorithm to find the maximum flow in a directed graph using the Edmonds-Karp method.
• Write a program to find the longest simple path in a tree using a recursive approach.