Struct ModuleGraph 

pub struct ModuleGraph {
    pub modules: Vec<ModuleNode>,
    pub package_usage: FxHashMap<String, Vec<FileId>>,
    pub type_only_package_usage: FxHashMap<String, Vec<FileId>>,
    pub entry_points: FxHashSet<FileId>,
    pub reverse_deps: Vec<Vec<FileId>>,
    /* private fields */
}

The core module dependency graph.

Fields

modules: Vec<ModuleNode>

All modules indexed by FileId.

package_usage: FxHashMap<String, Vec<FileId>>

Maps npm package names to the set of FileIds that import them.

type_only_package_usage: FxHashMap<String, Vec<FileId>>

Maps npm package names to the set of FileIds that import them with type-only imports. A package appearing here but not in package_usage (or only in both) indicates it’s only used for types and could be a devDependency.

entry_points: FxHashSet<FileId>

All entry point FileIds.

reverse_deps: Vec<Vec<FileId>>

Reverse index: for each FileId, which files import it.

Implementations

impl ModuleGraph

pub fn find_cycles(&self) -> Vec<Vec<FileId>>

Find all circular dependency cycles in the module graph.

Uses an iterative implementation of Tarjan’s strongly connected components algorithm (O(V + E)) to find all SCCs with 2 or more nodes. Each such SCC represents a set of files involved in a circular dependency.

Returns cycles sorted by length (shortest first), with files within each cycle sorted by path for deterministic output.

impl ModuleGraph

pub fn build( resolved_modules: &[ResolvedModule], entry_points: &[EntryPoint], files: &[DiscoveredFile], ) -> Self

Build the module graph from resolved modules and entry points.

pub const fn module_count(&self) -> usize

Total number of modules.

pub const fn edge_count(&self) -> usize

Total number of edges.

pub fn has_namespace_import(&self, file_id: FileId) -> bool

Check if any importer uses import * as ns for this module. Uses precomputed bitset — O(1) lookup.

pub fn edges_for(&self, file_id: FileId) -> Vec<FileId>

Get the target FileIds of all outgoing edges for a module.

pub fn find_import_span_start( &self, source: FileId, target: FileId, ) -> Option<u32>

Find the byte offset of the first import statement from source to target. Returns None if no edge exists or the edge has no symbols.

Trait Implementations

impl Debug for ModuleGraph

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

Formats the value using the given formatter.