Scribd
Upload
254 views

Algoritma Dinic

Dinic's algorithm is a strongly polynomial algorithm for computing maximum flow in a flow network conceived in 1970 by Yefim Dinitz. It runs in O(V^2E) time using the concepts of level graphs and blocking flows. The algorithm finds the shortest augmenting paths in the residual graph to incrementally increase the flow until none remain. Each blocking flow increases the path lengths by at least one edge, ensuring the algorithm terminates in polynomial time.

Uploaded by

Rizky Abadi C
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
254 views

Algoritma Dinic

Dinic's algorithm is a strongly polynomial algorithm for computing maximum flow in a flow network conceived in 1970 by Yefim Dinitz. It runs in O(V^2E) time using the concepts of level graphs and blocking flows. The algorithm finds the shortest augmenting paths in the residual graph to incrementally increase the flow until none remain. Each blocking flow increases the path lengths by at least one edge, ensuring the algorithm terminates in polynomial time.

Uploaded by

Rizky Abadi C
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Dinic's algorithm

Dinic's algorithm
Dinitz's algorithm is a strongly polynomial algorithm for computing the maximum flow in a flow network,
conceived in 1970 by Israeli (formerly Soviet) computer scientist Yefim Dinitz. The algorithm runs in
time and is similar to the EdmondsKarp algorithm, which runs in

time, in that it uses shortest

augmenting paths. The introduction of the concepts of the level graph and blocking flow enable Dinic's algorithm to
achieve its performance.

Definition
Let

be a network with

and

the capacity and the flow of the edge

respectively.
The residual capacity is a mapping
1. if

2.

otherwise.

defined as,

The residual graph is the graph

, where
.

An augmenting path is an
Define

path in the residual graph

to be the length of the shortest path from

graph

.
to

in

. Then the level graph of

is the

, where
.

blocking

flow

is

an

flow

such

that

contains no

the
path.

Algorithm
Dinic's Algorithm
Input: A network
Output: An
1.
2.
3.
4.

.
flow

of maximum value.

Set
for each
.
Construct
from
of
. If
Find a blocking flow
in
.
Augment flow by
and go back to step 2.

, stop and output

graph

with

Dinic's algorithm

Analysis
It can be shown that the number of edges in each blocking flow increases by at least 1 each time and thus there are at
most
blocking flows in the algorithm, where is the number of vertices in the network. The level graph
can be constructed by Breadth-first search in

time and a blocking flow in each level graph can be found

in
time. Hence, the running time of Dinic's algorithm is
.
Using a data structure called dynamic trees, the running time of finding a blocking flow in each phase can be reduced
to
and therefore the running time of Dinic's algorithm can be improved to
.

Special cases
In networks with unit capacities, a much stronger time bound holds. Each blocking flow can be found in
time, and it can be shown that the number of phases does not exceed
runs in

and

. Thus the algorithm

time.

In networks arising during the solution of bipartite matching problem, the number of phases is bounded by
, therefore leading to the

time bound. The resulting algorithm is also known as HopcroftKarp

algorithm. More generally, this bound holds for any unit network a network in which each vertex, except for
source and sink, either has a single entering edge of capacity one, or a single outgoing edge or capacity one, and all
other capacities are arbitrary integers.[1]

Example
The following is a simulation of the Dinic's algorithm. In the level graph
values

, the vertices with labels in red are the

. The paths in blue form a blocking flow.

1.

The blocking flow consists of


1.
2.
3.

with 4 units of flow,


with 6 units of flow, and
with 4 units of flow.

Therefore the blocking flow is of 14 units and the value of flow

is 14. Note that each augmenting path in the blocking flow has 3 edges.

2.

The blocking flow consists of


1.

with 5 units of flow.

Therefore the blocking flow is of 5 units and the value of flow

is 14 + 5 = 19. Note that each augmenting path has 4 edges.

3.

Since

cannot be reached in

. The algorithm terminates and returns a flow with maximum value of 19. Note that in each blocking flow, the

number of edges in the augmenting path increases by at least 1.

Dinic's algorithm

History
Dinic's algorithm was published in 1970 by former Russian Computer Scientist Yefim (Chaim) A. Dinitz, who is
today a member of the Computer Science department at Ben-Gurion University of the Negev (Israel), earlier than the
EdmondsKarp algorithm, which was published in 1972 but was discovered earlier. They independently showed that
in the FordFulkerson algorithm, if each augmenting path is the shortest one, the length of the augmenting paths is
non-decreasing.

Notes
[1] Tarjan 1983, p.102.

References
Yefim Dinitz (2006). "Dinitz' Algorithm: The Original Version and Even's Version" (http://www.cs.bgu.ac.il/
~dinitz/Papers/Dinitz_alg.pdf). In Oded Goldreich, Arnold L. Rosenberg, and Alan L. Selman. Theoretical
Computer Science: Essays in Memory of Shimon Even. Springer. pp.218240. ISBN978-3-540-32880-3.
Tarjan, R. E. (1983). Data structures and network algorithms.
B. H. Korte, Jens Vygen (2008). "8.4 Blocking Flows and Fujishige's Algorithm". Combinatorial Optimization:
Theory and Algorithms (Algorithms and Combinatorics, 21). Springer Berlin Heidelberg. pp.174176.
ISBN978-3-540-71844-4.

Article Sources and Contributors

Article Sources and Contributors


Dinic's algorithm Source: http://en.wikipedia.org/w/index.php?oldid=568294697 Contributors: Andreas Kaufmann, Bbi5291, Evergrey, Gawi, Giftlite, Headbomb, Magioladitis, Michael
Hardy, Milicevic01, NuclearWarfare, Octahedron80, Omnipaedista, R'n'B, Rjwilmsi, Sun Creator, Tcshasaposse, Urod, X7q, 17 anonymous edits

Image Sources, Licenses and Contributors


File:Dinic algorithm G1.svg Source: http://en.wikipedia.org/w/index.php?title=File:Dinic_algorithm_G1.svg License: Public Domain Contributors: Chin Ho Lee. Original uploader was
Tcshasaposse at en.wikipedia
File:Dinic algorithm Gf1.svg Source: http://en.wikipedia.org/w/index.php?title=File:Dinic_algorithm_Gf1.svg License: Public Domain Contributors: Chin Ho Lee. Original uploader was
Tcshasaposse at en.wikipedia
File:Dinic algorithm GL1.svg Source: http://en.wikipedia.org/w/index.php?title=File:Dinic_algorithm_GL1.svg License: Public Domain Contributors: Chin Ho Lee. Original uploader was
Tcshasaposse at en.wikipedia
File:Dinic algorithm G2.svg Source: http://en.wikipedia.org/w/index.php?title=File:Dinic_algorithm_G2.svg License: Public Domain Contributors: Chin Ho Lee. Original uploader was
Tcshasaposse at en.wikipedia
File:Dinic algorithm Gf2.svg Source: http://en.wikipedia.org/w/index.php?title=File:Dinic_algorithm_Gf2.svg License: Public Domain Contributors: Chin Ho Lee. Original uploader was
Tcshasaposse at en.wikipedia
File:Dinic algorithm GL2.svg Source: http://en.wikipedia.org/w/index.php?title=File:Dinic_algorithm_GL2.svg License: Public Domain Contributors: Chin Ho Lee. Original uploader was
Tcshasaposse at en.wikipedia
File:Dinic algorithm G3.svg Source: http://en.wikipedia.org/w/index.php?title=File:Dinic_algorithm_G3.svg License: Public Domain Contributors: Chin Ho Lee. Original uploader was
Tcshasaposse at en.wikipedia
File:Dinic algorithm Gf3.svg Source: http://en.wikipedia.org/w/index.php?title=File:Dinic_algorithm_Gf3.svg License: Public Domain Contributors: Chin Ho Lee. Original uploader was
Tcshasaposse at en.wikipedia
File:Dinic algorithm GL3.svg Source: http://en.wikipedia.org/w/index.php?title=File:Dinic_algorithm_GL3.svg License: Public Domain Contributors: Chin Ho Lee. Original uploader was
Tcshasaposse at en.wikipedia

License
Creative Commons Attribution-Share Alike 3.0
//creativecommons.org/licenses/by-sa/3.0/

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy