A few weeks ago I wrote: > I have been a contributor to OpenStreetMap for a while now and > recently decided to make use of some of the collected data rather than > just adding to it. > > I decided that what would be fun to implement is a routing algorithm > that can find the best (shortest or quickest) route between any two > OSM highway nodes. I know that there are other routing algorithms > available but this started as an intellectual exercise so I developed > my own. It seemed to work so I added a fancy web front end to it and > put it on a server.
> The router itself (requires JavaScript for the map etc): > > http://www.gedanken.org.uk/mapping/router/router.html Now finally after writing some documentation, choosing a license and a name for it - Routino - the router software is available for download. http://www.gedanken.org.uk/software/routino/ I have called it release 1.0 because it works and seems to be quite stable and robust. There are a few other things that I wanted to include (example web page and CGI scripts like in the online version) but I decided to release what I had. A version 1.1 probably isn't far away - but don't let that stop you trying it. It is probably best not to use this mailing list for discussions about the program so e-mail me directly. If there is enough interest I can start a dedicated mailing list. -- Andrew. ---------------------------------------------------------------------- Andrew M. Bishop a...@gedanken.demon.co.uk _______________________________________________ Talk-GB mailing list Talk-GB@openstreetmap.org http://lists.openstreetmap.org/listinfo/talk-gb