Yes. What I meant is do we have a guarantee that all ids from 1 to
MaxNodeId are used?


On 8 April 2014 20:44, Pankaj Gupta <notifications@github.com> wrote:

> In
> cassovary-benchmarks/src/main/scala/com/twitter/cassovary/GraphOperationBenchmark.scala:
>
> > +  override def operation(graph : DirectedGraph) {
> > +    PageRank(graph, pageRankParams)
> > +  }
> > +}
> > +
> > +class PersonalizedPageRankBenchmark(val graph : DirectedGraph,
> > +                                    randomWalkParams : RandomWalkParams = RandomWalkParams(20, 0.3))
> > +    extends GraphOperationBenchmark {
> > +  val rng = new Random
> > +
> > +  val graphUtils = new GraphUtils(graph)
> > +
> > +  override def name = "Personalized PageRank"
> > +
> > +  def randomNodeIds() : Seq[Int] = {
> > +    graphUtils.randomWalk(GraphDir.OutDir,
>
> Not sure if reading from a file makes sense. Actually DirectedGraph
> provides an iterator on Nodes. So, perhaps just taking the next node
> provided by this iterator will be fine (be careful to check hasNext) for
> this example instead of a random choice.
>
> --
> Reply to this email directly or view it on GitHub<https://github.com/twitter/cassovary/pull/54/files#r11405100>
> .
>