daggy is a directed acyclic graph data structure library.
The Walker trait defines a variety of useful methods for traversing any graph type. Its methods behave similarly to iterator types, however Walkers do not require borrowing the graph. This means that we can still safely mutably borrow from the graph whilst we traverse it.
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.
Walker is a trait providing a variety of useful methods for traversing graph types.
A Walker type that can be used to step through the children of some parent node.
A Directed acyclic graph (DAG) data structure.
An iterator yielding multiple
EdgeIndexs, returned by the
Iterator yielding mutable access to all edge weights.
Iterator yielding mutable access to all node weights.
A Walker type that can be used to step through the parents of some child node.
An error returned by the
Dag::add_edge method in the case that adding an edge would have
caused the graph to cycle.
A walker is a traversal state, but where part of the traversal information is supplied manually to each next call.