There are tons of tools. I´ll make some advertisement for mine https://github.com/Tristramg/osm4routing/
It´s rather basic, but it seems it´s what you want : having node and edges having the distance between two nodes. Its weakness is for that larger areas (like Germany) it starts to be very memory consuming. On Mon, Jul 25, 2011 at 12:09 PM, Craig Timothy Herndon (cthrndon) <[email protected]> wrote: > Hello, > > I've been trying to find something that will parse the osm data so > that I can treat intersections as nodes on a graph and the distance from > nodes as a weight. > I took Jorge's advice and ran into this(link at bottom) by Gary86. After > struggling to get perl working on my laptop I've now run into an issue that > should be simple to solve. > In his code there are two lines that reference files that I don't currently > have. These two lines are "use OSM::osm 4.0 ;" and > "use OSM::osmgraph 2.0" ; Where can I download osm 4.0 and osmgraph 2.0? > > > Here is the link to the file I'm trying to use. > http://svn.openstreetmap.org/applications/utils/gary68/distancemap.pl > > P.S. Am I taking the right approach or would you suggest I use something else? > > > Thanks for all the help, > > Craig. > _______________________________________________ > Routing mailing list > [email protected] > http://lists.openstreetmap.org/listinfo/routing > _______________________________________________ Routing mailing list [email protected] http://lists.openstreetmap.org/listinfo/routing
