[GraphHopper] Calculating fastest path with A*/Dijkstra with CH disabled

[Peter K]

> thank you!
>
> Also, two more questions: 
>
> 1) How can I get street node/edge id(s) with LocationIndex by street's
> name? Could you provide a simple example? I was searching for
> something like .getByName but could not find it.

This is called geocoding and not provided by GraphHopper. Although we
have some (closed source) prototype we still recommend other existing
solutions.

> 2) Is there a way to run routing algorithms inside a "zone"/subgraph? 
> Let's say our map is like showed in zone.png 
> We want to get from point A to point B but the algorithms should only
> go through nodes that are inside that blueish rectangle.
> Is there a way to apply such zone by putting some kind of distance
> restriction? Or creating a subgraph?

You have several possibilities:
 * limit the search to only nodes in this area (this is only possible if
no CH is used)
 * import only the subnetwork

Where the last option probably would be the simplest one as there is
already a (hidden) method for it in OSMReader called isInBounds or just
use OSM tools like osmosis:
http://wiki.openstreetmap.org/wiki/Osmosis#Extracting_bounding_boxes

Or do you need to define it per request? What is your usecase?

Kind Regards,
Peter.