下面是图的最短路径求法（存储方式：矩阵）最短路径dijkstra：const n=5;var p:array[0..n,0..n] of integer; dis:array[0..n] of integer; find:array[1..n] of boolean;{记录到达改点的最短路径是否找到} way:array[1..n] of string; min0:integer; len:integer; i,j:integer;function min:integer;{求出最短路线的下标} vari:integer;ans:integer; beginan...
