用Dijkstra算法计算拓扑网络中任意两点间的距离以及最短路径的条数；-Dijkstra' s algorithm to calculate the distance between any two points in the topology of the network, as well as the number of the shortest path