A simplified correctness proof for a well-known algorithm computing strongly connected components

Authors:
Ingo Wegener
Affiliations:
FB Informatik, LS2, Univ. Dortmund, 44221 Dortmund, Germany
Venue:
Information Processing Letters
Year:
2002

Citing 7
Cited 0

Graph algorithms and NP-completeness

Graph algorithms and NP-completeness
Algorithms

Algorithms
Introduction to algorithms

Introduction to algorithms
Handbook of Theoretical Computer Science

Handbook of Theoretical Computer Science
Data Structures and Algorithms

Data Structures and Algorithms
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Combinatorial Algorithms: Theory and Practice

Combinatorial Algorithms: Theory and Practice

Quantified Score

Hi-index	0.90

Visualization

Abstract

The computation of the strongly connected components of a directed graph is one of the fundamental algorithmic graph problems. Linear-time algorithms with simple implementations are known. Here a simplified correctness proof for one of these algorithms is presented.