摘要
本文给出互连网络上的广度优先搜索算法,并将其应用到螺旋立方体上。给出了n维螺旋立方体TQn的直径的另外一种证明方法;该算法可能用来求解单源节点最短路径问题。为讨论新的互连网络拓扑结构的直径和故障直径问题提供一条新的思路。
In this paper, the breadth - first search algorithm on the interconnection network is given and applied to the twisted cube. A breadth - first sparming tree is the shortest one among all the sparming trees which have the same node as their boot node. Using this property we give the diameter of n - dimensions twisted cube. Furthermore, we get the shortest path from the given node to all the other nodes in intereonnection networks. Our method can be taken as a new way to solve such problems.
