最短路dijkstra算法Matlab程序.doc

word文档 可自由复制编辑 function [c0,c,path0,path]=dijkstra(s,t,C,flag) % Use the Dijkstras algorithm to find the shortest path from % s to t and can also find the shortest path between s and all % the other points. % Reference: Graph Theory with Applications by J. A. Bondy and % U. S. R. Murty. % Inpu