arXiv Open Access 2022

Finding Strong Components Using Depth-First Search

Robert E. Tarjan Uri Zwick

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DS

Penulis (2)

Robert E. Tarjan

Uri Zwick

Format Sitasi

APA MLA BibTeX

Tarjan, R.E., Zwick, U. (2022). Finding Strong Components Using Depth-First Search. https://arxiv.org/abs/2201.07197

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2022
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓