Finding Strong Components Using Depth-First Search

01/18/2022
by   Robert E. Tarjan, et al.
0

We survey three algorithms that use depth-first search to find strong components in linear time: the algorithm of Tarjan, a natural algorithm that finds cycles and contracts them, and an algorithm that does two searches, one forward, one backward.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset