---
tag: 5XY87RKYJ4
kind: concept
name: Tarjan's strongly connected components algorithm
aliases: [tarjan-strongly-connected-components-algorithm, tarjans-scc-algorithm]
sources:
  - wikipedia: en:8244667@r1370304272
    locator: Tarjan's strongly connected components algorithm
    note: adopted
    mention: wikipedia://en/8244667
    sections: [Summary]
same_as:
  wikidata: Q1972285
  wikipedia: Tarjan's strongly connected components algorithm
inventory: [13QDA7DJ1P]
---

## Summary

**Tarjan's strongly connected components algorithm** is an algorithm in graph theory for finding the strongly connected components (SCCs) of a [[directed graph|0KFYGSHHF5]]. 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.