|
In an experiment with Prolog I would like to use the data provided from OSM to calculate, for example, the shortest path to traverse a collection of points of interest. I have an idea how to do that using Prolog, and even how to access my Prolog program from a Java servlet (that should render the page with the map among other things). However, since I am new to OSM I still do not know how to let the users select a certain amount of nodes from a map, and how to answer (I mean, how to draw in the map) the shortest path to traverse them (given a user selected starting node). Could someone give me a hint about how I can ask many points of interest in the map from a user and draw a path as an answer ? |
|
maybe a look at the OSM wiki about Routing can be helpful ... see all sub pages there, too. There are some opensource routing programs which you could examine. |
