Revision as of 03:17, 22 August 2008 edit Dcoetzee (talk \| contribs) 37,529 edits Link other algorithms ← Previous edit		Revision as of 21:02, 9 October 2008 edit undo Michael Veksler (talk \| contribs) 17 edits m Always v.lowlink=min(v.lowlink, v'.lowlink) and never min(v.lowlink, v'.index) Next edit →
Line 27: v.lowlink = min(v.lowlink, v'.lowlink) elseif (v' in S) // Is v' on the stack? v.lowlink = min(v.lowlink, v'.~~index~~lowlink) if (v.lowlink == v.index) // Is v the root of an SCC? print "SCC:"

Tarjan's strongly connected components algorithm: Difference between revisions