【摘要】 用ｄｉｊｓｔｒａ算法．可求出单源单汇点最短路径．时间复杂性是Ｏ（ｎ￣２）。本文提出了一种求最短路径的算法．时间复杂性是Ｏ（ｎ＋ｅ）。两种算法的空间复杂性基本相同。更多还原

【Abstract】 The shortest Path between nodes can be solved by dijstra’s algorithm, in which the time complexity is O(n2). In this paper,a new algorithm about this problem is presented .and it is proved that the time complexity of the new algorithm is O(n+e). The space complexities of the two algorithms are mainly equal.更多还原