h4SrSSKJr SSKJr SSKrSSKJr S/r \R"S\ "S50S S 9S S j5r S r g)z8 Boykov-Kolmogorov algorithm for maximum flow problems. )deque) itemgetterN)build_residual_networkboykov_kolmogorovcapacityinfT) edge_attrs returns_graphcj[XX#XF5nSURS'[R"U5 U$)a Find a maximum single-commodity flow using Boykov-Kolmogorov 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 worse case complexity $O(n^2 m |C|)$ for $n$ nodes, $m$ edges, and $|C|$ the cost of the minimum cut [1]_. This implementation uses the marking heuristic defined in [2]_ which improves its running time in many practical problems. 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 boykov_kolmogorov 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 = boykov_kolmogorov(G, "x", "y") >>> flow_value = nx.maximum_flow_value(G, "x", "y") >>> flow_value 3.0 >>> flow_value == R.graph["flow_value"] True A nice feature of the Boykov-Kolmogorov algorithm is that a partition of the nodes that defines a minimum cut can be easily computed based on the search trees used during the algorithm. These trees are stored in the graph attribute `trees` of the residual network. >>> source_tree, target_tree = R.graph["trees"] >>> partition = (set(source_tree), set(G) - set(source_tree)) Or equivalently: >>> partition = (set(G) - set(target_tree), set(target_tree)) References ---------- .. [1] Boykov, Y., & Kolmogorov, V. (2004). An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 26(9), 1124-1137. https://doi.org/10.1109/TPAMI.2004.60 .. [2] Vladimir Kolmogorov. Graph-based Algorithms for Multi-camera Reconstruction Problem. PhD thesis, Cornell University, CS Department, 2003. pp. 109-114. https://web.archive.org/web/20170809091249/https://pub.ist.ac.at/~vnk/papers/thesis.pdf r algorithm)boykov_kolmogorov_implgraphnx _clear_cache)Gstrresidual value_onlycutoffRs [/var/www/html/env/lib/python3.13/site-packages/networkx/algorithms/flow/boykovkolmogorov.pyrrs2` qQ(CA.AGGKOOA Hc t^^^^^^^^^^^^^^TU;a#[R"S[T5S35eTU;a#[R"S[T5S35eTT:Xa[R"S5eUc [X5nOUnUH!nXgR 5HnSUS'M M# UR SmUcTnUR mURmUUUUUUUU4Sjn UUUUUUUUU4 Sjn UUUUUUUUUU4 S jn UUUUU4S jmUU4S jmTS0mTS0m[TT/5m[5mSn S mTTTT0mTSTS0mX:a*U "5up}UcOTS - mX"X}5- n U "5 X:aM*U S -T:a[R"S5eTT4UR S'XR S'U$)Nznode z not in graphz!source and sink are the same noderflowrc>T (aT SnUT ;aT nT nTnOT nT nTnX0R5HupEUSUS- S:dMXA;a>XB;aUT LaX4s $X@4s $XU'T US-T U'TUTU'T RU5 MYXA;dM`T "X5(dMoXU'T US-T U'TUTU'M T R5nT (aMg)a-Bidirectional breadth-first search for the growth stage. Returns a connecting edge, that is and edge that connects a node from the source search tree with a node from the target search tree. The first node in the connecting edge is always from the source tree and the last node from the target tree. rrr)NN)itemsappendpopleft)u this_tree other_tree neighborsvattr_R_predR_succ _is_closeractivedist source_tree target_tree timestamps rgrow$boykov_kolmogorov_impl..growsq AK' ( " ' ( " $<--/ #d6l2Q6)?-6+-EA6QA6Q'(! "&q'A+Q'0| !  a(Jq,<,<'(! "&q'A+Q'0| ! 0 A/f0rc> T UUn[T USUS- 5nU/nUnUT:wa<UnTUnT UUn[X2SUS- 5nURU5 UT:waM<UR5 URU5 UnUT:wa<UnTUnT UUn[X2SUS- 5nURU5 UT:waM<[U5n[ U5n/nUH{nT UUS==U- ss'T UUS==U-ss'T UUST UUS:Xa8UT;aSTU'URU5 UT;aSTU'URU5 UnM} T R [ UT RS95 U$)a Augmentation stage. Reconstruct path and determine its residual capacity. We start from a connecting edge, which links a node from the source tree to a node from the target tree. The connecting edge is the output of the grow function and the input of this function. rrNkey)minrreverseiternextextendsortedget)r!r%r&rpathwnit these_orphansINFr(r)r,orphansrr-rr.s raugment'boykov_kolmogorov_impl..augmentsay|3Z(4<78s 1fAAA!9Q ^T (Ga5T R5nUT ;aT mTnOTmTnU U4SjXR55n[U[S5S9H<up4nUSUS- S:dMT "UT5(dM'UTU'T US-T U'TTU' O U U4SjXR55n[U[S5S9HMup4nUSUS- S:aUT ;aT R U5 TUU:XdM7S TU'T R U5 MO UT ;aT R U5 TU T (aGM4g g ) aRAdoption stage. Reconstruct search trees by adopting or discarding orphans. During augmentation stage some edges got saturated and thus the source and target search trees broke down to forests, with orphans as roots of some of its trees. We have to reconstruct the search trees rooted to source and target before we can grow them again. c3F># UHupUT;dM XTU4v M g7fN.0r>r&r,trees r 8boykov_kolmogorov_impl..adopt..'s(X6J71aSWi&Qd1g&6J !!r3rrrrc3F># UHupUT;dM XTU4v M g7frGrHrIs rrLrM0s*6J71aSWi&Qd1g&6JrNN)r rr:rr appendleftremove)r!r$nbrsr%r&drKr(r)_has_valid_rootr+r,rBr-r.timer/s @radopt%boykov_kolmogorov_impl..adoptsK!AK"" "" Xil6H6H6JXD$Tz!}=  #d6l2Q6&q$//"#Q"&q'A+Q'+ !  >6?l6H6H6J#):a="AJAQJ'$v,6:F?"MM!,Aw!|"&Q**1- #B;MM!$G;grc>/nUnUb4URU5 UT T 4;aSnOT UT :XaTUnO XnUbM4g[U5n[US5HupgXE-U- TU'T T U'M g)NrFrT)rlen enumerate) r>rKr<r% base_distlengthir!r,rrrVr/s rrU/boykov_kolmogorov_impl.._has_valid_root>s m KKNQF{ 1% G AmTdA&DA(1,DGIaL'rcD>TUTU:*=(a TUTUS-:$)NrrH)r!r%r,r/s rr**boykov_kolmogorov_impl.._is_closerRs,|y|+EQ$q'A+0EErrrOz-Infinite capacity path, flow unbounded above.trees flow_value) r NetworkXErrorstrrvaluesrsuccpredrNetworkXUnbounded)rrrrrrrr!er0rCrWrcr%rAr(r)rUr*r+r,rBr-r.rVr/s `` @@@@@@@@@@@@rr r szs1vhm<==zs1vhm<==AvBCC "1 /  AAfI ''%.C ~ VVF VVF!!F..`''R(Fd)Kd)K Aq6]FgGJ DD!T"I q!QrssWA  j%,7tLJNR MR jN r