Struct TaskGraph 

pub struct TaskGraph {
    pub nodes: Vec<TaskNode>,
    pub edges: Vec<TaskEdge>,
}

A directed acyclic task dependency graph.

Fields

nodes: Vec<TaskNode>

All registered task nodes.

edges: Vec<TaskEdge>

All directed edges.

Implementations

impl TaskGraph

pub fn new() -> Self

Create an empty TaskGraph.

pub fn add_node(&mut self, node: TaskNode)

Add a task node.

pub fn add_edge(&mut self, edge: TaskEdge)

Add a directed edge.

pub fn successors(&self, id: u64) -> Vec<u64>

Return the IDs of all nodes that are direct successors of id.

pub fn predecessors(&self, id: u64) -> Vec<u64>

Return the IDs of all nodes that are direct predecessors of id.

pub fn root_nodes(&self) -> Vec<u64>

Return IDs of nodes that have no incoming edges (roots of the DAG).

pub fn critical_path_ms(&self) -> u64

Compute the critical path length (ms) via dynamic programming.

The critical path is the longest weighted path from any root node to any leaf node, where each node contributes its estimated_ms.

Returns 0 if the graph has no nodes.

Trait Implementations

impl Clone for TaskGraph

fn clone(&self) -> TaskGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TaskGraph

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

Formats the value using the given formatter.

impl Default for TaskGraph

fn default() -> TaskGraph

Returns the “default value” for a type.