Following the definition of graph topology and network routing, a bounded neighbor discovery algorithm is proposed, and the upper bound on trips of any loop crossing one specified links is proved.

• 再提出基于有界扩散的邻接发现算法，并证明某一回路穿越特定链路次数的上界；