pub fn pagerank(graph: &Graph) -> IgraphResult<Vec<f64>>Expand description
PageRank scores via power iteration with damping 0.85.
Returns a Vec<f64> summing approximately to 1. For graphs with
vcount = 0 returns an empty vector.
Counterpart of
igraph_pagerank(_, IGRAPH_PAGERANK_ALGO_POWER, _, _, vss_all(), /*directed=*/g.is_directed(), 0.85, NULL_weights, NULL_options)
with default convergence parameters.
§Examples
use rust_igraph::{Graph, pagerank};
// Triangle: every vertex has identical PageRank ≈ 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(&g).unwrap();
assert!((pr[0] - 1.0/3.0).abs() < 1e-10);
assert!((pr[1] - 1.0/3.0).abs() < 1e-10);
assert!((pr[2] - 1.0/3.0).abs() < 1e-10);