'Shortest augmenting path' diaporamas de présentation

Maximum Flow Networks

462 views • 32 slides

Complexity of Ford-Fulkerson

Complexity of Ford-Fulkerson. Let U = max {(i,j) in A} u ij . If S = {s} and T = N{s}, then u[S,T] is at most nU. The maximum flow is at most nU. At most nU augmentations. Each iteration of the inner while loop is O(m): Each arc is inspected at most once Finding ? is O(n)

263 views • 9 slides