冗余拓扑图简易遍历算法的研究与应用

he traversing algorithm for the simple graph has been researched for many years and lots of mature algorithms are developed. But there is few efficient algorithm for redundant topology which is valuable because of its practical application. This paper presents a novel traversing algorithm for redundant topology. This algorithm is derived from the traversing algorithm for simple graph, and transforms the redundant topology into the simple graph. The feasibility and efficiency of this algorithm has been validated in the context of the physic layer application of the network protocol in the virtual experiment system of computer networks.