|
计算机应用研究 2009
Improved heuristic algorithm for generating P-cycles
|
Abstract:
Since the existing heuristic algorithm named Grow did not consider that expansion on a cycle-link might restrict expansion on another one,therefore some P-cycles with high AE might be lost.For this reason,this paper improved Grow algorithm.Among all the on-cycle spans,the improved algorithm first chose the one which could get the P-cycle with the highest AE after expansion,so AE of P-cycle would be increased as high as possible,and average number of hops was more or less the same with Grow's.Finally,the sim...