Developed by Larry Page and Sergey Brin in the 90's, PageRank is an algorithm to rank pages on a network according to its importance relative to the others. Even tough today Google uses a different approach, their initial solution proved to be simple and effective, making it widely known in the field of Computer Science.
~$ makeGiven a list of pages with its respective links, determine the rank of the pages on the given network. A given page p is said to influence page q if there is a direct link from q -> p. For instance:
| page | rank |
|---|---|
| 0 | 4 |
| 1 | 2 |
| 2 | 1 |
| 3 | 3 |
| 4 | 5 |
- P set of pages
- |P| = n
- i,j ranges from [0, n-1]
- p[i] is the ith page on P
- initially pageRank(p[i]) = 1/n
- damping factor d is set to 0.85
- In(p[i]) every page with a link to i
- Out(p[i]) every page that i connects to
- convergence is the stopping criteria
- in case of ties, output the smallest node label first
