Expand description
Module for algorithms that work on DAGs.
Enums§
- Topological
Sort Error - An error enumeration returned by topological sort functions.
Functions§
- collect_
bicolor_ runs - Collect runs that match a filter function given edge colors.
- collect_
runs - Collect runs that match a filter function
- layers
- Return an iterator of graph layers
- lexicographical_
topological_ sort - Get the lexicographical topological sorted nodes from the provided DAG.
- longest_
path - Calculates the longest path in a directed acyclic graph (DAG).
- traversal_
directions - Return a pair of
petgraph::Directionvalues corresponding to the “forwards” and “backwards” direction of graph traversal, based on whether the graph is being traversed forwards (following the edges) or backward (reversing along edges). The order of returns is (forwards, backwards).