Struct DependencyGraph 

pub struct DependencyGraph {
    pub dependencies: HashMap<NodeId, Vec<NodeId>>,
    pub parallel_groups: Vec<Vec<NodeId>>,
    pub critical_path: Vec<NodeId>,
    pub node_count: usize,
}

Dependency information for parallelization

Fields

dependencies: HashMap<NodeId, Vec<NodeId>>

Node ID to its dependencies

parallel_groups: Vec<Vec<NodeId>>

Nodes that can be executed in parallel (sets of independent nodes)

critical_path: Vec<NodeId>

Critical path through the circuit (longest dependency chain)

node_count: usize

Total number of nodes in the graph

Implementations

impl DependencyGraph

pub fn new() -> Self

Create an empty dependency graph

pub fn max_parallelism(&self) -> usize

Calculate the maximum parallelism (largest parallel group)

pub fn avg_parallelism(&self) -> f64

Calculate the average parallelism

Trait Implementations

impl Clone for DependencyGraph

fn clone(&self) -> DependencyGraph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for DependencyGraph

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

Formats the value using the given formatter.

impl Default for DependencyGraph

fn default() -> Self

Returns the “default value” for a type.

impl PartialEq for DependencyGraph

fn eq(&self, other: &DependencyGraph) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for DependencyGraph

impl StructuralPartialEq for DependencyGraph