著名图论问题之一。邮递员从邮局出发送信，要求对辖区内每条街，都至少通过一次，再回邮局。在此条件下，怎样选择一条最短路线?此问题由中国数学家管梅谷于1960年首先研究并给出算法，故名。-Well-known graph theory problems. Postman deliver a letter from the post office proceed to require every street within the right area, at least through the time, return to post office. Under these conditions, how to select a shortest route? This issue by the Chinese mathematician Mei Gu tube study in 1960, and gives the first algorithm, hence the name.