针对城市交通网导航的实际需要,提出了有向加权图的模型,图中顶点不仅包括路口,还包括起点和终点,并对Dijkstra算法进行改进,提出了一种基于转向限制的城市交通网最短路径算法,通过加入虚拟顶点,从而适应转向限制的条件。实验表明了该算法的正确性。
A model of weighted digraph is proposed to satisfy actual navigation requirement of urban traffic network.Vertices in digraph not only include crossing,but also include start point and end point.A shortest path algorithm of urban traffic network based on turning restriction is proposed.The algorithm is improved on Dijkstra algorithm.The condition of turning restriction is adapted by adding virtual vertices.Experiment shows the algorithm is right.