The GraphSCC package

[Tags: bsd3, library]

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


Properties

Versions1.0, 1.0.1, 1.0.2, 1.0.3, 1.0.4
Dependenciesarray, base (<10), containers
LicenseBSD3
AuthorIavor S. Diatchki
Maintainerdiatchki@galois.com
CategoryAlgorithms
Source repositoryhead: git clone git://github.com/yav/GraphSCC.git
Upload dateWed Jan 2 22:43:17 UTC 2013
Uploaded byIavorDiatchki
DistributionsNixOS:1.0.4
Downloads562 total (46 in last 30 days)

Modules

[Index]

Flags

NameDescriptionDefault
use-mapsUse IntMap instead of mutable arrays.Disabled

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

Downloads

Maintainers' corner

For package maintainers and hackage trustees