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

Content deleted Content added
Counterexample: I ran it, didn't find a problem
Line 141:
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)
 
== Status of the algorithm ==
 
After seeing the large number of bug discussions on this page, I thought it would be prudent to put up a dispute-section template on that page. I intend to address each of the above concerns. Can anybody who is more of an expert in the field check that the algorithm is correct so we can remove the box? I have ported it to Python and it seems to be working okay. &mdash;[[User:MattGiuca|MattGiuca]] ([[User talk:MattGiuca|talk]]) 05:37, 8 February 2011 (UTC)