Tarjan

From Rosetta Code
Revision as of 08:02, 4 February 2017 by rosettacode>Mikymaione (Tarjan's strongly connected components algorithm)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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.

Retrieved from "https://rosettacode.org/wiki/Tarjan?oldid=274201"