Crate daggy [−] [src]
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.
Modules
petgraph |
Structs
Dag |
A Directed acyclic graph (DAG) data structure. |
EdgeIndex |
Edge identifier. |
EdgeWeightsMut |
Iterator yielding mutable access to all edge weights. |
NodeIndex |
Node identifier. |
NodeWeightsMut |
Iterator yielding mutable access to all node weights. |
WalkChildren |
A "walker" object that can be used to step through the children of some parent node. |
WalkParents |
A "walker" object that can be used to step through the children of some parent node. |
WouldCycle |
An error returned by the |
Type Definitions
Children |
An iterator yielding indices to the children of some node. |
Parents |
An iterator yielding indices to the parents of some node. |
PetGraph |
The Petgraph to be used internally within the Dag for storing/managing nodes and edges. |
RawEdges |
Read only access into a Dag's internal edge array. |
RawNodes |
Read only access into a Dag's internal node array. |