Strongly Connected Components in a Directed Graph C++ implementation

Everything Under The Sun

Here, I describe the Kosaraju-Sharir algorithm for finding the strongly connected components in a directed graph and provide its C++ implementation.

View original post 179 more words

Advertisements
Standard

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