Tarjan: Difference between revisions

Content added Content deleted
m (→‎Python: As class: (`gv` is not used anywhere))
m (added whitespace before the TOC.)
Line 2: Line 2:
{{wikipedia|Graph}}
{{wikipedia|Graph}}
[[Category:Algorithm]]
[[Category:Algorithm]]

⚫
<br>

⚫
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.
Tarjan's algorithm is an algorithm in graph theory for finding the strongly connected components of a graph.
<br>

⚫
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:
;References:
* The article on [[wp:Tarjan's_strongly_connected_components_algorithm|Wikipedia]].
* The article on [[wp:Tarjan's_strongly_connected_components_algorithm|Wikipedia]].
⚫
<br><br>


=={{header|C|C}}==
=={{header|C|C}}==
Retrieved from "https://rosettacode.org/wiki/Tarjan"