Graph Simulation Algorithm for Bidirectional Double-loop Networks G(N;±1,±s)
Fang Mu-yun · Jisuanji fangzhen · 2012
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.