Struct ModuleDependencyGraph 

pub struct ModuleDependencyGraph { /* private fields */ }

A dependency graph between modules.

Allows topological ordering for deterministic import order.

Implementations

impl ModuleDependencyGraph

pub fn new() -> Self

Create an empty dependency graph.

pub fn add_module(&mut self, name: String)

Add a module to the graph.

pub fn add_dep(&mut self, from: String, to: String)

Add a dependency edge: from depends on to.

pub fn from_cache(cache: &ModuleCache) -> Self

Build a dependency graph from a module cache.

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

Compute a topological ordering of modules (Kahn’s algorithm).

Returns Err if there is a cycle.

pub fn depends_on(&self, a: &str, b: &str) -> bool

Check if module a depends (transitively) on module b.

pub fn num_modules(&self) -> usize

Number of modules in the graph.

Trait Implementations

impl Debug for ModuleDependencyGraph

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

Formats the value using the given formatter.

impl Default for ModuleDependencyGraph

fn default() -> ModuleDependencyGraph

Returns the “default value” for a type.