1. A method for determining one or more destinations that may be reached using a hierarchy of maps, the hierarchy of maps comprising a plurality of level maps, the method comprising: receiving search parameters indicating a starting point of a trip and an allotted cost to one or more destinations, wherein the allotted cost is in a unit of measure; selecting a starting node that corresponds to the starting point on a first level map; identifying, using a processor, a set of nodes on the first level map wherein each node in the set of nodes has a travel cost from the starting node that is less than the allotted cost; for each node in the set of nodes: calculating a remaining cost for the node in the set of nodes, the remaining cost being a difference between the allotted cost and the travel cost for the node, and wherein the remaining cost is in the same unit of measure as the allotted cost, identifying second level nodes on a second level map wherein each second level node has a travel cost from the node in the set of nodes that is less than the remaining cost, and adding the identified second level nodes in the second level map to the set of nodes; determining whether further levels of maps in the hierarchy of maps are to be searched; searching, if further levels of maps are to be searched, the levels of maps for nodes that may be reached from the starting node given the allotted cost; and determining, based on the set of nodes, a geographic area that may be reached from the starting point given the allotted cost.