Modules
Simple adjacency list.
Graph algorithms.
Compressed Sparse Row (CSR) is a sparse adjacency matrix graph.
Graph traits for associated data and graph construction.
Simple graphviz dot file format output.
Graph<N, E, Ty, Ix> is a graph datastructure using an adjacency list representation.
GraphMap<N, E, Ty> is a graph datastructure where node values are mapping
keys.
MatrixGraph<N, E, Ty, NullN, NullE, Ix> is a graph datastructure backed by an adjacency matrix.
Commonly used items.
StableGraph keeps indices stable across removals.
UnionFind<K> is a disjoint-set data structure.
Graph traits and graph traversals.
Structs
Graph<N, E, Ty, Ix> is a graph datastructure using an adjacency list representation.
Enums
Marker type for a directed graph.
Edge direction.
Edge direction.
Marker type for an undirected graph.
Traits
A graph’s edge type determines whether it has directed edges or not.
Convert an element like (i, j) or (i, j, w) into
a triple of source, target, edge weight.