digraph: Directed Graphs

[ bsd3, data, library, mathematics ] [ Propose Tags ] [ Report a vulnerability ]

Directed graphs implementation that is based on unordered-containers

[Skip to Readme]

Modules

[Index] [Quick Jump]

Data
- Data.DiGraph
  - Data.DiGraph.FloydWarshall
  - Data.DiGraph.Random

Downloads

digraph-0.3.2.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

Package maintainers

larsk, fosskers

For package maintainers and hackage trustees

edit package information

Candidates

0.1.0.0, 0.1.0.1, 0.2

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
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 2025-04-01T21:01:31Z
Distributions	LTSHaskell:0.3.2, NixOS:0.3.2, Stackage:0.3.2
Downloads	3120 total (38 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.