The Breadth-First Search Algorithm on the Crossed Cube
Kuang Gui-juan, Xin Liu · Journal of Qingdao University · 2004
the Breadth-First Search algorithm on the interconnection network is given and applied to the crossed cube, then the breadth-first spanning tree is gotten. A breadth-first spanning tree is the shortest one among all the spanning trees having the same node as their boot node. Using this property, we prove that the diameter of n-dimensions crossed cube is [(n+1)/2] the same as that calculated by another algorithm. Further more, we get the shortest path from the given node to all the other nodes in interconnection networks.