Revision as of 20:20, 13 October 2008 edit 92.0.154.69 (talk) →The root property ← Previous edit		Revision as of 20:21, 13 October 2008 edit undo 92.0.154.69 (talk) →The root property Next edit →
Line 11: The algorithm in [[pseudocode]] ~~The algorithm in [[pseudocode]]~~ Input: Graph G = (V, E), Start node v0 index = 0 Line 23: Recurse v.lowlink = min(v.lowlink, v'.lowlink) elseif (v' in S) Is v' on the stack? v.lowlink = min(v.lowlink, v'.lowlink) if (v.lowlink == v.index) Is v the root of an SCC? print "SCC:" repeat v' = S.pop print v' until (v' == v) ~~[[pseudocode]]~~ == Remarks ==

Tarjan's strongly connected components algorithm: Difference between revisions