More Problems

• Implement an algorithm to check if a directed graph is strongly connected using Tarjans algorithm.
• Write a program to find the longest path that visits every edge in a weighted directed graph.
• Implement an algorithm to find the number of edges in a bipartite graph that do not form a cycle.
• Write a program to check if a directed graph can be made bipartite by removing edges.
• Implement an algorithm to find the maximum flow in a bipartite graph using the Hopcroft-Karp method.
• Write a program to check if a directed graph contains any cycles using Tarjans algorithm.
• Implement an algorithm to find the longest path in a directed acyclic graph using dynamic programming.
• Write a program to find all paths of length k in a bipartite graph.