Function eigenvector_centrality_directed_weighted 

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

Directed weighted eigenvector centrality.

Like eigenvector_centrality_directed but with per-edge weights. Weights of parallel edges are summed (W[i,j] = Σ_{e: i→j} w_e).

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

Examples

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

let mut g = Graph::new(3, true).unwrap();
g.add_edge(0, 1).unwrap();
g.add_edge(1, 2).unwrap();
g.add_edge(2, 0).unwrap();
let r = eigenvector_centrality_directed_weighted(&g, EigenvectorMode::All, &[1.0, 1.0, 1.0]).unwrap();
assert_eq!(r.vector.len(), 3);