A dynamic optimal stabilizing algorithm for ®nding strongly connected components *

Mehmet Hakan, Karaata And, Fawaz Al-Anzi
An optimal self-stabilizing algroithm is presented that ®nds the strongly connected components of a directed graph on an underlying network after OC† rounds, where C is the length of the longest cycle in the graph. Because the algorithm is self-stabilizing, it is resilient to transient faults and does not require initialization. The proposed algorithm can withstand topology changes in the form of addition or removal of edges and vertices. A correctness proof of the algorithm is provided.