The GraphSCC package

[Tags:bsd3, library]

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

Properties

Versions 1.0, 1.0.1, 1.0.2, 1.0.3, 1.0.4
Dependencies array, base (<10), containers [details]
License BSD3
Author Iavor S. Diatchki
Maintainer diatchki@galois.com
Stability Unknown
Category Algorithms
Source repository head: git clone git://github.com/yav/GraphSCC.git
Uploaded Mon Jul 22 21:33:46 UTC 2013 by IavorDiatchki
Distributions Arch:1.0.4, Debian:1.0.4, LTSHaskell:1.0.4, NixOS:1.0.4, Stackage:1.0.4
Downloads 2008 total (10 in the last 30 days)
Votes
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Flags

NameDescriptionDefaultType
use-mapsUse IntMap instead of mutable arrays.DisabledAutomatic

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

Maintainer's Corner

For package maintainers and hackage trustees