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.
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
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
The Petgraph to be used internally within the Dag for storing/managing nodes and edges.
Read only access into a Dag's internal edge array.
Read only access into a Dag's internal node array.
An alias to simplify the Recursive Walker type returned by Dag.