digraph: Directed Graphs

[ bsd3, data, library, mathematics ] [ Propose Tags ]

Directed graphs implementation that is based on unordered-containers

[Skip to Readme]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


Versions [RSS],,, 0.2, 0.2.1, 0.2.2, 0.2.3, 0.3.0
Change log CHANGELOG.md
Dependencies base (>=4.10 && <4.16), containers (>=0.5), deepseq (>=1.4), hashable (>=1.2), massiv (>=0.3), mwc-random (>=0.14), streaming (>=0.2), transformers (>=0.5), unordered-containers (>=0.2) [details]
License BSD-3-Clause
Copyright Copyright (c) 2019 - 2021, Kadena LLC
Author Lars Kuhtz
Maintainer lars@kadena.io
Category Data, Mathematics
Home page https://github.com/kadena-io/digraph
Bug tracker https://github.com/kadena-io/digraph/issues
Source repo head: git clone https://github.com/kadena-io/digraph.git
Uploaded by larsk at 2021-08-02T17:06:46Z
Distributions NixOS:0.3.0
Downloads 2734 total (30 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2021-08-02 [all 1 reports]

Readme for digraph-0.2.2

[back to package description]

Directed graphs in adjacency set representation. The implementation is based on Data.HashMap.Strict and Data.HashSet from the unordered-containers package.

Undirected graphs are represented as symmetric, irreflexive directed graphs.