Strongly Connected Components (SCCs)

To find the strongly connected components of a graph we use Kosaraju’s algorithm this works in linear time O(|V| + |E|). Here is a beautiful explanation of what the algorithm is and how it works.

To learn how to find SCCs of a graph start from 19:22