Function eigenvector_centrality_full 

pub fn eigenvector_centrality_full(
    graph: &Graph,
    mode: EigenvectorMode,
    weights: Option<&[f64]>,
) -> IgraphResult<EigenvectorScores>

Master entry point matching upstream’s signature.

Dispatches to the undirected / directed and weighted / unweighted branches based on graph.is_directed(), mode, and weights. Validates weights.len() == graph.ecount() when supplied.

Counterpart of igraph_eigenvector_centrality(g, &v, &λ, mode, weights, NULL) — the C-level “do everything” signature.

Examples

use rust_igraph::{Graph, eigenvector_centrality_full, EigenvectorMode};

let mut g = Graph::with_vertices(3);
g.add_edge(0, 1).unwrap();
g.add_edge(1, 2).unwrap();
g.add_edge(2, 0).unwrap();
let r = eigenvector_centrality_full(&g, EigenvectorMode::All, None).unwrap();
assert_eq!(r.vector.len(), 3);