OSM XML文件和Dijkstra算法 [英] OSM XML file and Dijkstra Algorithm

问题描述

我使用OpenStreetMaps数据并解析OSM xml文件。我找到了k =highway和k =addr：street的所有节点，以便找到某种方式的节点。现在我必须找到从起点到目的地的路径。我决定使用Dijkstra算法来实现这一目标。但是，我不知道从哪里开始。我必须创建这些节点的图形？但是怎么样？你能建议我吗？



问候，

PanagiotisP

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

推荐答案

这篇关于OSM XML文件和Dijkstra算法的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！