haggle: A graph library offering mutable, immutable, and inductive graphs

[ bsd3, data-structures, graphs, library ] [ Propose Tags ]

This library provides mutable (in ST or IO), immutable, and inductive graphs. There are multiple graphs implementations provided to support different use cases and time/space tradeoffs. It is a design goal of haggle to be flexible and allow users to "pay as they go". Node and edge labels are optional. Haggle also aims to be safer than fgl: there are no partial functions in the API.

Versions [faq] 0.1.0.0
Change log ChangeLog
Dependencies base (>=4.5 && <5), containers (>=0.4), deepseq (==1.*), hashable (<1.4), monad-primitive, primitive (>=0.4 && <0.9), ref-tf (==0.4.*), vector (>=0.9 && <0.13) [details]
License BSD-3-Clause
Author Tristan Ravitch
Maintainer tristan@ravit.ch
Category Data Structures, Graphs
Source repo head: git clone https://github.com/travitch/haggle
Uploaded by TristanRavitch at Wed Dec 18 06:52:05 UTC 2019
Distributions NixOS:0.1.0.0
Downloads 164 total (62 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2019-12-18 [all 1 reports]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees