最短路问题的Floyd算法与MATLAB程序实现  

Floyd Algorithm and MATLAB Program Realization of Shortest Path Problem

作　　者：毛圆洁[1] 

机构地区：[1]无锡科技职业学院外语与公共教育学院,江苏无锡214028

出　　处：《河北北方学院学报（自然科学版）》2013年第5期13-14,18,共3页Journal of Hebei North University:Natural Science Edition

摘　　要：运用Floyd算法解决了Dijkstra算法无法解决的弧权为任意实数的网络最短路问题,并且给出了Floyd算法的最短路长与最短路径的MATLAB程序,此程序具有通用性。Floyd algorithm was used to solve the shortest path problem with an arbitrary real number as weight,which Dijkstra algorithm could not.And the geneal MATLAB program of the shortest path and the shortest length for Floyd algorithm was put forward.

关 键 词：最短路问题 DIJKSTRA算法 FLOYD算法 MATLAB 

分 类 号：O157.5[理学—数学]