Tarjan's strongly connected components algorithm
Summary
Tarjan's strongly connected components algorithm is an algorithm in graph theory for finding the strongly connected components (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.
Further reading
- Wikipedia, page 8244667, revision 1370304272, Tarjan's strongly connected components algorithm. adopted
About this page
| Tag | 5XY87RKYJ4 |
|---|---|
| URI | m2://5XY87RKYJ4 |
| Aliases | tarjan-strongly-connected-components-algorithm, tarjans-scc-algorithm |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.