Struct PageRank 

pub struct PageRank {
    pub alpha: f64,
    pub epsilon: f64,
    pub max_iterations: usize,
}

PageRank algorithm for identifying critical nodes

Nodes with high PageRank are “important” because many other nodes link to them. In attack path analysis, high PageRank nodes are critical chokepoints.

Fields

alpha: f64

Damping factor (probability of following a link vs teleporting)

epsilon: f64

Convergence threshold

max_iterations: usize

Maximum iterations

Implementations

impl PageRank

pub fn new() -> Self

Create PageRank with default parameters

pub fn alpha(self, alpha: f64) -> Self

Set damping factor (default: 0.85)

pub fn epsilon(self, epsilon: f64) -> Self

Set convergence threshold (default: 1e-6)

pub fn max_iterations(self, max: usize) -> Self

Set maximum iterations (default: 100)

pub fn run(&self, graph: &GraphStore) -> PageRankResult

Run PageRank on the graph

Trait Implementations

impl Default for PageRank

fn default() -> Self

Returns the “default value” for a type.