digraph: Directed Graphs

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain]

Directed graphs implementation that is based on unordered-containers


[Skip to ReadMe]

Properties

Versions0.1.0.0, 0.1.0.1, 0.1.0.1, 0.1.0.2
Change logCHANGELOG.md
Dependenciesbase (>=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]
LicenseBSD-3-Clause
CopyrightCopyright (c) 2019, Kadena LLC
AuthorLars Kuhtz
Maintainerlars@kadena.io
CategoryData, Mathematics
Home pagehttps://github.com/kadena-io/digraph
Bug trackerhttps://github.com/kadena-io/digraph/issues
Source repositoryhead: git clone https://github.com/kadena-io/digraph.git
UploadedFri May 31 21:05:44 UTC 2019 by larsk

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees


Readme for digraph-0.1.0.1

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