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.
Directed Graphs
License
kadena-io/digraph
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|