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.
This repository was archived by the owner on Jan 9, 2026. It is now read-only.
kadena-io/digraph
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|