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

[mythex3cutioner .]

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

Isn't there a way then to somehow manually find which node/edge ID is
associated with street name by reading routing data provided from
graphopper.sh script? I only need to figure out 5-10 street's names
associated with their edge/node ids so that I could manipulate them via
hardcoding. I mean, yes, it's that unpractical and basic but that's my goal
here :)

 >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?

Yes, my usecase would be to define per request:
-First request calculates the fastest path
-Point A is moving inside the map (GPS tracking on)
-Timer should recalculate path each 30s or so

So, basically, importing the subnetwork falls out.
And as I understand, OSMReader only works once - when the graph is created?
This could be a rough solution but I'm pretty sure it would be an overload
for such a simple operation.

Thank you,



On Fri, Jan 10, 2014 at 10:46 PM, Peter K <peathal at yahoo.de> wrote:

>
> > 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.
>
>
> _______________________________________________
> GraphHopper mailing list
> GraphHopper at openstreetmap.org
> https://lists.openstreetmap.org/listinfo/graphhopper
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.openstreetmap.org/pipermail/graphhopper/attachments/20140110/ecad4748/attachment.html>