Struct DependencyAnalysis 

pub struct DependencyAnalysis {
    pub predecessors: HashMap<OperatorId, HashSet<OperatorId>>,
    pub successors: HashMap<OperatorId, HashSet<OperatorId>>,
    pub sources: Vec<OperatorId>,
    pub sinks: Vec<OperatorId>,
    pub critical_path_length: usize,
    pub critical_path: Vec<OperatorId>,
}

Dependency analysis for a dataflow graph

Fields

predecessors: HashMap<OperatorId, HashSet<OperatorId>>

Predecessors of each operator (operators that must complete first)

successors: HashMap<OperatorId, HashSet<OperatorId>>

Successors of each operator (operators that depend on this one)

sources: Vec<OperatorId>

Operators with no predecessors (can start immediately)

sinks: Vec<OperatorId>

Operators with no successors (final outputs)

critical_path_length: usize

Critical path length

critical_path: Vec<OperatorId>

Operators on the critical path

Implementations

impl DependencyAnalysis

pub fn analyze(dfg: &DataflowGraph) -> Self

Analyze dependencies in a dataflow graph

pub fn parallelism_profile(&self, _dfg: &DataflowGraph) -> Vec<usize>

Get maximum available parallelism at each level

Trait Implementations

impl Debug for DependencyAnalysis

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

Formats the value using the given formatter.