Back to Search
Start Over
Finding Strong Components Using Depth-First Search
- Publication Year :
- 2022
-
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.<br />Comment: 27 pages. In memory of Pierre Rosenstiehl. A slightly revised version
- Subjects :
- Computer Science - Data Structures and Algorithms
68Q25
F.2.2
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2201.07197
- Document Type :
- Working Paper