Network Flows Flashcards
1
Q
Value
A
Represents capacity
2
Q
Flow in =
A
Flow out
3
Q
Max flow
A
Min cut theorem -> smallest capacities
4
Q
When calculating cut
A
Only count flows out the source, not flows into source
5
Q
Some networks have more than one source or sink node so
A
Add a single supersource or supersink on either end and make sure weights align.
