OSM XML file and Dijkstra Algorithm

1.00/5 (1 vote)

See more:

I use OpenStreetMaps data and I parse the OSM xml file. I found all the nodes that are k="highway" and k="addr:street" in order to find the nodes that are in a way. Now I have to find the path from the origin to destination point. I decided to use Dijkstra algorithm to achieve this. But, I dont know from where I can start. I have to create a graph of these nodes? But how? Can you please advice me ?

Regards,
PanagiotisP

Posted 7-Jul-14 1:37am

PanagiotisP

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Last 24hrs

This month

CPallini	120
k5054	120
OriginalGriff	110
Graeme_Grant	65
Richard MacCutchan	60

Pete O'Hanlon	2,065
OriginalGriff	1,605
Graeme_Grant	1,085
Richard Deeming	893
Dave Kreskowiak	779