h SrSSKJr SSKrSSKJr SSKJr S/r \R"S\ "S50S S 9S S j5r S r g)z. Dinitz' algorithm for maximum flow problems. )dequeN)build_residual_network)pairwisedinitzcapacityinfT) edge_attrs returns_graphcj[XX#XF5nSURS'[R"U5 U$)a@Find a maximum single-commodity flow using Dinitz' algorithm. This function returns the residual network resulting after computing the maximum flow. See below for details about the conventions NetworkX uses for defining residual networks. This algorithm has a running time of $O(n^2 m)$ for $n$ nodes and $m$ edges [1]_. Parameters ---------- G : NetworkX graph Edges of the graph are expected to have an attribute called 'capacity'. If this attribute is not present, the edge is considered to have infinite capacity. s : node Source node for the flow. t : node Sink node for the flow. capacity : string Edges of the graph G are expected to have an attribute capacity that indicates how much flow the edge can support. If this attribute is not present, the edge is considered to have infinite capacity. Default value: 'capacity'. residual : NetworkX graph Residual network on which the algorithm is to be executed. If None, a new residual network is created. Default value: None. value_only : bool If True compute only the value of the maximum flow. This parameter will be ignored by this algorithm because it is not applicable. cutoff : integer, float If specified, the algorithm will terminate when the flow value reaches or exceeds the cutoff. In this case, it may be unable to immediately determine a minimum cut. Default value: None. Returns ------- R : NetworkX DiGraph Residual network after computing the maximum flow. Raises ------ NetworkXError The algorithm does not support MultiGraph and MultiDiGraph. If the input graph is an instance of one of these two classes, a NetworkXError is raised. NetworkXUnbounded If the graph has a path of infinite capacity, the value of a feasible flow on the graph is unbounded above and the function raises a NetworkXUnbounded. See also -------- :meth:`maximum_flow` :meth:`minimum_cut` :meth:`preflow_push` :meth:`shortest_augmenting_path` Notes ----- The residual network :samp:`R` from an input graph :samp:`G` has the same nodes as :samp:`G`. :samp:`R` is a DiGraph that contains a pair of edges :samp:`(u, v)` and :samp:`(v, u)` iff :samp:`(u, v)` is not a self-loop, and at least one of :samp:`(u, v)` and :samp:`(v, u)` exists in :samp:`G`. For each edge :samp:`(u, v)` in :samp:`R`, :samp:`R[u][v]['capacity']` is equal to the capacity of :samp:`(u, v)` in :samp:`G` if it exists in :samp:`G` or zero otherwise. If the capacity is infinite, :samp:`R[u][v]['capacity']` will have a high arbitrary finite value that does not affect the solution of the problem. This value is stored in :samp:`R.graph['inf']`. For each edge :samp:`(u, v)` in :samp:`R`, :samp:`R[u][v]['flow']` represents the flow function of :samp:`(u, v)` and satisfies :samp:`R[u][v]['flow'] == -R[v][u]['flow']`. The flow value, defined as the total flow into :samp:`t`, the sink, is stored in :samp:`R.graph['flow_value']`. If :samp:`cutoff` is not specified, reachability to :samp:`t` using only edges :samp:`(u, v)` such that :samp:`R[u][v]['flow'] < R[u][v]['capacity']` induces a minimum :samp:`s`-:samp:`t` cut. Examples -------- >>> from networkx.algorithms.flow import dinitz The functions that implement flow algorithms and output a residual network, such as this one, are not imported to the base NetworkX namespace, so you have to explicitly import them from the flow package. >>> G = nx.DiGraph() >>> G.add_edge("x", "a", capacity=3.0) >>> G.add_edge("x", "b", capacity=1.0) >>> G.add_edge("a", "c", capacity=3.0) >>> G.add_edge("b", "c", capacity=5.0) >>> G.add_edge("b", "d", capacity=4.0) >>> G.add_edge("d", "e", capacity=2.0) >>> G.add_edge("c", "y", capacity=2.0) >>> G.add_edge("e", "y", capacity=3.0) >>> R = dinitz(G, "x", "y") >>> flow_value = nx.maximum_flow_value(G, "x", "y") >>> flow_value 3.0 >>> flow_value == R.graph["flow_value"] True References ---------- .. [1] Dinitz' Algorithm: The Original Version and Even's Version. 2006. Yefim Dinitz. In Theoretical Computer Science. Lecture Notes in Computer Science. Volume 3895. pp 218-240. https://doi.org/10.1007/11685654_10 r algorithm) dinitz_implgraphnx _clear_cache)Gstrresidual value_onlycutoffRs U/var/www/html/env/lib/python3.13/site-packages/networkx/algorithms/flow/dinitz_alg.pyrrs2v A!x8A#AGGKOOA Hc^^^^^TU;a#[R"S[T5S35eTU;a#[R"S[T5S35eTT:Xa[R"S5eUc [X5nOUnUH!nXgR 5HnSUS'M M# UR SmUcTnUR mURmUUU4Sjn UUUU4Sjn Sn X:a@U "5n TU ;aO2U "U 5n U S -T:a[R"S 5eX- n X:aM@XR S 'U$) Nznode z not in graphz!source and sink are the same noderflowrc>0nTS0n[TS4/5nU(aT U;aU$UR5up4TUR5HgupVUSUS- S:dMXP;a"XUS-:XaXRU5 M;M=[U/5X'US-X'URXTS-45 Mi U(aMU$)Nrrr)rpopleftitemsappend) parents vertex_distqueueudistvattrR_succrrs rbreath_first_search(dinitz_impl..breath_first_searchs!f 1vhG|mmoGA!!9??, #d6l2Q6|&>TAX5#J--a06&+A3Z )-  a]3- erc>SnT nU/n[X5S:aXSnURU5 O9UR5 [U5S:XaU$USnXR5 UT:XaTn[ U5H&up$[ UTUUSTUUS- 5nM( [ [ U55Hup$TUUS==U- ss'TUUS==U-ss'TUUSTUUS- S:XdMHXR5 USU:wdMeUR5 USU:waMM X- nUSnUnGMF)z-Build a path using DFS starting from the sinkrrr)lenr poprrminreversed) r! total_flowr$pathr&rINFR_predrrs rdepth_first_search'dinitz_impl..depth_first_searchst s7:"JqM A t9>&%H ""$Av$TNDAtVAYq\*%=q ! V@T%TUD+$Xd^4DA1IaL(D0(1IaL(D0(ay|J/&)A,v2FF!K **,"2h!m HHJ#2h!m 5" HA3rz-Infinite capacity path, flow unbounded above. flow_value) r NetworkXErrorstrrvaluesrsuccpredNetworkXUnbounded)rrrrrrrr$er)r5r8r! this_flowr3r4r(s `` @@@rr r sHzs1vhm<==zs1vhm<==AvBCC "1 / AAfI ''%.C ~ VVF VVF(""HJ  %' G  &w/ q=3 &&'VW W   'GGL Hr)rNFN)__doc__ collectionsrnetworkxrnetworkx.algorithms.flow.utilsrnetworkx.utilsr__all__ _dispatchablefloatrr rrrJsSA# *j%,7tL} M} @_ r