| 超立方体多阶网的链接路径算法 |
| |
| 引用本文： | 龙伟. 超立方体多阶网的链接路径算法[J]. 应用科学学报, 1994, 12(4): 320-324 |
| |
| 作者姓名： | 龙伟 |
| |
| 作者单位： | 成都科技大学 |
| |
| 摘 要： | 该文将一个超立方体网络定义为一个k阶×r层的网阵,并对相应的术语进行了科学的定义,该文着重从动态路径连接的角度,给出了超立方体网阵的网结值、网层值和链接语句的算法。利用该算法可完全确定其超立方网结点动态连接的路径。文章还给出了一个路径算法的实例。
|
| 关 键 词： | 动态路径 算法 立方网 |
| 收稿时间： | 1992-11-22 |
| 修稿时间： | 1993-05-16 |
AN ALGORITHM OF LINK PATH FOR SUPER-CUBE MULTISTAGE NETWORK |
| |
| LONG WEI. AN ALGORITHM OF LINK PATH FOR SUPER-CUBE MULTISTAGE NETWORK[J]. Journal of Applied Sciences, 1994, 12(4): 320-324 |
| |
| Authors: | LONG WEI |
| |
| Affiliation: | Chendu University of Science and Technology |
| |
| Abstract: | In this paper,the super-cube network is defined as a net-array with K stagesand 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-cubenetwork.At the end of the paper,we give an example about the algorithms. |
| |
| Keywords: | cube network dynamic path algorithm. |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《应用科学学报》浏览原始摘要信息 |
|
点击此处可从《应用科学学报》下载全文 |
|
