Description: 1, read into the city node data*//* 2, the adjacency matrix initialization: all elements endowed Infinity,*//* the diagonal elements of Fu 0*//* 3, read the data into the inter-city side, conversion for the adjacency matrix of data*//* 4, the path matrix is initialized, if the arc [i] [j] <Infinity， */
/* 则： at[i][j]=i 否则：Path[i][j]=-1 */
/* 5、计算最短路径 */
/* 6、保存最小路径数据
To Search:
File list (Check if you may need any files):
最短路径\cityname.txt
........\citypath.txt
........\003.cpp.txt
最短路径
Download