GraphSCC

Tarjan's algorithm for computing the strongly connected components of a graph.

LTS Haskell 8.24:1.0.4
Stackage Nightly 2017-10-02:1.0.4
Latest on Hackage:1.0.4

See all snapshots GraphSCC appears in

BSD-3-Clause licensed by Iavor S. Diatchki
Maintained by [email protected]
This version can be pinned in stack with:GraphSCC-1.0.4@sha256:dc3c6d6c59c15a50c9ce701bdead86f19bc2367e0d30c81a7bf55ccc6e5bd04d,936

Module documentation for 1.0.4

Depends on 3 packages(full list with versions):
array, base, containers
Used by 1 package in lts-2.22(full list with versions):
cryptol

Tarjan's algorithm for computing the strongly connected components of a graph.