The applicntion of breadth-first algorithm in the twisted cube
Kuang Gui-juan · Journal of Shandong Institute of Light Industry · 2005
In this paper, the breadth-first search algorithm on the interconnection network is given and applied to the twisted cube. A breadth-first spanning tree is the shortest one among all the spanning 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 interconnection networks. Our method can be taken as a new way to solve such problems.