Weighted PageRank
The only difference between weighted PageRank and standard PageRank is that edges have weights, and the influence that a vertex receives from an in-neighbor is multiplied by the weight of the in-edge.
Specifications
Characteristic | Value |
Result | Computes a weighted PageRank value (FLOAT type) for each vertex. |
Input Parameters | <b></b>
|
Result Size | V = number of vertices |
Time Complexity | O(E*k), E = number of edges, k = number of iterations. The number of iterations is data-dependent, but the user can set a maximum. Parallel processing reduces the time needed for computation. |
Graph Types | Directed edges |
Last updated