Revision as of 15:15, 10 March 2015 edit Kalmankeri (talk \| contribs) 3 edits No edit summary ← Previous edit		Revision as of 15:56, 28 March 2015 edit undo Fifteen Minutes Of Fame (talk \| contribs) 12 edits →The pseudocode didn't work for me: quite possible Next edit →
Line 239: '''end if''' --[[User:Kalmankeri\|Kalmankeri]] ([[User talk:Kalmankeri\|talk]]) 15:15, 10 March 2015 (UTC) : Well that would bring the pseudocode back to Tarjan's original. MattGiuca considered this above under Status of the algorithm and reasoned that v, just numbered, would have to be greater than any existing number. But while numbering v happens before looping over successors, it does seems that a recursive call to strongconnect on one successor of v could number a later successor of v. I'm inclined to agree that this looks like a problem but a test case might show it clearly. Do you have an example of a graph that shows this failure? —[[User:Fifteen Minutes Of Fame\|Fifteen Minutes Of Fame]] ([[User talk:Fifteen Minutes Of Fame\|talk]]) 15:56, 28 March 2015 (UTC)

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