Skip to main content

pagerank

Function pagerank 

Source
pub fn pagerank(
    store: &LpgStore,
    damping: f64,
    max_iterations: usize,
    tolerance: f64,
) -> FxHashMap<NodeId, f64>
Expand description

Computes PageRank for all nodes using power iteration.

PageRank measures node importance based on the link structure, where a node is important if it’s linked to by other important nodes.

§Arguments

  • store - The graph store
  • damping - Damping factor (typically 0.85)
  • max_iterations - Maximum number of iterations
  • tolerance - Convergence tolerance (stop when change < tolerance)

§Returns

PageRank score for each node.

§Complexity

O(iterations × (V + E))