Revision as of 20:32, 10 January 2020 edit 106.207.164.171 (talk) →Stack invariant Tag: Visual edit ← Previous edit		Revision as of 23:22, 13 March 2020 edit undo 79.116.60.55 (talk) Cross-edges clearly need to be considered as per the original paper. The algorithm is correct but the explanation was wrong about the case when w is not on the stack. Next edit →
Line 59: '''else if''' ''w''.onStack '''then''' ''// Successor w is in stack S and hence in the current SCC'' ''// If ''w'' is not on stack, then (''v'', ''w'') is aan ~~cross-~~edge inpointing ~~the~~to ~~DFS~~an ~~tree~~SCC already found and must be ignored ''// Note: The next line may look odd - but is correct.'' ''// It says w.index not w.lowlink; that is deliberate and from the original paper''

Tarjan's strongly connected components algorithm: Difference between revisions