Scribd
Upload
31 views

Ice6 PDF

The document discusses two algorithms: 1) The maximum flow minimum cut algorithm which finds the maximum flow in a flow network and the minimum cut that limits this flow. 2) The successive shortest path algorithm which finds the maximum flow in a flow network by incrementally sending flow along shortest paths from the source to the sink in the residual network. The algorithm initializes all flows to 0 and iteratively finds shortest paths and updates flows and residuals until no more flow can be sent.

Uploaded by

NabeelSaleem
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
31 views

Ice6 PDF

The document discusses two algorithms: 1) The maximum flow minimum cut algorithm which finds the maximum flow in a flow network and the minimum cut that limits this flow. 2) The successive shortest path algorithm which finds the maximum flow in a flow network by incrementally sending flow along shortest paths from the source to the sink in the residual network. The algorithm initializes all flows to 0 and iteratively finds shortest paths and updates flows and residuals until no more flow can be sent.

Uploaded by

NabeelSaleem
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

In Class Exercise 6

CE 510 Transportation Network Analysis


Department of Civil and Environmental Engineering
Portland State University

Date April 27, 2017

Maximum Flow Minimum Cuts


3

2 2,
2, 2

1 1, 0 4

3, 2
2 2,

1
Successive Shortest Path Algorithm
Initialize:
x ← 0: Initialize all flows to 0 or any feasible value
while there exists node pairs r ∈ N and s ∈ N such that br > 0 and bs < 0 do
Create residual network R(x)
Find the shortest path P from r to s in R(x)
uP ← min{br , |bs |, uij ∀(i, j) ∈ P }
for each forward arc (i, j) ∈ P do
xij = xij + uP
end for
for each reverse arc (j, i) ∈ P do
xij = xij − uP
end for
br ← br − uP
bs ← bs + uP
end while
3

) (2
0 ,3
, 3, ,0
(5 )

4 -4

1 (1, 2, 0) 4

(1
,1 , 0)
,0 ,1
) ( 4

You might also like