Tarjan's strongly connected components algorithm: Difference between revisions

Revision as of 10:58, 9 May 2017

Revision as of 13:34, 21 September 2017

Line 11:

|complete=

}}

'''Tarjan's algorithm''' is an [[algorithm]] in [[graph theory]] for finding the [[strongly connected component]]s of a [[Graph (data structure)|graph]]. It runs in [[linear time]], matching the time bound for alternative methods including [[Kosaraju's algorithm]] and the [[path-based strong component algorithm]]. Tarjan's Algorithm is named for its discovererinventor, [[Robert Tarjan]].<ref>{{citation|first=R. E.|last=Tarjan|authorlink=Robert Tarjan|title=Depth-first search and linear graph algorithms|journal=[[SIAM Journal on Computing]]|volume=1|year=1972|issue=2|pages=146–160|doi=10.1137/0201010}}</ref>

== Overview ==