Struct DependencyGraph 

pub struct DependencyGraph { /* private fields */ }

Directed dependency graph of architectural components.

Implementations

impl DependencyGraph

pub fn new() -> Self

pub fn add_component(&mut self, component: &Component) -> NodeIndex

Add a component as a node. Returns the node index.

pub fn ensure_node( &mut self, id: &ComponentId, layer: Option<ArchLayer>, is_cross_cutting: bool, ) -> NodeIndex

Ensure a component ID exists as a node (create a minimal node if needed).

pub fn ensure_node_with_mode( &mut self, id: &ComponentId, layer: Option<ArchLayer>, is_cross_cutting: bool, architecture_mode: ArchitectureMode, ) -> NodeIndex

Ensure a component ID exists as a node with a specific architecture mode.

pub fn add_dependency(&mut self, dep: &Dependency)

Add a dependency as an edge.

pub fn edges_with_nodes(&self) -> Vec<(&GraphNode, &GraphNode, &GraphEdge)>

Iterate over all edges with their source and target nodes.

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

Find cycles using DFS. Returns groups of component IDs that form cycles.

pub fn node_count(&self) -> usize

Count ports and adapters in the graph.

pub fn nodes(&self) -> Vec<&GraphNode>

Get all nodes

pub fn mark_external(&mut self, id: &ComponentId)

Mark a node as external (not from analyzed source files).

pub fn nodes_by_layer(&self) -> HashMap<String, usize>

Count nodes grouped by layer, skipping external nodes.

pub fn layer_coupling_matrix(&self) -> LayerCouplingMatrix

Build a layer coupling matrix from edge data.

pub fn max_dependency_depth(&self) -> usize

Calculate max dependency depth using BFS from each root node.

Trait Implementations

impl Default for DependencyGraph

fn default() -> Self

Returns the “default value” for a type.