+ j<Rt^RIHt^RIt.ROt!RR4t!RR4t!RR4t]P!R ] !R 4/R R R 7R 4t ]P!RRR ] !R 4//R R7R4t ]P!R^R^/RRR//R7R4t RtR#)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&&_/home/luca/screen-checking/.venv/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_graphpreserve_edge_attrsc na VP4'd\P!R4h\P!4pRVnVP V4\ W4pVPRR7UUUu.uF*wr4pW48wgKV!W4V4;pfKV^8gK&W4V3NK, pppp\R4o ^\V 3RlV44,;'g^o VP4'dkVFcwr4p\VS 4pVPW44'g)VPW4VR7VPWC^R7KQWV,V,R&Ke M>VF8wr4p\VS 4pVPW4VR7VPWCVR7K: S VPR&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).NT)datar7c3><"TFwrq3S8wgKVxK R#5ir).0uvcapr7s& r )build_residual_network..s?y)!3J##ys  )rKrK) is_multigraphnx NetworkXErrorDiGraph__networkx_cache__add_nodes_from_capacity_functionr r8sum is_directedminhas_edgeadd_edgegraph) GrKRrTrUattrrV edge_listrr7s && @r build_residual_networkrkPs8 QRR AAQ!!.H''t',,JA$ 6 &qT22s DG!G s , ,C c?y?? ? D D1C}}"IA#C A::a## 1! , 1! ,'(!Q ###IA#C A JJqaJ ( JJqaJ ( #AGGEN HOs< F0 F0F0$F0rg)graphsrNpreserve_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)rrepopleftrrZNetworkXUnboundedaddappend) rgstqseenr7rTrUrhs &&& r detect_unboundednessrws qc A 3D ''%.C IIKtzz|GAJ3&1=6..G  $ rrfflow)rlrNc/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)rxNrR)rSrUrhs& r rW"build_flow_dict..s* -9'!T&\A=M QV \s++)updater)rfrg flow_dictrTrUs&& r build_flow_dictr~s_I &'d+d1d+   -.TZZ\    ,s AcPaa\R4o\S4'dS#VV3Rl#)aReturns a callable that returns the capacity of an edge. Parameters ---------- G : NetworkX graph MultiGraph and MultiDiGraph are not supported. capacity : string or callable If callable, the callable is returned unchanged. For it to work it must accept exactly three positional arguments ``(u, v, edge_attrs)``, where `u` and `v` are the endpoints of an edge and ``edge_attrs`` is the corresponding edge attribute dictionary. The callable must return either None (to hide an edge) or a number representing the capacity. If string, it is interpreted as the key of an edge attribute storing the capacity. In this case, a new callable is returned that accepts ``(u, v, edge_attrs)`` and returns ``edge_attrs[capacity]``. Returns ------- callable A callable with signature ``(u, v, edge_attrs)`` that returns the capacity of the edge joining nodes `u` and `v`. Notes ----- If `capacity` is a string and the specified attribute is not present on an edge, that edge is assumed to have infinite capacity. r7c(<VPSS4#r)r)rTrUrPrKr7s&&&r $_capacity_function..sdhhx5r)r8callable)rfrKr7s&f@r r_r_s'@ ,C 65r)rrrrkrwr~)r) collectionsrnetworkxrZ__all__rrr _dispatchabler8rkrwr~r_rRrr rs   @&E%L)SWI I X z5<89   "#q#q)fd^?TUV&6r