交通规划课程设计论文.docVIP

利用Dijkstra算法与Floyd算法进行交通分配 比较分配结果 摘要：本文主要内容包括对乌鲁木齐市五区的人民进行OD调查，得到网络交通量数据，再利用Dijkstra算法与Floyd算法确定交通网络图的最短路径，运用全有全无的方法进行交通量的分配，最后比较这两种方法在确定最短路径时的利弊。 关键词： Using the algorithm of Dijkstra and Floyd to distribute the volume of traffic and compare the result of the traffic assignment Abstract: The article takes the main point to use the algorithm of Dijkstra and Floyd to decide the shortest way of traffic network , making use of the method of All-or-none to distribute the volume of traffic. At last,comparing the advantages and disadvantages between the two methods during deciding the shortest way