Finding Strong Components Using Depth-First Search
Data Structures and Algorithms
2022-04-12 v3
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.
Keywords
Cite
@article{arxiv.2201.07197,
title = {Finding Strong Components Using Depth-First Search},
author = {Robert E. Tarjan and Uri Zwick},
journal= {arXiv preprint arXiv:2201.07197},
year = {2022}
}
Comments
27 pages. In memory of Pierre Rosenstiehl. A slightly revised version