More Problems

• Write a program to check if a directed graph is bipartite using DFS.
• Implement an algorithm to find the minimum cut in a directed graph using the Max-Flow Min-Cut Theorem.
• Write a program to calculate the number of strongly connected components using Tarjan’s algorithm.
• Implement an algorithm to find the longest cycle in a directed graph using DFS.
• Write a program to find the maximum flow in a network using the Push-Relabel algorithm.
• Implement an algorithm to find the articulation points in a directed graph using Tarjans algorithm.
• Write a program to find the longest path that visits every edge of a graph.
• Implement an algorithm to find the shortest cycle in a weighted graph using Bellman-Ford.