13 lines
459 B
Text
13 lines
459 B
Text
Tarjan's algorithm is an algorithm in graph theory for finding the strongly connected components of a 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 discoverer, Robert Tarjan.
|
|
|
|
|
|
;References:
|
|
* The article on [[wp:Tarjan's_strongly_connected_components_algorithm|Wikipedia]].
|
|
|
|
See also: [[Kosaraju]]
|
|
<br><br>
|
|
|