apache/spark — pull request #2738 by planvin (2014-10-09 22:14:45+00:00)
Title: fixed dynamic pagerank vertex update computation

There seems to be a typo here when comparing to static version or to the usual pagerank algorithm. if we take a node in the graph, on each iteration, we add a random jump to any node in the graph with equal probability of resetProb/N. Then summing for all nodes in the graph yields the resetProb on line 155, which has nothing to do with the pagerank value for last iteration.