讨论了用遗传规划寻找任意欧拉图中的欧拉回路的原理，给出了解题的分级方法，群体定义方法与适合值的测试方法，并对结果进行了分析比较。

In this paper, it was discussed that how to solving Euler loop problems by means of genetic programming.The methods of hierachical decomposition, population define and fitness measure were also given in this paper.We analysed and compared the results of the genetic programming.The process of solving the Euler loop problems in this paper may give some help for solving other graph problems.