摘要
本文对巡更路线的随机生成算法进行了较为深入的探讨与阐述 ,建立了基于无向连通图的巡更路线数学模型并给出了巡更路线随机生成算法中若干名词的定义。在给出了取点算法和回退递归算法的基础上 ,提出了巡更路线的随机生成算法 ,并对名词定义和算法进行了举例说明。
In this paper, the algorithm of randomly generating perambulatory routes is deeply discussed. Based on connected undigraphs, the mathematical model of perambulatory route is established. Then the definitions of some terms are given. After presenting the algorithm of choosing points and the algorithm of withdrawal recursion, this algorithm of perambulatory route is finally put forward. Also, some examples of terms and algorithms are shown.
出处
《计算机工程与科学》
CSCD
2004年第3期55-56,60,共3页
Computer Engineering & Science