poj 1149 pigs 最大流的例题 还要写什么-poj 1,149 pigs maximum flow of excellence he wrote.

北京大学poj上训练题目，邮寄到经典题目

dinic网络最大流算法，POJ测试通过-dinic algorithm,accessed by POJ

poj上网络流的几道题（1149，1689，2112，2391，2455，3436），关键是抽象出网络流的模型，这样才能想出怎么运用他。-poj the network flow a few questions (1149,1689,2112,2391,2455,3436), the key is to abstract the network flow model, in order to figure out how to use him.