Expand description
Helpful data structures to efficiently traverse the graph
Macros§
Structs§
- Empty
Node Set - Iter
- Path
Stack - A stack that stores sequences of
LabelNameIdas a single array - PopPath
Stack - Returned by
PathStack::pop - Small
Node Set - A
NodeSetimplementation optimized to store zero or one node - Sorted
Node IdSlice - A slice of
NodeIdwhose values are in ascending order
Enums§
- Adaptive
Node Set - Implementation of
NodeSetthat dynamically changes the underlying representation based on its content
Traits§
- NodeSet
- A set of
usizewith a known maximum value, that can be mutated - Read
Node Set - A set of
usizewith a known maximum value