Revision as of 07:58, 23 October 2010 edit 119.202.92.81 (talk) No edit summary Tag: repeating characters ← Previous edit		Revision as of 07:58, 23 October 2010 edit undo 119.202.92.81 (talk) →Counterexample Next edit →
Line 120: == Counterexample == <code> node size : 12 map : Line 135: 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 </code> In this case the whole graph is strongly connected

Talk:Tarjan's strongly connected components algorithm: Difference between revisions