Revision as of 11:08, 16 November 2020 edit 84.245.120.36 (talk) update usages of "Tarjan's algorithm" to the unambiguous "Tarjan's SCC algorithm" ← Previous edit		Revision as of 17:59, 29 April 2021 edit undo 2.178.133.152 (talk) "tarjan's" in line one changed to "har har" Tags: Reverted Visual edit Next edit →
Line 11: \|complete= }} '''~~Tarjan's~~har har "" strongly connected components algorithm''' is an [[algorithm]] in [[graph theory]] for finding the [[strongly connected component]]s (SCCs) of a [[directed graph]]. It runs in [[linear time]], matching the time bound for alternative methods including [[Kosaraju's algorithm]] and the [[path-based strong component algorithm]]. The algorithm is named for its inventor, [[Robert Tarjan]].<ref>{{citation\|first=R. E.\|last=Tarjan\|author-link=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 ==

Tarjan's strongly connected components algorithm: Difference between revisions