| CARVIEW |
Select Language
HTTP/1.1 200 OK
Connection: keep-alive
Server: nginx/1.24.0 (Ubuntu)
Content-Type: text/html; charset=utf-8
Cache-Control: public, max-age=300
Content-Encoding: gzip
Via: 1.1 varnish, 1.1 varnish
Accept-Ranges: bytes
Age: 0
Date: Sun, 18 Jan 2026 10:49:59 GMT
X-Served-By: cache-dfw-kdfw8210052-DFW, cache-bom-vanm7210038-BOM
X-Cache: MISS, MISS
X-Cache-Hits: 0, 0
X-Timer: S1768733399.820160,VS0,VE828
Vary: Accept, Accept-Encoding
transfer-encoding: chunked
digraph: Directed Graphs
digraph: Directed Graphs
Downloads
- digraph-0.3.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
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, 0.3.1, 0.3.2 |
|---|---|
| Change log | CHANGELOG.md |
| Dependencies | base (>=4.11 && <5), 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] |
| Tested with | ghc ==9.12, ghc ==9.10, ghc ==9.8, ghc ==9.6 |
| License | BSD-3-Clause |
| Copyright | Copyright (c) 2019 - 2025, Kadena LLC |
| Author | Lars Kuhtz |
| Maintainer | lars@kadena.io |
| Uploaded | by larsk at 2025-04-01T21:01:31Z |
| 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 |
| Distributions | LTSHaskell:0.3.2, NixOS:0.3.2, Stackage:0.3.2 |
| Downloads | 3202 total (52 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating |
|
| Status | Docs available [build log] Last success reported on 2025-04-01 [all 1 reports] |
Readme for digraph-0.3.2
[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.