Both the BGA routing problem and the PCB routing problem are solved based on repeated mincost max-flow computations.

• 针对球闸阵列封装以及印刷电路板，我们提出一个应用重复计算最小成本、最大流量的演算法来解决绕线问题。