Struct DependencyGraph 

pub struct DependencyGraph { /* private fields */ }

A dependency graph of all injectable types in the application.

The graph is constructed from metadata generated by the proc macros and is validated once at container build time. After validation, the graph is not used during runtime resolution — providers resolve dependencies through static dispatch.

Construction

The graph is typically built automatically by the container builder:

let graph = DependencyGraph::new(vec![
    GraphNode::new("UserService", &["Database", "Cache"]),
    GraphNode::leaf("Database"),
    GraphNode::leaf("Cache"),
]);
graph.validate()?;

Implementations

impl DependencyGraph

pub fn empty() -> DependencyGraph

Create a new empty dependency graph.

pub fn new(nodes: Vec<GraphNode>) -> DependencyGraph

Create a new dependency graph from a list of nodes.

pub fn add_node(&mut self, node: GraphNode)

Add a node to the graph.

pub fn nodes(&self) -> &[GraphNode]

Get all nodes in the graph.

pub fn len(&self) -> usize

Get the number of nodes in the graph.

pub fn is_empty(&self) -> bool

Returns true if the graph contains no nodes.

pub fn find_node(&self, name: &str) -> Option<&GraphNode>

Find a node by name.

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

Validate the entire dependency graph.

Checks for:

• Circular dependencies (via DFS)
• Missing dependencies (references to types not in the graph)
• Duplicate node definitions
• Scope mismatches (wider-scope types depending on narrower-scope types)

Returns a list of validation errors. An empty list means the graph is valid.

pub fn topological_order(&self) -> Result<Vec<&str>, Vec<ValidationError>>

Compute the topological order of the dependency graph.

Returns nodes in construction order (dependencies before dependents). Returns an error if the graph contains cycles.

pub fn destruction_order(&self) -> Result<Vec<&str>, Vec<ValidationError>>

Compute the destruction order (reverse topological).

Dependencies are destroyed after their dependents.

Trait Implementations

impl Clone for DependencyGraph

fn clone(&self) -> DependencyGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DependencyGraph

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

Formats the value using the given formatter.