Strongly Connected Components in a Graph

This video explains the Kosaraju's Algorithm which is used to find Strongly Connected Components in a Directed Graph Find the code for this algorithm here: https://github.com/abhiknowswhy/cp_and_algos/blob/main/Graph%20Algorithms/Tough/graph-SCC-Kosaraju.cpp