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

Stephan Merz 📧 and Vincent Trélat 📧

August 17, 2022

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


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


BSD License


Session SCC_Bloemen_Sequential