Struct PageRank 

pub struct PageRank;

PageRank algorithm implementation.

PageRank assigns importance scores to nodes based on the link structure of the graph. Nodes with many incoming links from important nodes will have higher scores.

Implementations

impl PageRank

pub fn compute<T: Transaction>( tx: &T, config: &PageRankConfig, ) -> GraphResult<PageRankResult>

Compute PageRank scores for all nodes in the graph.

Arguments

• tx - The transaction to use for graph access
• config - Configuration parameters for the algorithm

Returns

A PageRankResult containing scores for all nodes.

Algorithm

Uses the iterative power method:

1. Initialize all nodes with score 1/N
2. Iteratively update scores based on incoming links
3. Handle dangling nodes (nodes with no outgoing edges)
4. Check for convergence after each iteration

pub fn compute_for_nodes<T: Transaction>( tx: &T, nodes: &[EntityId], config: &PageRankConfig, ) -> GraphResult<PageRankResult>

Compute PageRank for a subset of nodes.

This is useful for computing PageRank on a subgraph defined by a specific set of nodes.

Arguments

• tx - The transaction to use for graph access
• nodes - The nodes to include in the computation
• config - Configuration parameters for the algorithm