Network stream [review + Summary]

Let's take a look at the previous network flow problem solving report and network flow algorithm. Here we will summarize and review the report.

The SAP algorithm, which is most commonly used at present, does not quite understand the code when I first learned it. I only pasted the template, So I re-typed it. The link to the first question at that time:

SAP optimization thought http://blog.csdn.net/jxy859/article/details/6630182

For some special questions, it will be very slow to use sap. For example, some N and m are relatively large, while u is a small number. The FF algorithm of O (N * m * u) may be more effective:

Poj 2455

 

Max weight closure diagram:

Http://blog.csdn.net/jxy859/article/details/6670026

Http://blog.csdn.net/jxy859/article/details/6740880

Http://blog.csdn.net/jxy859/article/details/6787714

It's mathematical model: http://acm.hdu.edu.cn/showproblem.php? PID = 4307 Hu botao thesis 3.1

 

Application of score planning in minimum cut:

See Hu botao's thesis 1.6,

Question

Http://acm.zju.edu.cn/onlinejudge/showProblem.do? Problemcode = 2676.

 

2012 multi-school network flow during summer vacation:

HDU 4322 4307 4309

2012 network traffic for network qualifiers:

HDU