摘要
对于中国邮路问题,可以用奇偶点作业法,但当顶点较多时,寻找每一个圈并对其进行检验的工作十分复杂。利用求图中各点之间最短路径的方法Floyed法和求解指派问题的方法Hun-gary法可提供一种对任意个顶点的中国邮路问题的解法—Floyed-Hungary法。
Odd-evenwork methodcan be applied to solving problemsin Chinese postman,but it involves in more and more complicatedwork whenacmesof exer-cises are piled up.To solve this problem,this paper proposes a newly found method,namely,Floryed-Hungarymethod,whichis based on the methodof seeking for the shortest path betweenevery two acmesin graph and the methodof solv-ing the minimalassignment
出处
《华南热带农业大学学报》
2003年第2期32-35,共4页
Journal of South China University of Tropical Agriculture
