Struct DependencyGraph 

pub struct DependencyGraph { /* private fields */ }

Module dependency graph.

Implementations

impl DependencyGraph

pub fn new() -> Self

Creates a new empty dependency graph.

pub fn add_module(&self, name: &str, dependencies: Vec<ModuleDependency>)

Adds a module to the graph.

pub fn mark_loaded(&self, name: &str)

Marks a module as loaded.

pub fn mark_unloaded(&self, name: &str)

Marks a module as unloaded.

pub fn dependencies_satisfied(&self, name: &str) -> bool

Checks if all dependencies of a module are satisfied.

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

Returns the load order for all modules (topological sort).

Returns modules in order they should be loaded (dependencies first).

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

Returns the unload order (reverse of load order).

pub fn has_cycle(&self) -> bool

Detects circular dependencies.

pub fn all_dependencies(&self, name: &str) -> HashSet<String>

Returns all dependencies (transitive) for a module.

pub fn all_dependents(&self, name: &str) -> HashSet<String>

Returns all modules that depend on the given module (transitive).

pub fn can_unload(&self, name: &str) -> bool

Checks if a module can be safely unloaded (no loaded dependents).

pub fn module_count(&self) -> usize

Returns the number of registered modules.

pub fn all_modules(&self) -> Vec<String>

Returns all module names.

pub fn get_module(&self, name: &str) -> Option<DependencyNode>

Returns information about a specific module.

Trait Implementations

impl Debug for DependencyGraph

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

Formats the value using the given formatter.

impl Default for DependencyGraph

fn default() -> Self

Returns the “default value” for a type.