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 language | English (US) |
---|---|
Article number | 103815 |
Journal | European Journal of Combinatorics |
Volume | 119 |
DOIs | |
State | Published - Jun 2024 |
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics