Major Description
I propose to add convergence detection to the RandomWalkVertex. Convergence is achieved when the overall absolute change (L1 norm) of the difference between the current and the previous probability vector becomes less than a given threshold. Convergence detection can be implemented via an additional aggregator and a check in the master compute function.
This change would make the class much easier to use as the users don't have to worry about the number of supersteps to execute, but can simply specify a high number as MAX_SUPERSTEPS and be sure that the algorithm convergences when acceptable quality of the result is reached.