摘要:最短路径问题是图论的一个经典问题。本论文主要对解决最短路径问题的Dijkstra算法和Floyd算法进行了分析,然后运用这两个算法解决了最短路径问题在城市公交系统、旅游路线选择和矿区的选址方面的应用,为企业和个人提供了方便,因此不仅具有重要的理论意义,而且具有重要的实用价值。6885
关键词:最短路径;Dijkstra算法;Floyd算法
The Application of Shortest Path Matter in Actual Life
Abstract:The shortest path matter is a classical problem of graph theory. In this article , I mainly analyse two algorithms solving the shortest path problem-Dijkstra algorithm and Floyd algorithm, and then use them to explain the application of the shortest path matter in some sectors such as city public transportation system,the choosing of travel route and the address choosing of mining areas, which provides convenience for companies and personals. so it’s not just important in theory sense, but also very valuable in solving practical problems.
Key words:Shortest Path;Dijkstra Algorithm;Floyd Algorithm目 录