Tarjan's strongly connected components algorithm: Difference between revisions

Revision as of 21:54, 2 March 2018

Revision as of 22:00, 2 March 2018

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]]{{citation needed|date=March 2018}}, 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 inventor, [[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 ==