Struct SccAnalysis 

pub struct SccAnalysis {
    pub components: Vec<Scc>,
    pub node_to_component: HashMap<NodeIndex, usize>,
}

Complete SCC analysis results for a dependency graph.

Fields

components: Vec<Scc>

SCCs in reverse topological order (dependencies before dependents)

node_to_component: HashMap<NodeIndex, usize>

Map from node index to its component index

Implementations

impl SccAnalysis

pub fn analyze(graph: &DiGraph<NodeData, EdgeData>) -> Self

Analyze a graph and compute SCCs on the dependency subgraph.

Ownership edges are excluded from SCC computation per graph-model.md. The dependency subgraph includes Import and Reference edge kinds.

Uses an EdgeFiltered view instead of cloning the graph - zero-cost, no allocation for the subgraph.

pub fn component_of(&self, node: NodeIndex) -> Option<usize>

Get the component index for a specific node.

pub fn mutually_dependent(&self, a: NodeIndex, b: NodeIndex) -> bool

Check if two nodes are in the same SCC (mutually dependent).

pub fn has_cycles(&self) -> bool

Returns true if any cycles exist in the graph.

pub fn cyclic_components(&self) -> impl Iterator<Item = &Scc>

Get all cyclic components.

pub fn acyclic_components(&self) -> impl Iterator<Item = &Scc>

Get all acyclic (independent/dependency) components.

pub fn hint_counts(&self) -> HashMap<DeployabilityHint, usize>

Count of components by hint type.

Trait Implementations

impl Clone for SccAnalysis

fn clone(&self) -> SccAnalysis

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SccAnalysis

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

Formats the value using the given formatter.