GraphHammer: GraphHammer Haskell graph analyses framework inspired by STINGER.
GraphHammer is a graph analyses framework. See GraphHammer.SimplestParallel for library documentation. Examples exists in GraphHammer-examples package: see GraphHammer.VertexDegree, GraphHammer.TriangleCount, GraphHammer.ClusteringCoefficients for examples.
Downloads
- GraphHammer-0.3.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
- No current members of group
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.3 |
|---|---|
| Dependencies | array (>=0.3), base (>=3.0 && <5.0), containers (>=0.3), Graph500 (>=0.3), mtl (>=1.1), stm (>=2.1 && <3), time (>=1.4) [details] |
| License | GPL-2.0-only |
| Copyright | 2013, Parallel Scientific Labs, LLC |
| Author | serguey.zefirov@parsci.com |
| Maintainer | alexander.vershilov@parsci.com |
| Category | Concurrency |
| Source repo | head: git clone git://github.com/ps-labs/GraphHammer.git |
| Uploaded | by AlexanderVershilov at 2013-11-05T10:55:06Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 1427 total (0 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Successful builds reported [all 1 reports] |