/digraph

Directed Graphs

Primary LanguageHaskellBSD 3-Clause "New" or "Revised" LicenseBSD-3-Clause

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.