实现了图类的定义，并且实现了深度遍历，广度遍历，以及用dijstra算法求最短路径-Achieve the plan class definition, and the realization of the depth traversal, breadth traversal, and the shortest path algorithm with dijstra

解决图论中最短路问题的最好方法--“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 g