POJ 1273 Drainage Ditches

Description

Every time itrains on Farmer John's fields, a pond forms over Bessie's favorite cloverpatch. This means that the clover is covered by water for awhile and takesquite a long time to regrow. Thus, Farmer John has built a set of drainageditches so that Bessie's clover patch is never covered in water. Instead, thewater is drained to a nearby stream. Being an ace engineer, Farmer John hasalso installed regulators at the beginning of each ditch, so he can control atwhat rate water flows into that ditch. 
Farmer John knows not only how many gallons of water each ditch can transportper minute but also the exact layout of the ditches, which feed out of the pondand into each other and stream in a potentially complex network. 
Given all this information, determine the maximum rate at which water can betransported out of the pond and into the stream. For any given ditch, waterflows in only one direction, but there might be a way that water can flow in acircle. 

Input

The input includesseveral cases. For each case, the first line contains twospace-separated integers, N (0 <= N <= 200) and M (2 <= M <= 200).N is the number of ditches that Farmer John has dug. M is the number ofintersections points for those ditches. Intersection 1 is the pond. Intersectionpoint M is the stream. Each of the following N lines contains three integers,Si, Ei, and Ci. Si and Ei (1 <= Si, Ei <= M) designate the intersectionsbetween which this ditch flows. Water will flow through this ditch from Si toEi. Ci (0 <= Ci <= 10,000,000) is the maximum rate at which water willflow through the ditch.

Output

For each case,output a single integer, the maximum rate at which water may emptied from thepond.

Sample Input

5 4

1 2 40

1 4 20

2 4 20

2 3 30

3 4 10

Sample Output

50

题目大意：N条路，M个点。告诉N条路的起点、终点以及流量，求从1到M点的最大流。

方法：这是去年暑假写的题了，也是写的第一道最大流的题。就是一个裸的最大流问题。就不多说了，就一个模板就完了