任意两个城市之间的最短路径。可以输入城市信息、构建城市网络、算出三种最小代价。-Any shortest path between two cities. You can enter a city information, build the city network, calculate the three kinds of minimum cost.