求解中国邮递员问题的一种思路

A Thinking of Solving the Chinese Postman Problem

对于中国邮递员问题,可以利用奇度数结点的配对来进行求解。本文根据此思想给出了一种新的求解思路——通过去掉原始图中的偶度数结点并利用最小生成树来确定奇度数结点的配对。

The pairing of odd degree’s vertices can be applied to solving the Chinese Postman Problem. According to this, the paper gives a new thinking, namely, which is used to pair the odd degree’s vertices together by removing even degree’ s vertices of original graph and making use of minimal spanning tree.