Home

  • Kosaraju Algorithm

    August 15, 2019 by

    This is an algorithm to find out the SCG (strongly connected component ) ofa directed graph. What is SCG ? Well, a SCG is a particular set of vertices of a directed graph whose element shares a path from other vertices of the set. See the image below : Here as you can see ,… Read more

View all posts

Follow My Blog

Get new content delivered directly to your inbox.

Join 2 other followers

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 )

Google photo

You are commenting using your Google 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 )

Connecting to %s