Struct StepDependencyGraph 

pub struct StepDependencyGraph { /* private fields */ }

Dependency graph over the steps of an instantiated job.

Implementations

impl StepDependencyGraph

pub fn new(job: &Job) -> Result<Self, ModelError>

Build the dependency graph from a Job.

pub fn step_node(&self, name: &str) -> Option<&StepDependencyNode>

Get a node by step name.

pub fn node_count(&self) -> usize

Number of nodes in the graph.

pub fn edge(&self, index: usize) -> Option<&StepDependencyEdge>

Get an edge by index.

pub fn node(&self, index: usize) -> Option<&StepDependencyNode>

Get a node by index.

pub fn max_indegree(&self) -> usize

Maximum in-degree (max number of dependencies any step has).

pub fn max_outdegree(&self) -> usize

Maximum out-degree (max number of steps that depend on any single step).

pub fn topo_sorted(&self) -> Result<Vec<usize>, ModelError>

Stable topological sort matching the Python implementation.

DFS-based: processes nodes in template order. For each unvisited node, pushes it onto a stack and explores dependencies (pushed in reverse template order so the earliest dependency is processed first). Returns step indices in dependency-respecting, template-stable order.

pub fn topo_sorted_names(&self) -> Result<Vec<String>, ModelError>

Convenience: topological sort returning step names.

Trait Implementations

impl Debug for StepDependencyGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.