@graphty/algorithms / index / pageRank
Function: pageRank() ​
pageRank(
graph,options):PageRankResult
Defined in: algorithms/centrality/pagerank.ts:83
Calculate PageRank for all nodes in the graph
Uses delta-based optimization by default for improved performance on larger graphs. Automatically falls back to standard algorithm for very small graphs.
The delta-based approach provides significant speedup for:
- Incremental updates after graph modifications
- Graphs with localized changes
- Early convergence detection per vertex
For initial computation on small-medium graphs, standard algorithm may be faster due to lower overhead.
Parameters ​
graph ​
The directed input graph to analyze
options ​
PageRankOptions = {}
Algorithm configuration options
Returns ​
PageRank result containing ranks, iteration count, and convergence status