Expand description
Commonly used items.
use petgraph::prelude::*;Structs
A breadth first search (BFS) of a graph.
Visit nodes of a graph in a depth-first-search (DFS) emitting nodes in preorder (when they are first discovered).
Visit nodes in a depth-first-search (DFS) emitting nodes in postorder (each node after all its descendants have been emitted).
Edge identifier.
Graph<N, E, Ty, Ix> is a graph datastructure using an adjacency list representation.
GraphMap<N, E, Ty> is a graph datastructure using an associative array
of its node weights N.
Node identifier.
StableGraph<N, E, Ty, Ix> is a graph datastructure using an adjacency
list representation.
Enums
Marker type for a directed graph.
Edge direction.
Marker type for an undirected graph.
Traits
An edge reference.
Type Definitions
A Graph with directed edges.
A GraphMap with directed edges.
A StableGraph with directed edges.
A StableGraph with undirected edges.
A Graph with undirected edges.
A GraphMap with undirected edges.