Jump to content

  • Log In with Google      Sign In   
  • Create Account


Finding strongly connected components in a graph


Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.

  • You cannot reply to this topic
20 replies to this topic

#21 Paradigm Shifter   Crossbones+   -  Reputation: 5153

Like
0Likes
Like

Posted 30 October 2013 - 08:16 AM

I dunno, it was a conjecture, I'd never heard of strongly connected components either! Sounds right to me though. I'm fairly certain the OPs book will go on to prove that in due course.

 

I think strongly connected is an equivalence relation and those partition a set into disjoint subsets anyway.

 

EDIT: Proof here http://www.ics.uci.edu/~eppstein/161/960220.html


Edited by Paradigm Shifter, 30 October 2013 - 08:18 AM.

"Most people think, great God will come from the sky, take away everything, and make everybody feel high" - Bob Marley

Sponsor:



Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.



PARTNERS