Function centralization_eigenvector_wrapper 

pub fn centralization_eigenvector_wrapper(
    graph: &Graph,
    normalized: bool,
) -> IgraphResult<CentralizationResult>

Eigenvector centralization: compute per-vertex eigenvector centrality scores and the graph-level centralization in one call.

For directed graphs, uses EigenvectorMode::Out (the standard convention matching upstream). The eigenvector is max-1 normalised.

Counterpart of igraph_centralization_eigenvector_centrality().

Examples

use rust_igraph::{Graph, centralization_eigenvector_wrapper};

// Star K_{1,4}: center has eigenvector centrality 1.0, leaves ≈ 0.5.
let mut g = Graph::with_vertices(5);
for v in 1..5u32 { g.add_edge(0, v).unwrap(); }
let r = centralization_eigenvector_wrapper(&g, true).unwrap();
assert!(r.centralization > 0.0);
assert!((r.scores[0] - 1.0).abs() < 1e-9);