More Problems

• 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.
• Write a program to implement the Kahn’s algorithm for topological sorting in a directed graph.
• Implement an algorithm to check if a directed graph can be topologically sorted.