Etage-Graph: Data-flow based graph algorithms
Data-flow based graph algorithms using the Control.Etage framework, showcasing its use for data-flow computations. It is meant to be used with the Data.Graph.Inductive package which provides graph structures these algorithms take as an input.
Currently only the shortest paths computation is implemented (from all to all nodes).
Also a benchmarking test program is provided, comparing the performance with algorithms found in the
Data.Graph.Inductive package.
| Versions [faq] | 0.1, 0.1.1, 0.1.2, 0.1.4, 0.1.6, 0.1.7, 0.1.8 |
|---|---|
| Dependencies | array (>=0.3 && <1), base (>=4.3 && <5), containers (>=0.4 && <1), deepseq (>=1.1 && <2), Etage (>=0.1.11 && <0.2), Etage-Graph (==0.1.7), fgl (>=5.4.2 && <5.5), mtl (>=2.0 && <3), parallel (>=3.1 && <4), random (>=1.0 && <2), time (>=1.1 && <2) [details] |
| License | LGPL-3.0-only |
| Copyright | (c) 2011-2013 Mitar Milutinovic |
| Author | Mitar Milutinovic |
| Maintainer | mitar.haskell@tnode.com |
| Category | Data Structures |
| Home page | http://mitar.tnode.com |
| Source repo | head: git clone git://github.com/mitar/etage-graph.git |
| Uploaded | by MitarMilutinovic at 2013-03-27T08:05:05Z |
| Distributions | NixOS:0.1.8 |
| Executables | etage-graph-test |
| Downloads | 5318 total (18 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] |
Downloads
- Etage-Graph-0.1.7.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)