@hackage Etage-Graph0.1.8

Data-flow based graph algorithms

Categories
- Data Structures
License
LGPL-3.0-only
Maintainer
mitar.haskell@tnode.com
Links
Versions
- 0.1.8 Sat, 10 May 2014
- 0.1.7 Wed, 27 Mar 2013
- 0.1.6 Mon, 30 Jul 2012
- 0.1.4 Wed, 22 Jun 2011
- 0.1.2 Fri, 8 Apr 2011
- 0.1.1 Wed, 6 Apr 2011

Installation
In your cabal file:
Dependencies (5)
- base >=4.3 && <5
- containers >=0.4 && <1
- mtl >=2.0 && <3
- Etage >=0.1.11 && <0.2
- fgl >=5.4.2 && <5.5
Dependents (1)
@hackage/acme-everything

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.

@hackage Etage-Graph0.1.8

Categories

License

Maintainer

Links

Versions

Installation

Dependencies (5)

Dependents (1)