pub fn validate(
nodes: &[WorkNode],
edges: &[WorkEdge],
) -> Result<GraphValidationReport>Expand description
Validate a node/edge set: check that all edge endpoints exist and that the dependency subgraph is acyclic (Kahn’s algorithm).
pub fn validate(
nodes: &[WorkNode],
edges: &[WorkEdge],
) -> Result<GraphValidationReport>Validate a node/edge set: check that all edge endpoints exist and that the dependency subgraph is acyclic (Kahn’s algorithm).