Euler graph ergodicity is a famous question of graph theory, which study how to pass by all of the points without repetition along the graph, and last return the point of departure .

• 欧拉图形遍历是图论上的很著名的研究方向，即研究什么条件下的图可以不重复的走过所有的点并返回原地点。