---

Strong Components via Graph Reachability

We motivate the problem of finding strong components in a directed graph and present an efficient algorithm using Depth First Search.