Revision as of 17:53, 26 May 2009 edit Giftlite (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 39,854 edits m →Links: wikify ← Previous edit		Revision as of 17:16, 7 June 2009 edit undo 86.52.81.179 (talk) →The algorithm in pseudocode Next edit →
Line 28: tarjan(v') // Recurse v.lowlink = min(v.lowlink, v'.lowlink) ~~elif~~else if (v' is in S) // Was successor v' in stack S? v.lowlink = min(v.lowlink, v'.index) if (v.lowlink == v.index) // Is v the root of an SCC?

Tarjan's strongly connected components algorithm: Difference between revisions