In this paper, we give an O(NlogN) algorithm to establish a spanning tree rooted at any node of height at most n + ⌈log2|F|⌉ + 3 in Xn − F, where F is a restricted node set with |F| ≤ 2n − 3 and N = 2n denotes the node number of Xn. We also give and analyze the simulation results to apply the reliable unicast and broadcast algorithms in the literature and this paper to some existing bijective connection networks such as CQn, TQn, 0-MQn, and 1-MQn and general bijective connection networks Xn. The simulation results make us conjecture that there would be some special bijective connection networks whose diameters are smaller than the smallest diameter ⌈n+1 over 2⌉ of CQn, TQn, 0-MQn, and 1-MQn.
展开▼
机译：在本文中，我们给出一个O（NlogN）算法，以在X n < / inf> − F，其中F是用| F |设置的受限节点≤2n-3且N = 2 n 表示X n 的节点数。我们还给出并分析了仿真结果，以将文献和本文中可靠的单播和广播算法应用于一些现有的双射连接网络，例如CQ n ，TQ n ， 0-MQ n 和1-MQ n 以及一般双射连接网络X n 。仿真结果使我们推测，将存在一些特殊的双射连接网络，它们的直径小于CQ n ，TQ n 的2⌉的最小直径⌈n+ 1 ，0-MQ n 和1-MQ n 。
展开▼
