# Finding Strong Components Using Depth-First Search

arXiv: https://arxiv.org/abs/2201.07197 · HTML: https://mlsanity.com/paper/2201.07197/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 18 Jan 2022.

## Built on by (most cited first, 1 of 1)

- [ICBAC: an Intelligent Contract-Based Access Control framework for supply chain management by integrating blockchain and federated learning](https://mlsanity.com/paper/2602.08014/) (2026)

## Abstract (arXiv)

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.