说明：  最大邻接点存储的单元最短路径算法,在一个网络中,各结点的邻接接点的最大值称为该网络的最大邻接结点数,取网络的最大邻接结点数
(A cell shortest path algorithm in which the maximum number of adjacent nodes of each node is called the maximum number of adjacent nodes in a network, and the maximum number of adjacent nodes of the network is taken.)