digraph: Directed Graphs
Downloads
- digraph-0.1.0.0.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
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
Candidates
| Versions [RSS] | 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.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 2019-05-31T18:59:15Z |
| 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:15:07Z |
| Distributions | NixOS:0.3.0 |
| Downloads | 2846 total (57 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2019-05-31 [all 1 reports] |
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.