Finding strong components using depth-first search

Robert E. Tarjan, Uri Zwick

Research output: Contribution to journalArticlepeer-review


We survey three algorithms that use depth-first search to find the strong components of a directed graph in linear time: (1) Tarjan's algorithm; (2) a cycle-finding algorithm; and (3) a bidirectional search algorithm.

Original languageEnglish (US)
Article number103815
JournalEuropean Journal of Combinatorics
StatePublished - Jun 2024

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Finding strong components using depth-first search'. Together they form a unique fingerprint.

Cite this