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.10 && <0.2), Etage-Graph (==0.1.6), 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-2012 Mitar Milutinovic
AuthorMitar Milutinovic
Maintainermitar.haskell@tnode.com
Stabilityexperimental
CategoryData Structures
Home pagehttp://mitar.tnode.com
Source repositoryhead: hg clone https://bitbucket.org/mitar/etage-graph
Executablesetage-graph-test
Upload dateMon Jul 30 20:15:57 UTC 2012
Uploaded byMitarMilutinovic
Downloads634 total (73 in last 30 days)

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees