应用科学学报 ›› 1994, Vol. 12 ›› Issue (4): 320-324.

• 论文 • 上一篇    下一篇

超立方体多阶网的链接路径算法

龙伟   

  1. 成都科技大学
  • 收稿日期:1992-11-22 修回日期:1993-05-16 出版日期:1994-12-31 发布日期:1994-12-31

AN ALGORITHM OF LINK PATH FOR SUPER-CUBE MULTISTAGE NETWORK

LONG WEI   

  1. Chendu University of Science and Technology
  • Received:1992-11-22 Revised:1993-05-16 Online:1994-12-31 Published:1994-12-31

摘要: 该文将一个超立方体网络定义为一个k阶×r层的网阵,并对相应的术语进行了科学的定义,该文着重从动态路径连接的角度,给出了超立方体网阵的网结值、网层值和链接语句的算法。利用该算法可完全确定其超立方网结点动态连接的路径。文章还给出了一个路径算法的实例。

关键词: 动态路径, 算法, 立方网

Abstract: In this paper,the super-cube network is defined as a net-array with k stages and r layers, and the relevant terms are scientifically defined. From the point of view of linking the dynamic paths,the algorithms about the net-node value, the net-layer value and the linking statements are studied. By using these algorithms,we can completely determine the dynamic linkage paths about a super-cube network.At the end of the paper,we give an example about the algorithms.

Key words: dynamic path, algorithm, cube network