摘要
传统的L形瓦仿真方法无法直接用于研究无向双环网络。针对上述问题,将直角坐标系引入无向双环网络中,提出一种新的图形仿真算法。利用该算法可以快速仿真出无向双环网络G(N;±r,±s)的图形,同时标注其直径、平均距离及节点的具体分布。通过研究仿真图形,得出单位步长无向双环网络G(N;±r,±s)直径、平均距离的分布规律。
Traditional L-shaped tile simulation method is usually used to researching unidirectional double-loop networks,and can not be used in the bidirectional double-loop networks directly.In order to solve the problem,this paper presents a fast simulation algorithm based on cartesian coordinates,which is used in the research of the bidirectional double-loop networks.By using the algorithm,the graph of the bidirectional double-loop networks G（N;±r,±s） for any given N,s can be simulated,and the diameter,the average distance,including each node are signed on the graph.Simulation result indicates that the characteristic of distribution of diameter and the average distance is clear.
出处
《计算机工程》
CAS
CSCD
北大核心
2011年第6期272-273,276,共3页
Computer Engineering
基金
安徽省教育厅基金资助重大项目(ZD2008005-1)
关键词
无向双环网络G(N
±r
±s)
直角坐标系
图形仿真算法
直径
平均距离
bidirectional double-loop networks G（N
±r
±s）
cartesian coordinates
graph simulation algorithm
diameter
average distance
