Improved traversers

Added abstract class QueueBasedTraverser holds general logic for most
traversers.
Fixed errors in InfoKeepers.
Added InfoKeeper that uses IntToBoolean fastutil map to store Boolean
values.
Changed BreadthFirstTraverser so that first node is the node we start
traverse from (to be consistent with other traversals).
I am not sure -- couldn't find the source code online... It is okay to leave it as it is.

On Aug 4, 2014, at 11:22 AM, Szymon <notifications@github.com> wrote:

> In cassovary-core/src/main/scala/com/twitter/cassovary/graph/tourist/IntInfoKeeper.scala:
> 
> >  
> > -  /**
> > -   * Record information {@code info} of node {@code id}.
> > -   */
> > -  def recordInfo(id: Int, info: Int) {
> > -    if (!(onlyOnce && infoPerNode.containsKey(id))) {
> > -      infoPerNode.put(id, info)
> > -    }
> > -  }
> > +  override protected def infoPerNode: mutable.Map[Int, Int] = underlyingMap.asInstanceOf[util.Map[Int, Int]]
> Yes, but I expect add to be two times faster than get/put combination, right?
> 
> Will change to addTo.
> 
> —
> Reply to this email directly or view it on GitHub.
>