无向双环网络G(N;±1,±s)的仿真研究  

Graph Simulation Algorithm for Bidirectional Double-loop Networks G(N;±1,±s)

作　　者：刘辉[1] 彭慧子[1] 吴爱清[1] 方木云[1] 

机构地区：[1]安徽工业大学计算机学院,马鞍山243002

出　　处：《系统仿真学报》2012年第4期789-792,共4页Journal of System Simulation

基　　金：安徽省教育厅重大项目(ZD2008005-1);安徽工业大学青年教师科研资助项目(QZ201114)

摘　　要：将直角坐标系引入无向双环网络的研究,提出一种图形仿真算法,可在直角坐标系快速仿真出无向双环网络G(N;1,s)的MDD图,不仅标注节点分布,同时将网络直径和平均距离输出到图形上。通过仿真图形,研究单位步长无向双环网络G(N;1,s)直径和平均距离的分布规律。A fast simulation algorithm was proposed based on Cartesian coordinates which was used in the research of the Bidirectional Double-loop Networks.Using this fast algorithm,the Minimum Distance Diagram of the Bidirectional Double-loop Networks for any given N,s could be simulated and the diameter,the Average Distance,including each node were signed on the graph.The result of simulation indicates that the characteristic of distribution of diameter and the Average Distance of the Bidirectional Double-loop Networks is clear.

关 键 词：直角坐标系 无向双环网络G(N 1 s) 仿真 直径 平均距离 

分 类 号：O157.9[理学—数学] TP302[理学—基础数学]