1 10 10 2 2 3 3 t 5 5 6 00 6 00 S3 12 s3 20 20 14 14 7 6 7 3 5 13 13 18 18 11 2 2 雪 5
严格的数学模型 We are now ready to define flows more formally.Let G =(V.E)be a flow network with a capacity function c.Let s be the source of the network,and let t be the sink.A flow in G is a real-valued function f:Vx V-R that satisfies the following two properties: Capacity constraint: Flow conservation:For all ue V-fs.t,we require When (u,v)E,there can be no flow from u to v,and f(u,v)=0
严格的数学模型
问题4： 什么叫一个flow的*value即？ IfI=∑fs,)-∑fw,) ve V 什么是最大流问题？
How to get the maximum flow? 5 4 5 6 2 6 4 5 2 3 5
How to get the maximum flow? 6 4 5 2 3 1 5 5 4 7 5 6 2
How to get the maximum flow? 2/5 5 2/6 4 2/7 2 6 4 5 2 3 5
How to get the maximum flow? 6 4 5 2 3 1 5 5 4 2/7 2/5 2/6 2