Name: GraphSCC Version: 1.0.2 License: BSD3 License-file: LICENSE Author: Iavor S. Diatchki Maintainer: diatchki@galois.com Category: Algorithms Synopsis: Tarjan's algorithm for computing the strongly connected components of a graph. Description: Tarjan's algorithm for computing the strongly connected components of a graph. Build-type: Simple Cabal-Version: >= 1.2 flag use-maps default: False description: Use IntMap instead of mutable arrays. library Build-Depends: base, array, containers Exposed-modules: Data.Graph.SCC Extensions: CPP GHC-options: -O2 -Wall if flag(use-maps) Other-modules: Data.Graph.MapSCC cpp-options: -DUSE_MAPS else Extensions: Rank2Types Other-modules: Data.Graph.ArraySCC