pub fn pagerank_weighted(
graph: &Graph,
weights: &[f64],
) -> IgraphResult<Vec<f64>>Expand description
Weighted PageRank scores via power iteration with damping 0.85.
Returns a Vec<f64> summing approximately to 1. weights[e] is
the weight of edge e; weights must be non-negative and finite,
and weights.len() must equal graph.ecount().
§Examples
use rust_igraph::{Graph, pagerank_weighted};
// Triangle with unit weights → matches unweighted PR-011 (uniform 1/3).
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 pr = pagerank_weighted(&g, &[1.0, 1.0, 1.0]).unwrap();
for v in 0..3 {
assert!((pr[v] - 1.0/3.0).abs() < 1e-9);
}