The Comparison of Three Algorithms in Shortest Path Issue

Abstract

The shortest path problem is one of the most classical algorithm issues in graph theory, aiming to find the shortest path between the two nodes in a network. It is widely used to solving the path search problems in the relevant application, including network routing algorithm, artificial intelligence, game design, and so on. This paper introduces three basic algorithms and compares them theoretically by analyzing the time and space complexity. Then, the paper discusses their performances and summarizes the best application range. At last it introduces applications of shortest path algorithm.