【摘要】 利用最小生成树对非单位步长的双环网络G(N;r,s)进行研究,并借助C#编程语言提出仿真算法。对任意给定的N,1≤r≠s<N,可以得出所有紧优的双环网络G(N;r,s)。仿真结果证明对于双环网络G(N;r,s),在r=1时,双环网络的直径d(N;1,s)以s的中心对称分布;在r≠1的情况下,有许多r,s可以使G(N;r,s)达到紧优;双环网络的最小生成树不包含三层以上的满二叉树。更多还原

【Abstract】 Using minimum cost spanning tree to research non-step double-loop networks G(N;r,s),and a simulation algorithm is presented which make use of C sharp as programming language.All tight optimal double-loop networks G(N;r,s) can be calculated for N is given random and 1≤r≠s<N.The result of simulation prove that for double-loop networks G(N;r,s),the diameter d(N;1,s) distribute by the centrality of parameter s in the case of r=1 and many parameters r,s make G(N;r,s) tight optimal in the case of parameter r≠1;the minimum cost spanning tree of double-loop networks don’t contain full binary tree which beyond three level.更多还原