This crate provides different representations for graphs, some of which are efficient to use, and others that are efficient to construct.
The crate supports conversion between the different representations while preserving node ids.
If you are missing a feature or found a bug, please open an issue on github.
Defines the adjacency array graph representation.
Defines different traits of graphs.
A mutable graph representation.
Identifies an edge in a graph.
Identifies a node in a graph.
The internal type used for node and edge ids.