GraphSCC

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

Version on this page:1.0.4
LTS Haskell 8.24:1.0.4
Stackage Nightly 2017-10-02:1.0.4
Latest on Hackage:1.0.4
BSD3 licensed by Iavor S. Diatchki
Maintained by diatchki@galois.com

Module documentation for 1.0.4

There are no documented modules for this package.

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

Depends on:
Used by 3 packages:
comments powered byDisqus