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