Revision as of 18:01, 9 August 2021 edit Mathnerd314159 (talk \| contribs) Extended confirmed users 3,251 edits explain the difference between lowpoint and lowlink ← Previous edit		Revision as of 14:33, 18 August 2021 edit undo 185.240.11.237 (talk) →Fixing an error in the algorithm pseudocode that caused it to return anomalous results when implemented Tag: Reverted Next edit →
Line 59: strongconnect(''w'') ''v''.lowlink := min(''v''.lowlink, ''w''.lowlink) '''else if''' ''w''.onStack '''and''' ''w''.index is not undefined '''then''' ''// Successor w is in stack S and hence in the current SCC'' ''// If ''w'' is not on stack, then (''v'', ''w'') is an edge pointing to an SCC already found and must be ignored

Tarjan's strongly connected components algorithm: Difference between revisions