Module libreda_sta::levelization
source · Expand description
Graph levelization based on an operator formulation.
Compute the level of all graph nodes in a directed acyclic graph.
The level of a node is the minimum distance to a node without incoming edges with each edge having a distance of 1.
Structs
Traits
- Get a reference to an atomic variable which represents the level of a node. Used as an indirection to make the levelization algorithm more generic.