[GraphHopper] Calculating paths & display routes (Android)

Peter K peathal at yahoo.de
Tue Dec 17 19:49:50 UTC 2013


Hi Ignas,

have a look into the android/ folder. There you see how it work. And you
can set the algorithm in the GHRequest object. If contraction hierarchy
is enabled only bidirectional algorithms will work. The GHResponse
contains all the necessary information like points and instructions.

> Should I first make some kind of subgraph (due to efficiency)?

There are several techniques to make it faster like CH, but you could
also use more heuristical routing algorithms, sorting the graph,
in-memory instead memory mapped etc

Regards,
Peter.

> Hello, 
>
> I've got Graphhopper going on my Android device. 
>
> Now my goal is to select two points on the map, apply one of the
> algorithms (Dijksta, A*, etc) and display results with an overlay. 
>
> Due to lack of documentation & being a little bit in a hurry, could
> somebody point me where/how to start? 
>
> I understand the basics - getting point's coordinates, displaying an
> overlay with results. The part where I'm confused is how to apply
> search algorithms in Graphhopper? 
>
> Should I first make some kind of subgraph (due to efficiency)? 
> How can I get all the points (on streets, i.e.) between those two points?
> Is there something like getStreet(point1, point2) that gives you back
> most likely street between your two points? 
>
> Pardon my naivety, but I'm new to mapping, routing, etc & my BA
> thesis' handing in deadline is coming really fast. ;) any help
> appreciated!
> ----------------------
>
> Ignas Kapoc(ius
>
>
>
> _______________________________________________
> 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/20131217/69886797/attachment.html>


More information about the GraphHopper mailing list