Struct DependencyGraph 

pub struct DependencyGraph { /* private fields */ }

Dependency graph for topological sort and cycle detection.

Implementations

impl DependencyGraph

pub fn new() -> Self

Create an empty graph.

pub fn add(&mut self, entry: ModuleEntry) -> Result<(), &'static str>

Add a module to the graph.

Errors

Returns the module’s name if it is already registered.

pub fn validate(&self) -> Result<Vec<TypeId>, GraphError>

Validate the graph: check for missing dependencies and cycles. Returns the topologically sorted TypeIds on success.

Errors

Returns GraphError::DependencyMissing if a module depends on an unregistered module. Returns GraphError::CycleDetected if a dependency cycle is found.

pub fn dependency_names(&self, type_id: TypeId) -> Vec<&'static str>

Get the registered names of all dependencies for a module.

pub fn entries(&self) -> &[ModuleEntry]

Get all entries in registration order.

pub fn name_of(&self, type_id: TypeId) -> Option<&'static str>

Look up a module’s diagnostic name by TypeId in O(1).

pub fn to_dot(&self) -> String

Export the dependency graph as a Graphviz DOT format string.

Nodes are module names; directed edges represent dependencies (dependency → dependent).

pub fn to_mermaid(&self) -> String

Export the dependency graph as a Mermaid flowchart format string.

Uses graph TD (top-down) layout. Edges: dependency –> dependent.

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.