Crate daggy[−][src]
Expand description
daggy is a directed acyclic graph data structure library.
The most prominent type is Dag - a wrapper around petgraph’s Graph data structure, exposing a refined API targeted towards directed acyclic graph related functionality.
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.
Re-exports
pub use petgraph;Modules
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.
Structs
A Walker type that can be used to step through the children of some parent node.
A Directed acyclic graph (DAG) data structure.
Edge identifier.
An iterator yielding multiple EdgeIndexs, returned by the Graph::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.
An error returned by the Dag::add_edge method in the case that adding an edge would have
caused the graph to cycle.
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.
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.