Abstract

We survey three algorithms that use depth-first search to find the strong components of a directed graph in linear time: (1) Tarjan’s algorithm; (2) a cycle-finding algorithm; and (3) a bidirectional search algorithm.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call