开车从起始点Ａ到目的地Ｂ的路线有多条。给你一张描述待选路线的表（n*n的矩阵A），让你找出行车距离最短的路线。表中表示了任意两个路口的连通情况，以及距离。矩阵元素a(i,j)=0表示路口i,j不连通，a(i,j)!=0表示路口i,j的行车距离。其中起始点Ａ在路口1，目的地Ｂ在路口n 。完成源程序DIST.CPP中Dijkstra函数的编写。-A drive to the destination from a starting point a number of B' s line. Give you a descr iption of the table to be selected routes (n* n matrix A), allows you to find the shortest travel distance routes. Table represents the connectivity of any two junctions, as well as distance. Matrix elements a (i, j) = 0 that junction i, j are not connected, a (i, j)! = 0 that junction i, j of the driving distance. A 1 at the junction where the starting point, destination B at the intersection n. Complete source DIST.CPP function in the preparation of Dijkstra.