Struct ModuleGraph 

pub struct ModuleGraph {
    pub modules: BTreeMap<ModuleId, ModuleInfo>,
    pub edges: BTreeMap<ModuleId, BTreeSet<ModuleId>>,
    pub entry: ModuleId,
}

A directed acyclic graph of module dependencies. Uses BTreeMap internally for deterministic iteration order.

Fields

modules: BTreeMap<ModuleId, ModuleInfo>

All modules in the graph, keyed by ModuleId.

edges: BTreeMap<ModuleId, BTreeSet<ModuleId>>

Directed edges: module → set of modules it depends on.

entry: ModuleId

The entry module ID.

Implementations

impl ModuleGraph

pub fn topological_order(&self) -> Result<Vec<ModuleId>, ModuleError>

Return modules in deterministic topological order (dependencies first). Returns Err if a cycle is detected.

pub fn module_count(&self) -> usize

Get the number of modules in the graph.

Trait Implementations

impl Clone for ModuleGraph

fn clone(&self) -> ModuleGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ModuleGraph

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

Formats the value using the given formatter.