There are three parts in this thesis: In the first part, we give a new kind of representation of network with or without movement prohibitions, and a new shortest-route-tree algorithm is presented.

本论文分三部分：第一部分提出了一般网络（有禁行和无禁行）的一种新的表示法及其相应的广义性最短路树算法，并给出了这种算法的收敛性证明。

youdao

There are three parts in this thesis: In the first part, we give a new kind of representation of network with or without movement prohibitions, and a new shortest-route-tree algorithm is presented.

本论文分三部分：第一部分提出了一般网络（有禁行和无禁行）的一种新的表示法及其相应的广义性最短路树算法，并给出了这种算法的收敛性证明。

youdao