GraphSCC: Tarjan's algorithm for computing the strongly connected components of a graph.
Tarjan's algorithm for computing the strongly connected components of a graph.
Flags
Automatic Flags
| Name | Description | Default |
|---|---|---|
| use-maps | Use IntMap instead of mutable arrays. | Disabled |
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
Downloads
- GraphSCC-1.0.4.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 1.0, 1.0.1, 1.0.2, 1.0.3, 1.0.4 |
|---|---|
| Dependencies | array, base (<10), containers [details] |
| License | BSD-3-Clause |
| Author | Iavor S. Diatchki |
| Maintainer | diatchki@galois.com |
| Category | Algorithms |
| Source repo | head: git clone git://github.com/yav/GraphSCC.git |
| Uploaded | by IavorDiatchki at 2013-07-22T21:33:46Z |
| Distributions | Arch:1.0.4, Debian:1.0.4, NixOS:1.0.4 |
| Reverse Dependencies | 3 direct, 0 indirect [details] |
| Downloads | 10953 total (43 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |