[GraphHopper] Calculating paths & display routes (Android)

Peter K peathal at yahoo.de
Tue Dec 17 21:33:03 UTC 2013


without a log file or more info of how your code looks like we probably
won't be able to help you :)

Regards,
Peter.

> I'll look into that, thank you! 
>
> What about extracting routing data for a specific city? 
> I've tried using bbike http://download.bbbike.org/osm/ , extracted
> this:
>  http://download.bbbike.org/osm/extract/planet_25.1591,54.6528_25.3957,54.752.osm.pbf (Vilnius
> city, Lithuania) and executed ./graphopper.sh import
> vilnius-city-latest.osm.pmf
>
> Then I've downloaded Lithuania map from
> here http://download.mapsforge.org/maps/europe/ , created folder
> vilnius-city-latest-gh and pasted it into Android file system. 
>
> When I run app it displays a map but when I try calculate distance
> between two points (with your methods) app crashes. 
>
> Then i've tested it with australia map and it's routing data and it
> works. So I'm guessing I have some problems with routing data that
> I've got from bbbike and I've no idea how else to extract correct
> routing data. 
>
>   
>
> ----------------------
>
> Ignas Kapoc(ius
>
>
>
> 2013/12/17 Peter K <peathal at yahoo.de <mailto:peathal at yahoo.de>>
>
>     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
>>
>>

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.openstreetmap.org/pipermail/graphhopper/attachments/20131217/da39a0e8/attachment.html>


More information about the GraphHopper mailing list