浅议求解最短路径问题的两种算法

摘要

This paper has compared two algorithm using to solve the shortest path problem: Dijkstra algorithm and Floyd algorithm in designing philosophy, solving process and application instance. Also give discussion on their features and applications.%本文通过对比求解最短路径问题的Dijkstra算法和Floyd算法的设计思想、求解过程和应用实例，讨论了两种算法的特点及适用领域。