Struct ModuleGraph 

pub struct ModuleGraph { /* private fields */ }

Module dependency graph

Implementations

impl ModuleGraph

pub fn new() -> Self

Create a new empty module graph

pub fn add_module(&mut self, path: &Path) -> ModuleId

Add or get a module by path

pub fn add_external_module( &mut self, specifier: &str, resolved: &ResolvedModule, ) -> ModuleId

Add an external module

pub fn get_module(&self, id: ModuleId) -> Option<&ModuleInfo>

Get a module by ID

pub fn get_module_mut(&mut self, id: ModuleId) -> Option<&mut ModuleInfo>

Get a mutable module by ID

pub fn get_module_by_path(&self, path: &Path) -> Option<&ModuleInfo>

Get a module by path

pub fn get_module_id(&self, path: &Path) -> Option<ModuleId>

Get module ID by path

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

Add an entry point

pub fn add_dependency(&mut self, edge: DependencyEdge)

Add a dependency edge

pub fn add_simple_dependency( &mut self, from: ModuleId, to: ModuleId, specifier: &str, )

Add a dependency between two modules

pub fn detect_circular_dependencies(&mut self) -> &[CircularDependency]

Detect circular dependencies using Tarjan’s algorithm

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

Get topological sort of modules (for build ordering)

Returns modules in dependency order: modules with no dependencies come first, followed by modules that depend only on already-listed modules. This is the correct order for building/processing modules.

pub fn get_dependents(&self, id: ModuleId) -> FxHashSet<ModuleId>

Get all modules that depend on a given module (transitive)

pub fn get_dependencies(&self, id: ModuleId) -> FxHashSet<ModuleId>

Get all dependencies of a module (transitive)

pub fn depends_on(&self, from: ModuleId, to: ModuleId) -> bool

Check if a module depends on another (directly or transitively)

pub fn stats(&self) -> ModuleGraphStats

Get statistics about the module graph

pub fn modules(&self) -> impl Iterator<Item = &ModuleInfo>

Get all modules in the graph

pub fn len(&self) -> usize

Get number of modules

pub fn is_empty(&self) -> bool

Check if graph is empty

pub fn edges(&self) -> &[DependencyEdge]

Get all edges

pub fn entry_points(&self) -> &[ModuleId]

Get entry points

pub fn circular_deps(&self) -> &[CircularDependency]

Get circular dependencies

pub fn clear(&mut self)

Clear the graph

Trait Implementations

impl Debug for ModuleGraph

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

Formats the value using the given formatter.

impl Default for ModuleGraph

fn default() -> Self

Returns the “default value” for a type.