Hi Daniel, pgrouting is very interesting and incredibly fast. First i wanted to use pgrouting because of it's performance, but i found no possibility to use dynamic metrics for each routing edge. So i implemented an own edge-based A-Star in Java. I have to say that i never found any official documentation of Shooting-Star, so perhaps it's better to change Shooting-Star in edge-based A-Star on the website to prevent missunderstandings.
Am 27.05.2010 um 15:54 schrieb Daniel Kastl: > Hi Stefan, > > Thank you for sharing this link! Very Interesting! > I read that you're using "Shooting-Star" as shortest path algorithm. Did you > write your own implementation or do you use pgRouting for that? ... or does > Traveling Salesman support this algorithm as well? > > Best regards, > Daniel
_______________________________________________ Routing mailing list [email protected] http://lists.openstreetmap.org/listinfo/routing
