I don't quite grasp the idea of strongly connected component of a graph. Could someone explain?
-Wooi-Chen Ng
Basically, if you think of the vertices as cities and the edges as one-way streets, NYC and Detroit would be "strongly connected" if you could both get from NYC to Detroit and get from Detroit to NYC. (ie, If you could make a "round trip" from NYC to Detroit and back to NYC.)
-Brian (Thomas34 01:08, 13 November 2008 (UTC))
