pub fn eigenvector(g: &Adjacency, iters: usize) -> Vec<f32>Expand description
Eigenvector centrality (undirected) via power iteration for iters steps.
Iterates (A + I) rather than A — the identity shift makes every eigenvalue
positive, curing the bipartite oscillation that traps plain A·x (a star /
path never converges because +λ and −λ have equal magnitude). L2-normalised
each step. 0.0 everywhere for an edgeless graph (centrality is undefined there).