说明：  基于Dijsktra算法的最短路径求解 实验目的： 1.掌握图的邻接矩阵表示法，掌握采用邻接矩阵表示法创建图的算法 2.掌握求解最短路径的Dijsktra算法
(Shortest path solution based on dijsktra algorithm The aim of the experiment was to observe the effect of the treatment on the quality of the patients 1. Master the adjacency matrix representation of graph and the algorithm of creating graph with adjacency matrix representation 2. Master dijsktra algorithm to solve the shortest path)