Struct DependencyGraph 

pub struct DependencyGraph { /* private fields */ }

Dependency graph for mutation ordering

Implementations

impl DependencyGraph

pub fn new() -> Self

pub fn add_dependency(&mut self, from: usize, to: usize)

Add dependency: from depends on to (to must complete before from)

pub fn dependencies_of(&self, idx: usize) -> &[usize]

Get all dependencies for a mutation

pub fn is_ready(&self, idx: usize, completed: &HashSet<usize>) -> bool

Check if mutation is ready (all dependencies completed)

pub fn ready_set(&self, total: usize, completed: &HashSet<usize>) -> Vec<usize>

Get all mutations ready to execute

pub fn has_ordering(&self, indices: &[usize]) -> bool

Check if there’s an ordering between any pair of indices

pub fn depends_on(&self, a: usize, b: usize) -> bool

Check if a depends on b (directly or transitively)

pub fn critical_path_length(&self, total: usize) -> usize

Calculate critical path length

pub fn topological_levels(&self, total: usize) -> Vec<Vec<usize>>

Get topological levels (mutations in same level can run in parallel)

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() -> DependencyGraph

Returns the “default value” for a type.