-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1
Nice.:) In the distance-function you can probably remove the math.sqrt(dist2) and use used the squared distance. It would also be faster if you had a sortedQueue sorted by a metric like "minimum coordinate-difference to target". Thus us would prefer ways that lead in the right, general direction. Marcus OJW schrieb: > While reading the wikipedia article on A* routing, I took some notes (in > python of course...) > > The result is this little application: > > http://almien.co.uk/OSM/Routing/ > > which reads OSM files and tells you how to cycle around them. It will even > return an OSM file containing your route, to view in JOSM, or render with > something. -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.6 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iD8DBQFHLKWnf1hPnk3Z0cQRAo7GAKDev0Xq8F+PvhE7PeFdBAPaJCIxXwCfURua FBSPjr9egHwNjIJaS4KKW14= =+m2a -----END PGP SIGNATURE----- _______________________________________________ Routing mailing list [email protected] http://lists.openstreetmap.org/cgi-bin/mailman/listinfo/routing
