Function eigenvector_centrality_directed 

pub fn eigenvector_centrality_directed(
    graph: &Graph,
    mode: EigenvectorMode,
) -> IgraphResult<EigenvectorScores>

Directed unweighted eigenvector centrality.

mode controls which side of the adjacency matrix’s left/right eigenvector is returned. Undirected input is rejected — use eigenvector_centrality instead.

Counterpart of igraph_eigenvector_centrality(g, &v, &λ, mode, NULL, NULL) on directed graphs.

Examples

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

// Directed 4-cycle 0→1→2→3→0 plus chord 1→3.
let mut g = Graph::new(4, true).unwrap();
g.add_edges(vec![(0u32, 1u32), (1, 2), (2, 3), (3, 0), (1, 3)]).unwrap();
let s = eigenvector_centrality_directed(&g, EigenvectorMode::Out).unwrap();
// Eigenvalue ≈ 1.22074 (real root of x³ = 1 + x²).
assert!((s.eigenvalue - 1.22074).abs() < 1e-3);