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

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