# Difference between revisions of "PageRank algorithm"

Jump to navigation
Jump to search

(Created page with "PageRank is an algorithm that measures the transitive influence or connectivity of nodes. It can be computed by either iteratively distributing one node’s rank (originally...") |
|||

Line 7: | Line 7: | ||

[[Category: PageRank]] | [[Category: PageRank]] | ||

+ | [[Category: Algorithms]] | ||

[[Category: Graph Algorithms]] | [[Category: Graph Algorithms]] | ||

[[Category: Graph]] | [[Category: Graph]] |

## Latest revision as of 20:12, 29 April 2019

PageRank is an algorithm that measures the transitive influence or connectivity of nodes.

It can be computed by either iteratively distributing one node’s rank (originally based on degree) over its neighbours or by randomly traversing the graph and counting the frequency of hitting each node during these walks.