digraph: Directed Graphs

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

Directed graphs implementation that is based on unordered-containers

[Skip to Readme]
Versions [RSS] [faq],,, 0.2, 0.2.1, 0.2.2
Change log CHANGELOG.md
Dependencies base (>=4.10 && <4.15), 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, Kadena LLC
Author Lars Kuhtz
Maintainer lars@kadena.io
Revised Revision 1 made by larsk at 2020-04-01T00:43:36Z
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 fosskers at 2019-06-03T20:09:45Z
Distributions NixOS:0.2.1
Downloads 1529 total (140 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-06-03 [all 1 reports]


[Index] [Quick Jump]


Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

For package maintainers and hackage trustees


Readme for digraph-

[back to package description]

Build Status

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.