More Problems

• Write a program to check if a directed graph can be made bipartite by removing edges.
• Implement an algorithm to find the shortest path between two vertices in a weighted directed graph.
• Write a program to check if a directed graph contains any simple cycles using Tarjans algorithm.
• Implement an algorithm to find the maximum flow in a directed graph using augmenting paths.
• Write a program to find the number of edges in a directed bipartite graph that do not form a cycle.
• Implement an algorithm to calculate the longest increasing path in a directed graph using dynamic programming.
• Write a program to find all Hamiltonian paths in a bipartite graph using dynamic programming.
• Implement an algorithm to check if a directed graph is strongly connected using Kosarajus algorithm.