最短路径 之 SPFA算法 作者:fengzee 日期:2008-02-15

SPFA——Shortest Path Faster Algorithm，它可以在O(kE)的时间复杂度内求出源点到其他所有点的最短路径，可以处理负边。SPFA的实现甚至比Dijkstra或者Bellman_Ford还要简单-The shortest path algorithm for the SPFA Author: fengzee Date :2008-02-15 SPFA- Shortest Path Faster Algorithm, it can be O (kE), within the time complexity of the source point to find the shortest path to all other points, and deal with negative edge. SPFA implementation of Dijkstra, or Bellman_Ford than even a simple ... ...