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

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s