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

Revision as of 07:59, 23 October 2010

Revision as of 05:34, 8 February 2011

Line 140:

But the result of algorithm is not <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/119.202.92.81|119.202.92.81]] ([[User talk:119.202.92.81|talk]]) 07:58, 23 October 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->

* What output did the algorithm give you? I ported the algorithm to Python and ran it on precisely this input, assuming your adjacency matrix rows are sources and columns are sinks, and naming each vertex after its row/column ID starting from 0. The output I got was a single SCC: "6 3 11 4 7 2 8 1 10 5 9 0". I don't think this is a valid counterexample. &mdash;[[User:MattGiuca|MattGiuca]] ([[User talk:MattGiuca|talk]]) 05:34, 8 February 2011 (UTC)