+ implement transit node routing
	+ compute the set of transit nodes using CH
	+ compute the access nodes of a node
	+ compute the maximum radius for a node
	+ traverse the pp for computing access nodes
	+ keep a checkmark set where we store each node already visited in
traversal
	+ first check if node in checkmark set, if contained ignore node;
already computed the access node for this node
	+ compute the distances and shortest paths between the access nodes of
a node and store them
	+ compute the distances and shortest paths between the transit nodes
and store them
	+ construct the pp hashmap for CH with bidirectional search
	+ make query algorithm
	+ make unit test for computing transit nodes
	+ make unit test for computing access nodes
	+ make unit test for computing maximum radius
	+ make unit test for far away
	+ make unit test for computing one-to-all distance
	+ in the precomputations calculate the access nodes and distances
between them
	+ don't do the calculations of access node on the fly
	+ make unit test for query algorithm:
		+ when node is far away
		+ when node is not far away
		+ when node is transit node