@hackage GraphSCC1.0.3

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

Categories
- Algorithms
License
BSD-3-Clause
Maintainer
diatchki@galois.com
Links
Versions
- 1.0.4 Mon, 22 Jul 2013
- 1.0.3 Wed, 2 Jan 2013
- 1.0.2 Fri, 26 Sep 2008
- 1.0.1 Fri, 26 Sep 2008
- 1.0 Wed, 2 Jul 2008

Installation
In your cabal file:
Dependencies (3)
- array
- base <10
- containers
Dependents (4)
@hackage/passage, @hackage/cryptol, @hackage/acme-everything, @hackage/forml

Package Flags

use-maps

(off by default)

Use IntMap instead of mutable arrays.

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