Struct DepGraph 

pub struct DepGraph { /* private fields */ }

Directed dependency graph where edges go from a module to its dependencies.

Implementations

impl DepGraph

pub fn new() -> Self

Creates a new empty dependency graph.

pub fn from_modules(modules: &[Module]) -> Self

Builds a dependency graph from a collection of parsed modules.

Each module’s import declarations are inspected to determine dependencies. Modules without a declared path are assigned a synthetic ID based on their index in the input slice.

pub fn add_module_with_deps( &mut self, module_id: ModuleId, deps: HashSet<ModuleId>, )

Adds a module and its dependencies to the graph.

pub fn add_module(&mut self, module_id: ModuleId)

Adds a single module with no dependencies.

pub fn dependencies(&self, module_id: &str) -> Option<&HashSet<ModuleId>>

Returns the direct dependencies of a module.

pub fn dependents(&self, module_id: &str) -> Option<&HashSet<ModuleId>>

Returns the modules that directly depend on the given module (reverse deps).

pub fn modules(&self) -> Vec<&ModuleId>

Returns all module IDs in the graph.

pub fn module_count(&self) -> usize

Returns the number of modules in the graph.

pub fn has_cycle(&self) -> bool

Returns true if the graph contains cycles.

pub fn topological_order(&self) -> Option<Vec<ModuleId>>

Returns a topological ordering of modules (dependencies before dependents).

Returns None if the graph contains a cycle.

Trait Implementations

impl Clone for DepGraph

fn clone(&self) -> DepGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DepGraph

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

Formats the value using the given formatter.

impl Default for DepGraph

fn default() -> DepGraph

Returns the “default value” for a type.