最短路径毕业论文.docx

精选文档
精选文档
M A5 IIM VtRSI 1Y Ol 心 U
本科毕业论文（设计）
论文题目: 交通咨询系统的最短路径算法与实现
学生姓名：
0205110138
精选文档
精选文档
业：
lve the p roblem.
With the p ace of moder n life accelerate, as well as the in creas ing nu mber of city car, transpo rtati on n etworks is more deve lop ed, in vehicles and transp ortati on con sta ntly up dated today, people in tourism, travel or other travel time, not only concerned about costs, but also the time required mileage and other issues are also of p articular in terest. To be more convenient for people to travel, we should build a shortest path problem traffic advisory system. Such a transportation system can answer all questions related to transpo rtati on have bee n prop osed, such as the shortest p ath to any one city to other cities, or any shortest p ath betwee n the two cities.
Through the analysis of several com mon shortest path algorithm research and realized that the classical Dijkstra algorithm, Floyd algorithm. We discussed various algorithms ideology, theory, imp leme ntati on, data structures, as well as algorithms described and an alyzed to compare their adva ntages and shortcomings, and the practicality of the compiexity of the specific time and space. For present characteristics of moder n transpo rtati on n etwork, classical shortest p ath algorithm an alysis and research for the road to explore several issues in transpo rtati on n etwork op timizati on pro cess routes that require sp ecial han dli ng, and in theory give the corres ponding reas on able soluti on.
Floyd algorithm
Key words : traffic advisory shortest path Dijkstra algorithm
精选文档
精选文档
最短路径问题一直在计算机科学、交通工程学、地理信息系统、运筹学等学科中是一个研究的 热点，它不仅是资源分配问题解决的基础，更是线路选择问题解决的基础，特别是在地图、车辆调 度以及路由选择方面有着广泛的应用。最短路径问题最直接的应用当数在地理信息领域中，例如:
GIS网络分析、城市规划、电子导航等等。在交通咨询方面，寻找交通网路中两个城市之间最短的
精选文档
精选文档
精选文档
精选文档
行车路线就是最短路径问题的一个典型的例子。
在网络通信领域，信息包传递的路径选择问题也与
精选文档
精选文档
精选文档
精选文档
最短路径息息相关。 例如OPS开放路由选择协议， 每一个OPS路由器都维护一个描述自治系统范围
内到每个目标的最短路径。在图像分割问题中，最