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.
Properties
| Versions | 0.1.0.0, 0.1.0.0, 0.1.0.1, 0.1.0.2, 0.2, 0.2.1, 0.2.2, 0.2.3, 0.3.0 |
|---|---|
| Change log | CHANGELOG.md |
| Dependencies | base (>=4.10 && <4.14), containers (>=0.5), deepseq (>=1.4), hashable (>=1.3), 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 larsk at 2019-05-31T18:06:00Z |
Modules
[Index] [Quick Jump]
Downloads
- digraph-0.1.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees
Readme for digraph-0.1.0.0
[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.