@hackage digraph0.3.0

Directed Graphs

Categories
- Mathematics
License
BSD-3-Clause
Maintainer
lars@kadena.io
Links
Versions
- 0.3.0 Fri, 3 Feb 2023
- 0.2.3 Fri, 3 Feb 2023
- 0.2.2 Mon, 2 Aug 2021
- 0.2.1 Sun, 1 Aug 2021
- 0.2 Wed, 20 May 2020
- 0.1.0.2 Wed, 1 Apr 2020

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.

Installation
In your cabal file:
Tested Compilers
Dependencies (9)
- base >=4.11 && <5
- containers >=0.5
- deepseq >=1.4
- transformers >=0.5
- hashable >=1.2
- massiv >=0.3
Dependents (0)

@hackage digraph0.3.0

Categories

License

Maintainer

Links

Versions

Installation

Tested Compilers

Dependencies (9)

Dependents (0)