Correctness of a Set-Based Algorithm for Computing Strongly Connected Components of a Graph

Stephan Merz 📧 and Vincent Trélat 📧

August 17, 2022

Abstract

We prove the correctness of a sequential algorithm for computing maximal strongly connected components (SCCs) of a graph due to Vincent Bloemen.
BSD License

Topics

Theories of SCC_Bloemen_Sequential