Revision as of 16:17, 17 June 2010 edit 145.248.195.1 (talk) Report two other issues in the algorithme (bug and over-complication in the code). ← Previous edit		Revision as of 16:18, 17 June 2010 edit undo SineBot (talk \| contribs) Bots 2,564,701 edits m Signing comment by 145.248.195.1 - "Report two other issues in the algorithme (bug and over-complication in the code)." Next edit →
Line 66: 2. The SCC printed at the end is incorrect because algorithm never pops out nodes. Imagine the SCC is found for the last sucessor of v. In that case every sucessor will be printed, which is clearly not correct. Anonymous - 18:16, 16 june 2010 <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/145.248.195.1\|145.248.195.1]] ([[User talk:145.248.195.1\|talk]]) </span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--> ~~Anonymous - 18:16, 16 june 2010~~ == Algorithm fixed ==

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