๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A correction to a unilaterally connected components algorithm

โœ Scribed by Grant A. Cheston

Book ID
113162004
Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
151 KB
Volume
7
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A simplified correctness proof for a wel
A simplified correctness proof for a well-known algorithm computing strongly connected components
โœ Ingo Wegener ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 44 KB

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.