tulunzuiduanlumatlabcode

  解决图论中最短路问题的最好方法--“Dijstra算法,”通过解析实例模型,对模型算法进行描述、拓展,并给出了求最短路以及求最短路长的MATLAB程序,此程序具有通用性。(The best way to solve the shortest path problem in graph theory is- "Dijstra algorithm," by parsing instance model, the model describes the algorithm, expand, and gives the shortest and seek seek the shortest length of the MATLAB program, this program has versatility.)