Graph Simulation Algorithm for Bidirectional Double-loop Networks G(N;±r,±s)
Tingting Hang · Jisuanji gongcheng · 2011
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.