Struct ModuleGraph 

pub struct ModuleGraph {
    pub order: Vec<ModulePath>,
    pub imports: BTreeMap<ModulePath, Vec<ScannedImport>>,
}

The resolved dependency graph: every module’s scanned imports plus the deterministic topological order (dependencies first, entry last).

Fields

order: Vec<ModulePath>

Topological order, dependencies before dependents. With no cycles this always contains every module of the set exactly once.

imports: BTreeMap<ModulePath, Vec<ScannedImport>>

Every scanned import per module — including the refused forms, so downstream diagnostics fire with real locations.

Implementations

impl ModuleGraph

pub fn build(set: &ModuleSet) -> Result<ModuleGraph, ModuleError>

Build + topologically sort. Refuses cycles with axon-T955, naming the full cycle path.

pub fn dependencies_of(&self, module: &ModulePath) -> Vec<&ModulePath>

The resolvable dependency paths of module (deterministic order).

Trait Implementations

impl Debug for ModuleGraph

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

Formats the value using the given formatter.