Module daggy::stable_dag [−][src]
Expand description
This module includes the implementation of the StableDag data structure. The StableDag has a similar functionality to the Dag data structure, but it does not invalidate node indices when a node is removed.
Structs
A Walker type that can be used to step through the children of some parent node.
Edge identifier.
An iterator yielding multiple EdgeIndexs, returned by the StableGraph::add_edges method.
Iterator yielding mutable access to all edge weights.
Node identifier.
Iterator yielding mutable access to all node weights.
A Walker type that can be used to step through the parents of some child node.
A Directed acyclic graph (DAG) data structure.
Traits
A walker is a traversal state, but where part of the traversal information is supplied manually to each next call.
Type Definitions
An iterator yielding all edges to/from some node.
An alias to simplify the Recursive Walker type returned by StableDag.