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).
shouldn't we also not enqueue all the neighbors if the sum total of neighbors will exceed maxSteps ? (i.e., just like we have this code in BFS)