PowerPoint 簡報

An Algorithm for the Chinese

Postman Problem

1. Solve the Symmetric Augmentation Problem

(Replicating the edges so that the digraph become

a minimum-cost Euler digraph).

- Linear Programming

- Minimum-cost maximum flow problem

2. Find an Euler tour of the Euler digraph

下一張投影片

回到第一張投影片

檢視圖形版本