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

Versions 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.8), Etage-Graph (==0.1.4), 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
Copyright (c) 2011 Mitar Milutinovic
Author Mitar Milutinovic
Maintainer mitar.haskell@tnode.com
Stability experimental
Category Data Structures
Home page http://mitar.tnode.com
Source repository head: hg clone https://bitbucket.org/mitar/etage-graph
Uploaded Wed Jun 22 19:13:21 UTC 2011 by MitarMilutinovic
Distributions NixOS:0.1.8
Downloads 1749 total (19 in the last 30 days)
Votes
0 []
Status Docs not available [build log]
All reported builds failed as of 2015-12-05 [all 5 reports]

Modules

  • Data
    • Graph
      • Data.Graph.Etage

Downloads

Maintainer's Corner

For package maintainers and hackage trustees