Strongly Connected Components

[Richard Henderson]

Standard algorithm, good foundation for other algorithms.

Neo version is here: https://neo4j.com/docs/graph-algorithms/current/algorithms/strongly-connected-components/

I suggest we go with Tarjan's algorithm, though parallelisation may be poor as it is depth first.

O(|V|+|E|) i.e. linear time.