Struct ImportGraph 

pub struct ImportGraph {
    pub id_to_path: Vec<String>,
    pub path_to_id: HashMap<String, usize>,
    pub adj: Vec<Vec<usize>>,
}

The directed structural import graph. Nodes are repo-relative paths: every live Tier-1 source file, plus any resolved import endpoint. A file that neither imports nor is imported is still a node (a singleton with empty adjacency), so isolated files are counted in n. Edges are src → target (“src imports target”).

Fields

id_to_path: Vec<String>

Dense node id → path.

path_to_id: HashMap<String, usize>

Path → dense node id.

adj: Vec<Vec<usize>>

Adjacency: adj[u] is the set of nodes u imports (deduped, self-loops removed).

Implementations

impl ImportGraph

pub fn len(&self) -> usize

Number of nodes in the graph.

pub fn is_empty(&self) -> bool

Whether the graph has no nodes (no live source files).

pub fn resolved_edges(&self) -> Vec<(&str, &str)>

The resolved (src_path, target_path) edges as borrowed pairs, in adjacency order. Lets facts::ingest materialize a historical import table from a graph the analyses layer built without facts naming the ImportGraph type (the analyses→facts layering only points one way).