Etage-Graph: Data-flow based graph algorithms

[ data-structures, lgpl, library, program ] [ Propose Tags ]

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.

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.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) [details]
License LGPL-3.0-only
Copyright (c) 2011-2013 Mitar Milutinovic
Author Mitar Milutinovic
Maintainer mitar.haskell@tnode.com
Category Data Structures
Home page http://mitar.tnode.com
Source repo head: git clone git://github.com/mitar/etage-graph.git
Uploaded by MitarMilutinovic at Wed Mar 27 08:05:05 UTC 2013
Distributions NixOS:0.1.8
Executables etage-graph-test
Downloads 3092 total (17 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees