Struct NormalizedGraph 

pub struct NormalizedGraph {
    pub raw: RawGraph,
    pub condensed: DiGraph<SccNode, ()>,
    pub reduced: DiGraph<SccNode, ()>,
    pub item_to_scc: HashMap<String, NodeIndex>,
}

The fully normalized dependency graph.

Contains three views of the same data:

• raw: the original RawGraph with all nodes and edges as-is.
• condensed: condensed DAG where each node is an SccNode.
• reduced: transitively-reduced condensed DAG (minimum edges).

Fields

raw: RawGraph

Original graph from SQLite (may contain cycles).

condensed: DiGraph<SccNode, ()>

Condensed DAG: SCCs collapsed to single nodes.

reduced: DiGraph<SccNode, ()>

Transitively-reduced condensed DAG (minimum edge set).

item_to_scc: HashMap<String, NodeIndex>

Mapping from item ID to condensed node index.

Implementations

impl NormalizedGraph

pub fn from_raw(raw: RawGraph) -> Self

Build a NormalizedGraph from a RawGraph.

Steps:

1. Run petgraph’s SCC condensation (Tarjan’s algorithm internally).
2. Build SccNode labels from the raw node weights.
3. Compute transitive reduction of the condensed DAG.

Panics

Does not panic — all indices are verified.

pub fn scc_count(&self) -> usize

Return the number of SCCs in the condensed graph.

pub fn cycle_count(&self) -> usize

Return the number of cycle SCCs (SCCs with more than one member).

pub fn cyclic_items(&self) -> Vec<&str>

Return all items that are members of a dependency cycle.

pub fn scc_of(&self, item_id: &str) -> Option<NodeIndex>

Return the SCC node index for a given item ID.

pub fn content_hash(&self) -> &str

Return the content hash from the underlying raw graph.

Used for cache invalidation — if this changes, rebuild.

Trait Implementations

impl Debug for NormalizedGraph

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

Formats the value using the given formatter.