A new algorithm called the rapid spanning-tree algorithm was developed to reduce the time for a network to compute a loop free logical topology.

• 一个新的演算法叫做快速扩充树演算法，是开发用来减少网路上，计算一个没有迴圈的逻辑拓扑所需的时间。