Revision as of 15:18, 15 May 2009 edit BlueNovember (talk \| contribs) Extended confirmed users 818 edits m →Remarks: +Mathsify ← Previous edit		Revision as of 00:39, 17 May 2009 edit undo 69.196.131.240 (talk) No edit summary Next edit →
Line 1: '''Tarjan's Algorithm''' (named for its discoverer, [[Robert Tarjan]]) is a [[graph theory]] [[algorithm]] for finding the [[strongly connected components]] of a [[Graph (data structure)\|graph]]. ItAlthough it precedes it chronologically, it can be seen as an improved version of [[Kosaraju's algorithm\|Kosaraju's algorithm]], and is comparable in efficiency to [[Gabow's algorithm]]. == Idea ==

Tarjan's strongly connected components algorithm: Difference between revisions