Solve the symmetric Augmentation Problem by the Minimum-cost Maximum Flow Problem

Capacity

=x=1

Capacity

=y=1

x = indegree - outdegree of node 2 =1

y = indegree - outdegree of node 3 =1

1

3

2

4

T

S

1

3

2

4

+1

+1

+1

+1

前一張投影片

下一張投影片

回到第一張投影片

檢視圖形版本