当所给风向图是欧拉图时，由这一近似算法求得的投递员路线是最优的投递员路线。
It is also shown that the postman route obtained by this approximation algorithm is optimal if the given windy graph is Eulerian.
若图G含有生成欧拉子图，则称G是超欧拉的。
A graph G is supereulerian if G has a spanning eulerian subgraph.
一个含有生成闭迹的图称为超欧拉图。
应用推荐