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).
in particular this seems to be called the 'discovery time' of nodes in BFS/DFS, e.g., see
http://homepages.ius.edu/rwisman/C455/html/notes/Chapter22/DFS.htm
http://courses.csail.mit.edu/6.006/fall10/handouts/quiz2review.pdf