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.
| Versions | 1.0, 1.0.1, 1.0.2 |
|---|---|
| Dependencies | array, base, containers |
| License | BSD3 |
| Author | Iavor S. Diatchki |
| Maintainer | diatchki@galois.com |
| Category | Algorithms |
| Upload date | Fri Sep 26 19:25:42 UTC 2008 |
| Uploaded by | IavorDiatchki |
| Built on | ghc-6.10, ghc-6.8 |
Modules
- Data
- Graph
Downloads
- GraphSCC-1.0.2.tar.gz (Cabal source package)
- package description (included in the package)