Finding strong components using depth-first search

Robert E. Tarjan, Uri Zwick

Research output: Contribution to journalArticlepeer-review

Abstract

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
Article number103815
JournalEuropean Journal of Combinatorics
DOIs
StateAccepted/In press - 2023

Funding

FundersFunder number
ISF, Israel2854/20

    Fingerprint

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

    Cite this