Commitdef19fc

authored

Merge pull request#1353 from danilopereira10/patch-2

Clarifies statement in edmonds_karp.md

2 parents4053a32 +43f5a70 commitdef19fcCopy full SHA for def19fc

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -184,7 +184,7 @@ int maxflow(int s, int t) {`
`184`	`184`
`185`	`185`	`## Integral flow theorem ## { #integral-theorem}`
`186`	`186`
`187`		`-The theoremsimplysays, that if every capacity in the network is an integer, then the flow in each edgewill bean integerin the maximal flow.`
	`187`	`+The theorem says, that if every capacity in the network is an integer, then thesize of the maximumflowis an integer, and there is a maximum flow such that the flowin each edgeisan integeras well. In particular, Ford-Fulkerson method finds such a flow.`
`188`	`188`
`189`	`189`	`## Max-flow min-cut theorem`
`190`	`190`

Comments

(0)