digraph: Directed Graphs

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

Directed graphs implementation that is based on unordered-containers


[Skip to Readme]
Versions [faq] 0.1.0.0, 0.1.0.1, 0.1.0.2
Change log CHANGELOG.md
Dependencies base (>=4.10 && <4.14), 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
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 Mon Jun 3 20:09:45 UTC 2019
Distributions NixOS:0.1.0.2
Downloads 135 total (34 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2019-06-03 [all 1 reports]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees


Readme for digraph-0.1.0.2

[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.