Struct DependencyGraph 

pub struct DependencyGraph {
    pub nodes: HashMap<u64, DependencyNode>,
}

Fields

nodes: HashMap<u64, DependencyNode>

Implementations

impl DependencyGraph

pub fn new() -> Self

pub fn add_level(&mut self, level_id: u64)

pub fn add_dependency( &mut self, from: u64, to: u64, edge_type: DependencyEdgeType, )

pub fn detect_cycles(&self) -> Option<Vec<u64>>

DFS-based cycle detection. Returns Some(cycle) if a cycle exists.

pub fn topological_sort(&self) -> Result<Vec<u64>, Vec<u64>>

Topological sort (Kahn’s algorithm). Returns load order.

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

Plan parallel load batches based on dependency order

pub fn get_all_dependencies( &self, level_id: u64, include_optional: bool, ) -> HashSet<u64>

Trait Implementations

impl Debug for DependencyGraph

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

Formats the value using the given formatter.