Home
Random
Nearby
Log in
Settings
Donate Now
If Wikipedia is useful to you, please give today.
About Wikipedia
Disclaimers
Search
Push–relabel maximum flow algorithm: Difference between revisions
Article
Talk
Language
Watch
View history
Edit
Browse history interactively
← Previous edit
Next edit →
Content deleted
Content added
Visual
Wikitext
Revision as of 13:10, 27 November 2013
edit
Drrilll
(
talk
|
contribs
)
95
edits
→
Relabel-to-Front
← Previous edit
Revision as of 16:19, 27 November 2013
edit
undo
MenoBot
(
talk
|
contribs
)
Bots
273,066
edits
m
WPCleaner
v1.30b - Fixed using
WP:WCW
- Link equal to linktext
Next edit →
Line 16:
==Definition==
The push-relabel algorithm finds maximum flow on a [[
flow network|
flow network]]. There are three conditions for a flow network:
:{|