public class PageRank<K> extends Object implements GraphAlgorithm<K,Double,Double,DataSet<Vertex<K,Double>>>
The implementation assumes that each page has at least one incoming and one outgoing link.
Modifier and Type | Class and Description |
---|---|
static class |
PageRank.RankMessenger<K>
Distributes the rank of a vertex among all target vertices according to the transition
probability, which is associated with an edge as the edge value.
|
static class |
PageRank.VertexRankUpdater<K>
Function that updates the rank of a vertex by summing up the partial ranks from all incoming
messages and then applying the dampening formula.
|
Constructor and Description |
---|
PageRank(double beta,
int maxIterations)
Creates an instance of the PageRank algorithm.
|
public PageRank(double beta, int maxIterations)
The implementation assumes that each page has at least one incoming and one outgoing link.
beta
- the damping factormaxIterations
- the maximum number of iterationsCopyright © 2014–2021 The Apache Software Foundation. All rights reserved.