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.
-
Notifications
You must be signed in to change notification settings - Fork 5
Directed Graphs
License
kadena-io/digraph
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|