Finding strongly connected components in a graph

Started by
19 comments, last by Paradigm Shifter 10 years, 5 months ago

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

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

This topic is closed to new replies.

Advertisement