The Etage-Graph package

[Tags: lgpl, library, program]

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

Versions0.1, 0.1.1, 0.1.2, 0.1.4, 0.1.6, 0.1.7, 0.1.8
Dependenciesarray (>=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)
LicenseLGPL-3
Copyright(c) 2011-2013 Mitar Milutinovic
AuthorMitar Milutinovic
Maintainermitar.haskell@tnode.com
Stabilityexperimental
CategoryData Structures
Home pagehttp://mitar.tnode.com
Source repositoryhead: git clone git://github.com/mitar/etage-graph.git
Executablesetage-graph-test
UploadedSat May 10 11:08:08 UTC 2014 by MitarMilutinovic
Downloads801 total (58 in last 30 days)
StatusDocs pending
Build status unknown [no reports yet]

Modules

Downloads

Maintainers' corner

For package maintainers and hackage trustees