The Etage-Graph package
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.
Properties
| Versions | 0.1, 0.1.1, 0.1.2, 0.1.4, 0.1.6, 0.1.7 |
|---|---|
| Dependencies | array (≥0.3 & <1), base (≥4.3 & <5), containers (≥0.4 & <1), deepseq (≥1.1 & <2), Etage (≥0.1.11 & <0.2), fgl (≥5.4.2 & <5.5), mtl (≥2.0 & <3), parallel (≥3.1 & <4), random (≥1.0 & <2), time (≥1.1 & <2) |
| License | LGPL-3 |
| Copyright | (c) 2011-2013 Mitar Milutinovic |
| Author | Mitar Milutinovic |
| Maintainer | mitar.haskell@tnode.com |
| Stability | experimental |
| Category | Data Structures |
| Home page | http://mitar.tnode.com |
| Source repository | git clone git://github.com/mitar/etage-graph.git |
| Executables | etage-graph-test |
| Upload date | Wed Mar 27 08:05:05 UTC 2013 |
| Uploaded by | MitarMilutinovic |
| Built on | ghc-7.6 |
Modules
- Data
- Graph
Downloads
- Etage-Graph-0.1.7.tar.gz (Cabal source package)
- package description (included in the package)