Network stream highlights

Maximum stream
Poj 1273 drainage ditches
Poj 1274 the perfect stall (Bipartite Graph Matching)
Poj 1698 Alice's chance
Poj 1459 Power Network
Poj 2112 optimal milking (Binary)
Poj 2455 secret milking machine (Binary)
Poj 3189 steady cow assignment (enumeration)
Poj 1637 Sightseeing Tour (hybrid plot Euler loop)
Poj 3498 March of the Penguins (enumeration points)
Poj 1087 a plug for Unix
Poj 1149 (Architecture)
Zoj 2760 how many Shortest Path (number of short circuits with non-intersection edges)
Poj 2391 ombrophobic bovines (point splitting is required; otherwise there is a bug)
Whu 1124 football coach)
Sgu 326 perspective (Graphic question, similar to whu 1124)
Ultraviolet A 563 crimewave
Ultraviolet A 820 Internet bandwidth
Poj 3281 dining)
Poj 3436 ACM computer factory
Poj 2289 Jamie's contact groups (two points)
Sgu 438 the glorious karlutka river =) (split by Time)
Sgu 242 student's morning (output a group of solutions)
Sgu 185 two shortest (Dijkstra preprocessing, two augmented operations, must be implemented using an adjacent array; otherwise, MLE)
Hoj 2816 Power Line
Poj 2699 the maximum number of strong kings (enumeration + diagram)
Zoj 2332 gems
Joj 2453 candy)
Soj3312 stockhoma knights
Soj3353 total flow
Soj2414 leapin 'lizards
Minimum Cut
Soj3106 dual core CPU
Soj3109 space flight
Soj3107 select
Soj3185 black and white
Soj3254 rain and fgj
Soj3134 windy and mercury-Mercury Transportation
Hoj 2634 how to earn more
Zoj 2071 technology trader (cropping edge)
Hnu10940 coconuts
Zoj 2532 internship (find the key edge)
Poj 1815 friendship (vertex cut set with the smallest Lexicographic Order)
Poj 3204 Ikki's story I-road reconstruction (find the key cut edge)
Poj 3308 paratroopers
Poj 3084 panic room
Poj 3469 dual core CPU
Zoj 2587 unique attack (uniqueness determination of minimum cut)
Poj 2125 destroying the graph (find cut edge)
Zoj 2539 Energy Minimization
Tju 2944 mussy paper (largest weighted closed subgraph)
Poj 1966 cable TV network (undirected graph point connectivity)
HDU 1565 square fetch (1) (largest vertex weight independent set)
HDU 1569 square fetch (2) (largest vertex weight independent set)
Poj 2987 firing (maximum weighted closed subgraph)
Spoj 839 optimal marks (converts an XOR operation into a minimum cut for each bit)
Hoj 2811 earthquake damage (minimum point cut set)
2008 Beijing Regional Contest Problem A destroying the bus stations (BFS preprocessing) (http://acmicpc-live-archive.uva.es/nuevoportal/data/problem.php? P = 4322)
Zoj 2676 network wars (parameter search)
Poj 3155 hard life (parameter search)
Zozj 3241 being a hero

Upper and Lower Bounds
Zoj 2314 Reactor cooling (viable stream with no source sink)
Poj 2396 budget (active bank Stream)
Sgu 176 flow construction (minimum flow with source sink)
Zoj 3229 shoot the bullet (maximum stream with source sink)
HDU 3157 crazy circuits (smallest stream with source sink)

Minimum charge flow
Hoj 2715 matrix3
Hoj 2739 the Chinese Postman Problem
Poj 2175 evacuation plan (one negative circle)
Poj 3422 Kaka's matrix travels (similar to matrix3)
Poj 2516 minimum cost (creating images multiple times by item type)
Poj 2195 going home
BUAA 1032 destroying a painting
Poj 2400 supervisor, supervisee (output all minimum weights)
Poj 3680 intervals
Hoj 2543 stone IV
Poj 2135 farm tour
Bashu2445 napkin Problems
--------------------------------------------- Onmylove original

Maximum stream question:

TC:

Single Round Match 200 Round 1-division I, level three

Single Round Match 236 Round 1-division I, level three

 

Single Round Match 399 Round 1-division I, level three

SameHoj1024:Http://acm.hust.edu.cn/thx/problem.php? Id = 1024

 

 

2003 TCO semifinal round 4-division I, level three

2004 TCCC championship round-division I, level three

2005 TCO merge sor track round 3-division I, level one

 

 

 

 

 

Euler's loop of a hybrid Graph

Poj1637:Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1637

 
Zju1992:Http://acm.zju.edu.cn/show_problem.php? PID = 1, 1992 
 

Augmented edge:

Poj3204:Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 3204

For example:Hoj1082:Http://acm.hust.edu.cn/thx/problem.php? Cid = 1017 & pid = 6

 

 

 

 

Project selection problems:

Poj3469:Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 3469

Zoj2930:Http://acm.zju.edu.cn/show_problem.php? PID = 1, 2930

Find the solution with the most projects selected for the project.

 

 

Graph creation:

Poj1149:Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1149

Poj3436:Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 3436

Poj3281:Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 3281

 

 

Connectivity:

Point connectivityPoj1966: Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1966

 
Uva563,Http://icpcres.ecs.baylor.edu/onlinejudge/ 
 

 
The number of non-handed path entries must be split.
 

 

 

 

Minimum Cut:

Poj2914:Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2914

(Stoer-Wagner)

 

 

 

 

Basic questions:

Poj3498:Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 3498

Enumeration:DoNMaximum number of streams.

 

Poj1087:Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1087

You can use the largest stream or bipartite graph matching.

 

 

 

Poj1273:Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1273

 

Poj1274:Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1274

 

Poj1325: http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1325

 

Poj1459:Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1459

Poj1797:Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1797

 

Poj1815:Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1815

 

 

Poj2112:Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2112

 

Poj2239:Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2239

 

Poj2289: http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2289

 

Poj2391:Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2391

 

Poj2987:Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2987

 

Poj3308:Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 3308

Tip:Max weight closure, converted to Max stream

 

Poj3155: http://acm.pku.edu.cn/JudgeOnline/problem? Id = 3155

Hard

 

 
Sgu 1, 176Http://acm.sgu.ru/problem.php? Contest = 0 & problem = 176 
 

 
Network Flow Problems with higher and lower limits of capacity are difficult
 

 
Spoj660:Http://www.spoj.pl/problems/QUEST4/ 
 

 
Spoj377:Http://www.spoj.pl/problems/TAXI/ 
 

 
Ultraviolet 
 

 
Http://icpcres.ecs.baylor.edu/onlinejudge/ 
 

 
753, 
 

 
820, 
 

 
10122, 
 

 
10330, 
 

 
10511, 
 

 
10735.