An Algorithm to Simulate the L-Shaped Tile of Double-loop Networks G(N;1,s)
QU Yu-gui · Acta Simulata Systematica Sinica · 2005
An Algorithm to simulate the L-Shaped Tile of Double-loop Networks G(N;1,s) is presented, and is executed with VB6.0 serving as programming language and SQL Server2000 serving as Database. The L-Shaped Tile and parameter of such family of Double-loop Networks whose N is given random and s varied from 2 to N-1 can be simulated and calculated respectively. The L-Shaped Tile of such family of Double-loop Networks has such characters (from rectangle to L-Shaped Tile) and the diameter of such family of Double-loop Networks has such characters (maximum values, minimum values, and symmetry). For any given N, many s make G(N;1,s) tight optimal.