Struct AdjGraph 

pub struct AdjGraph {
    pub node_ids: Vec<String>,
    pub node_to_idx: HashMap<String, usize>,
    pub adj: Vec<Vec<(usize, f64)>>,
    pub degree: Vec<f64>,
    pub total_weight: f64,
}

Fields

node_ids: Vec<String>

node_to_idx: HashMap<String, usize>

adj: Vec<Vec<(usize, f64)>>

Symmetric adjacency: every undirected edge {i,j} appears as (i→j) in adj[i] and (j→i) in adj[j]. Neighbor lists are sorted by index.

degree: Vec<f64>

total_weight: f64

Sum of unique undirected edge weights (each edge counted once).

Implementations

impl AdjGraph

pub fn node_count(&self) -> usize

pub fn edge_count(&self) -> usize

Number of unique undirected edges.

pub fn from_property_graph<S: GraphSource + ?Sized>(source: &S) -> Self

The file graph of source among the files it serves now (G04): a withdrawn file is no node, so it carries no edge, no degree and no weight into the partition, the edge counts, cohesion or modularity. Under protection a graph with more files than one request can decide yields the empty graph (GraphGate::ranking_files, no seeds).

pub fn from_provider(gp: &GraphProvider) -> Self

As Self::from_property_graph, for either backend: the files and edges come from one gated read (GraphProvider::ranking_graph).

pub fn induced_subgraph(&self, members: &[usize]) -> (AdjGraph, Vec<usize>)

Induced subgraph over members (global node indices). Returns the subgraph plus a local → global index map for translating results back.