摘要
本文提出了求解具有非负权的任意两点最短路的E·W·Dijkstra—R·W·Floyd的算法,该方法易于在计算机上实现。
A E·W·Dijkstra—R·W·Floyd algorithm for solving shortest path problem between the two points with non-negative weights is put forward, which is easy to implement on a computer.
关键词
最短路
最优化算法
图论
图论
应用
graph theory
shortest path
optimization algorithm
labeling algorithm
