Struct SchedulingGraph 

pub struct SchedulingGraph {
    pub tasks: Vec<LeafTask>,
    pub task_map: HashMap<TaskId, usize>,
    pub successors: HashMap<TaskId, Vec<DependencyEdge>>,
    pub predecessors: HashMap<TaskId, Vec<DependencyEdge>>,
    pub topo_order: Vec<TaskId>,
    pub qualified_to_simple: HashMap<String, TaskId>,
}

A flattened, schedulable graph of leaf tasks only

Fields

tasks: Vec<LeafTask>

All leaf tasks (no containers)

task_map: HashMap<TaskId, usize>

Task lookup by ID

successors: HashMap<TaskId, Vec<DependencyEdge>>

Adjacency list: task_id -> list of successor task_ids with edges

predecessors: HashMap<TaskId, Vec<DependencyEdge>>

Reverse adjacency: task_id -> list of predecessor task_ids with edges

topo_order: Vec<TaskId>

Topological order (computed once, reused)

qualified_to_simple: HashMap<String, TaskId>

Map from qualified ID to simple ID (for container date derivation)

Implementations

impl SchedulingGraph

pub fn from_wbs(tasks: &[Task]) -> Result<Self, GraphError>

Flatten a WBS tree into a scheduling graph

pub fn get_task(&self, id: &str) -> Option<&LeafTask>

Get a leaf task by ID

Trait Implementations

impl Debug for SchedulingGraph

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

Formats the value using the given formatter.