Redundant links that are not part of the shortest path tree are blocked.
不是最短路径的备援连结将被阻隔。
A topology maintenance algorithm based on the shortest path tree is proposed.
提出了基于最短路径树的拓扑维护算法。
It is suitable to calculate the shortest path tree which has large destination nodes.
它因而适合计算目的结点数较多的最短路径树。
应用推荐