Function leading_eigenvector_weighted 

pub fn leading_eigenvector_weighted(
    graph: &Graph,
    weights: &[f64],
    steps: Option<u32>,
) -> IgraphResult<LeadingEigenvectorResult>

Weighted leading eigenvector community detection (convenience wrapper).

Equivalent to leading_eigenvector(graph, Some(weights), steps).

Examples

use rust_igraph::{Graph, leading_eigenvector_weighted};

let mut g = Graph::with_vertices(4);
g.add_edge(0, 1).unwrap();
g.add_edge(1, 2).unwrap();
g.add_edge(2, 3).unwrap();
g.add_edge(0, 3).unwrap();
let w = vec![1.0; 4];
let r = leading_eigenvector_weighted(&g, &w, None).unwrap();
assert_eq!(r.membership.len(), 4);