图论中最短路问题的MATLAB程序实现

MATLAB Program of the Shortest Path Problem of Graph Theory

解决图论中最短路问题的最好方法--“Dijstra算法,”通过解析实例模型,对模型算法进行描述、拓展,并给出了求最短路以及求最短路长的MATLAB程序,此程序具有通用性。

This article puts forward the shortest path problem of Graph Theory, and sets forth the optimal algorithm——Dijkstra algorithm and its theory. Furthermore it describes and develops the model＇s algorithm. Finally the article presents the MATLAB program of the shortest path problem.