This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: a directed graph G = (V, E) with the following features Associated with each edge is a capacity, a nonnegative number, c e There is a single source node s V There is a single sink node t V Nodes other than s and t = internal nodes Assumptions No edge enters the source s and no edge leaves the sink t there is at least one edge incident to each node all capacities are integers 60-1 60 Defning Flow An s-t ow is a unction that maps each edge e to a nonnegative real number, : E -> R + ; the value (e) intuitively represents the amount o ow carried by an edge e A ow must satisy the ollowing two properties: 60-2...
View Full Document