+ )if4Rt^RIHt^RIt.ROt!RR4t!RR4t!RR4t]P!R ] !R 4/R R 7R 4t ]P!RRR ] !R 4//R R7R4t ]P!R^R^/RRR//R7R4t R#)z< Utility classes and functions for network flow algorithms. )dequeN CurrentEdgeLevelGlobalRelabelThresholdcFa]tRt^toRtR tRtRtRtRt Rt Rt Vt R#) rzMechanism for iterating over out-edges incident to a node in a circular manner. StopIteration exception is raised when wraparound occurs. cZWnVP'dVP4R#R#N)_edges_rewind)selfedgess&&\/var/www/html/photoedit/myenv/lib/python3.14/site-packages/networkx/algorithms/flow/utils.py__init__CurrentEdge.__init__s ;;; LLN cVP#r)_currr s&r getCurrentEdge.gets zzrc|\VP4VnR# \dTP 4hi;ir)next_itr StopIterationr rs&r move_to_nextCurrentEdge.move_to_next"s1 dhhDJ  LLN  s;c\VPP44Vn\ VP4VnR#r)iterr itemsrrrrs&r r CurrentEdge._rewind)s* ))+,$((^ rch\VRR4VP3\VRR4VP38H#)rN)getattrr )r others&&r __eq__CurrentEdge.__eq__-s6gt,dkk: UGT *ELL 9  r)rr rN)r rr) __name__ __module__ __qualname____firstlineno____doc__ __slots__rrrr r#__static_attributes____classdictcell__ __classdict__s@r rrs/+I $  rc.a]tRt^3toRtRtRtRtVtR#)rz%Active and inactive nodes in a level.cB\4Vn\4VnR#r)setactiveinactivers&r rLevel.__init__8se  r)r2r3N) r%r&r'r(r)r*rr+r,r-s@r rr3s/&Irc<a]tRt^=toRtRtRtRtRtRt Vt R#)rzNMeasurement of work before the global relabeling heuristic should be applied. cbV'dW,V, M \R4Vn^VnR#)infN)float _threshold_work)r nmfreqs&&&&r rGlobalRelabelThreshold.__init__Bs,015D.eEl rc8V;PV, unR#rr:)r works&&r add_workGlobalRelabelThreshold.add_workFs d rc4VPVP8#r)r:r9rs&r is_reached!GlobalRelabelThreshold.is_reachedIszzT__,,rc^VnR#)Nr@rs&r clear_work!GlobalRelabelThreshold.clear_workLs  r)r9r:N) r%r&r'r(r)rrBrErIr+r,r-s@r rr=s#-rcapacityr7T) edge_attrs returns_graphc aaVP4'd\P!R4h\P!4pRVnVP V4\ R4oVPRR7UUUu.uF+wr4pW48wgKVPSS4^8gK'W4V3NK- pppp^\VV3RlV44,;'g^oVP4'd{VFswr4p\VPSS4S4pVPW44'g)VPW4VR7VPWC^R7KaWrV,V,R&Ku MNVFHwr4p\VPSS4S4pVPW4VR7VPWCVR7KJ SVPR&V#uupppi) 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)datac3n<"TF*wrpSV9gKVS,S8wgKVS,xK, R#5ir).0uvattrrKr7s& r )build_residual_network..s= ' d4 $(Nc$9 DNN's 5 55)rKrK) is_multigraphnx NetworkXErrorDiGraph__networkx_cache__add_nodes_fromr8r rsum is_directedminhas_edgeadd_edgegraph) GrKRrSrTrU edge_listrr7s &f @r build_residual_networkrhPs4 QRR AAQ ,C''t',,JA$ 6 hhx-1 t ,  '      }}#JA$DHHXs+S1A::a## 1! , 1! ,'(!Q #$$JA$DHHXs+S1A JJqaJ ( JJqaJ ( $AGGEN H[s= G G&Gre)graphspreserve_edge_attrspreserve_graph_attrsch\V.4pV0pVPR,pV'dVP4pW,P4F[wrxVR,V8XgKWt9gKWr8Xd\P !R4hVP V4VPV4K] KR#)z*Detect an infinite-capacity s-t path in R.r7rKz-Infinite capacity path, flow unbounded above.N)rrcpopleftrrYNetworkXUnboundedaddappend) restqseenr7rSrTrUs &&& r detect_unboundednessrus qc A 3D ''%.C IIKtzz|GAJ3&1=6..G  $ rrdflow)rirjc/pVFOpW,Uu/uFqD^bK upW#&W#,PRW,P444KQ V#uupi)z0Build a flow dictionary from a residual network.c3Z"TF!wrVR,^8gKWR,3xK# R#5i)rvNrQ)rRrTrUs& r rV"build_flow_dict..s* -9'!T&\A=M QV \s++)updater)rdre flow_dictrSrTs&& r build_flow_dictr|s_I &'d+d1d+   -.TZZ\    ,s A)rrrrhrur|)r) collectionsrnetworkxrY__all__rrr _dispatchabler8rhrur|rQrr rs   @&j%,7tLO MO d z5<89   "#q#q)fd^?TUVr