L25 : Tarjan's algorithm for Strongly Connected Component Part 2 | Graph Theory Part 1 | CodeNCode

In this lecture we will learn how to find strongly connected components in directed graph for which we will learn Tarjan's algorithm for Strongly Connected Component. Graph Theory Part 1 Course : https://www.youtube.com/playlist?list=PL5DyztRVgtRVLwNWS7Rpp4qzVVHJalt22