hSrSSKJr SSKr/SQr"SS5r"SS5r"S S 5r\R"S \ "S 50S S9S5r \R"SSS \ "S 500S S9S5r \R"SSS.SSS00S9S5r g)z< Utility classes and functions for network flow algorithms. )dequeN) CurrentEdgeLevelGlobalRelabelThresholdbuild_residual_networkdetect_unboundednessbuild_flow_dictc4\rSrSrSrSrSrSrSrSr Sr g ) rzMechanism for iterating over out-edges incident to a node in a circular manner. StopIteration exception is raised when wraparound occurs. )_edges_it_currcTXlUR(aUR5 ggN)r _rewind)selfedgess P/var/www/html/env/lib/python3.13/site-packages/networkx/algorithms/flow/utils.py__init__CurrentEdge.__init__s ;; LLN cUR$r)rrs rgetCurrentEdge.gets zzrcx[UR5Ulg![a UR 5 ef=fr)nextr r StopIterationrrs r move_to_nextCurrentEdge.move_to_next"s1 dhhDJ  LLN  s9c[URR55Ul[ UR5Ulgr)iterr itemsr rrrs rrCurrentEdge._rewind)s* ))+,$((^ r)rr r N) __name__ __module__ __qualname____firstlineno____doc__ __slots__rrrr__static_attributes__rrrrs"+I $rrc"\rSrSrSrSrSrSrg)r.z%Active and inactive nodes in a level.)activeinactivec@[5Ul[5Ulgr)setr/r0rs rrLevel.__init__3se  rN)r%r&r'r(r)r*rr+r,rrrr.s/&Irrc0\rSrSrSrSrSrSrSrSr g) r8zNMeasurement of work before the global relabeling heuristic should be applied. cNU(aX-U- O [S5UlSUlg)Ninfr)float _threshold_work)rnmfreqs rrGlobalRelabelThreshold.__init__=s,015D.eEl rc.U=RU- slgrr:)rworks radd_workGlobalRelabelThreshold.add_workAs d rc4URUR:$r)r:r9rs r is_reached!GlobalRelabelThreshold.is_reachedDszzT__,,rcSUlg)Nrr@rs r clear_work!GlobalRelabelThreshold.clear_workGs  r)r9r:N) r%r&r'r(r)rrBrErHr+r,rrrr8s-rrcapacityr7T) edge_attrs returns_graphc ^^^UR5(a[R"S5e[R"5nSUlUR U5 [ S5mURSS9VVVs/sH)up4nX4:wdM URTT5S:dM%X4U4PM+ nnnnS[UU4SjU55-=(d S mUR5(akUHdup4n[URTT5T5nURX45(d"URX4US 9 URXCSS 9 MZXrUUS 'Mf OHUHBup4n[URTT5T5nURX4US 9 URXCUS 9 MD TURS'U$s snnnf) aBuild a residual network and initialize a zero flow. 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. z0MultiGraph and MultiDiGraph not supported (yet).Nr7T)datarc3Z># UH upnTU;dMUTT:wdMUTv M" g7frr,).0uvattrrJr7s r )build_residual_network..s; ' d4 $(Nc$9 DN's ++ +)rJrJ) is_multigraphnx NetworkXErrorDiGraph__networkx_cache__add_nodes_fromr8rrsum is_directedminhas_edgeadd_edgegraph) GrJRrRrSrT edge_listrr7s ` @rrrKs4 QRR AAQ ,C''t',,JA$ 6 hhx-1 t ,  '     }}#JA$DHHXs+S1A::a## 1! , 1! ,'(!Q #$$JA$DHHXs+S1A JJqaJ ( JJqaJ ( $AGGEN H[s9 F( F(!F(re)graphspreserve_edge_attrspreserve_graph_attrscV[U/5nU1nURSnU(aUR5nXR5HTupxUSU:XdMXt;dMXr:Xa[R "S5eUR U5 URU5 MV U(aMgg)z*Detect an infinite-capacity s-t path in R.r7rJz-Infinite capacity path, flow unbounded above.N)rrcpopleftr#rYNetworkXUnboundedaddappend) restqseenr7rRrSrTs rrrs qc A 3D ''%.C IIKtzz|GAJ3&1=6..G  $ !rrW)rdreflow)rhric0nUHDnXVs0sHoDS_M snX#'X#RSXR555 MF U$s snf)z0Build a flow dictionary from a residual network.rc3H# UHupUSS:dMXS4v M g7f)rtrNr,)rQrSrTs rrU"build_flow_dict..s* -9'!T&\A=M QV \s" ")updater#)rdre flow_dictrRrSs rr r s_I &'d+d1d+   -.TZZ\    ,s A)r) collectionsrnetworkxrY__all__rrr _dispatchabler8rrr r,rrr~s $$6&j%,7tLO MO d z5<89   "qq)fd^?TUVr