Struct StreamingPageRank

pub struct StreamingPageRank { /* private fields */ }

Streaming PageRank algorithm that updates incrementally

Implementations

impl StreamingPageRank

pub fn new(damping_factor: f64, max_iterations: usize, tolerance: f64) -> Self

pub fn default() -> Self

Default parameters for streaming PageRank

pub fn top_nodes(&self, k: usize) -> Vec<(String, f64)>

Get top-k nodes by PageRank score

pub fn node_score(&self, node_id: &str) -> Option<f64>

Get score for a specific node

Trait Implementations

impl Clone for StreamingPageRank

fn clone(&self) -> StreamingPageRank

Returns a duplicate of the value.

const fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for StreamingPageRank

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl StreamingAlgorithm<HashMap<String, f64>> for StreamingPageRank

fn initialize(&mut self, processor: &IncrementalGraphProcessor) -> Result<()>

Initialize the algorithm with the current graph state

fn update( &mut self, processor: &IncrementalGraphProcessor, changes: &UpdateResult, ) -> Result<()>

Update the algorithm state based on graph changes

fn get_result(&self) -> &HashMap<String, f64>

Get the current result/state of the algorithm

fn recompute(&mut self, processor: &IncrementalGraphProcessor) -> Result<()>

Force a full recomputation (fallback when incremental update is not sufficient)

fn needs_recomputation(&self, changes: &UpdateResult) -> bool

Check if the algorithm needs full recomputation