+ j Rt^RIt^RIHt.R Ot]P R4t]!R4]P R44t]!R4]!R4]P !RRR7R R l444t R#) z5Functions for computing and verifying regular graphs.N)not_implemented_forcTaaa\V4^8Xd\P!R4h\PP V4pVP 4'g`VP V4o\;QJd)V3RlVP 4F 'dK R# R#!V3RlVP 44#VPV4oV3RlVP4pVPV4oV3RlVP4p\V4;'d \V4#)aDetermines whether a graph is regular. A regular graph is a graph where all nodes have the same degree. A regular digraph is a graph where all nodes have the same indegree and all nodes have the same outdegree. Parameters ---------- G : NetworkX graph Returns ------- bool Whether the given graph or digraph is regular. Examples -------- >>> G = nx.DiGraph([(1, 2), (2, 3), (3, 4), (4, 1)]) >>> nx.is_regular(G) True zGraph has no nodes.c32<"TF wrSV8HxK R#5iN).0_dd1s& \/home/luca/screen-checking/.venv/lib/python3.14/site-packages/networkx/algorithms/regular.py is_regular..&s0xtq27xFTc32<"TF wrSV8HxK R#5irr)rrr d_ins& r r r )s8KDAdaiKrc32<"TF wrSV8HxK R#5irr)rrr d_outs& r r r +s;ldauzlr) lennxNetworkXPointlessConceptutilsarbitrary_element is_directeddegreeall in_degree out_degree)Gn1 in_regular out_regularr rrs& @@@r is_regularr! s0 1v{))*?@@  # #A &B ==?? XXb\s0qxx0ss0s0s0qxx000{{28AKK8  R ;all; :333{#33directedca\;QJd)V3RlVP4F 'dK R# R#!V3RlVP44#)aJDetermines whether the graph ``G`` is a k-regular graph. A k-regular graph is a graph where each vertex has degree k. Parameters ---------- G : NetworkX graph Returns ------- bool Whether the given graph is k-regular. Examples -------- >>> G = nx.Graph([(1, 2), (2, 3), (3, 4), (4, 1)]) >>> nx.is_k_regular(G, k=3) False c32<"TF wrVS8HxK R#5irr)rnr ks& r r is_k_regular..Fs+($!qAv(rFT)rr)rr's&fr is_k_regularr)/s6. 3+!((+33+3+3+!((+ ++r" multigraphT)preserve_edge_attrs returns_graphcaa aaa\;QJd)V3RlVP4F 'gK RM RM!V3RlVP44'd\P!R4hVP 4p.pVPEFUwrVSVR, 8o\ V4Uu.uFquV3NK upoS'd.\ V^V,S, 4Uu.uFquV3NK pp.o MU\ ^V,^V,S,4Uu.uFquV3NK pp\ V^V,4Uu.uFquV3NK upo VP \SS 44\SW5,P44Fwp wrVP!W3/V BK VP V VV3RlV44VPV4VPVSVS 34EKX \P!VRVR7o\P!VS4'g\P!R4hVPV3R lVP44VFwpopo VP!V4\#V4p SFIp VP$V ,P4F!wrW9gK VP!WZ3/V BKG KK VP'SV,S ,4K V#uupiuupiuupiuupi) uCompute a `k`-factor of a graph. A `k`-factor of a graph is a spanning `k`-regular subgraph. A spanning `k`-regular subgraph of `G` is a subgraph that contains each node of `G` and a subset of the edges of `G` such that each node has degree `k`. Parameters ---------- G : NetworkX graph An undirected graph. k : int The degree of the `k`-factor. matching_weight: string, optional (default="weight") Edge attribute name corresponding to the edge weight. If not present, the edge is assumed to have weight 1. Used for finding the max-weighted perfect matching. Returns ------- NetworkX graph A `k`-factor of `G`. Examples -------- >>> G = nx.Graph([(1, 2), (2, 3), (3, 4), (4, 1)]) >>> KF = nx.k_factor(G, k=1) >>> KF.edges() EdgeView([(1, 2), (3, 4)]) References ---------- .. [1] "An algorithm for computing simple k-factors.", Meijer, Henk, Yurai Núñez-Rodríguez, and David Rappaport, Information processing letters, 2009. c32<"TF wrVS8xK R#5irr)rrr r's& r r k_factor..ts &XTQ1q5XrTFz/Graph contains a vertex with degree less than kg@c3P<"TFpS'dSMSFq!V3xK K R#5irr)ruvinneris_largeouters& r r r/s#VAu8T!Q8Ts &&)maxcardinalityweightz7Cannot find k-factor because no perfect matching existsc3^<"TF"qS9gK VRRR1,S9gKVxK$ R#5i)Nr)rems& r r r/s(N7aqjQttWA=M7s -- -)anyrrNetworkXUnfeasiblecopyrangeadd_edges_fromzipitemsadd_edge remove_nodeappendmax_weight_matchingis_perfect_matchingremove_edges_fromedgesadd_nodeset_adjremove_nodes_from)rr'matching_weightggadgetsnodericoreouter_nneighborattrscore_setr3r4r;r5s&f& @@@@r k_factorrXIsV s &QXX &sss &QXX &&&##$UVV AG  $%*&M2MqM2 ',VQZ!^'DE'D!1I'DDEE',QZVa'HI'H!1I'HDI(-fa&j(AB(A1AY(ABE UE*+*-eQW]]_*E &G&h JJw 2E 2+F VVV deT512+!0 qoNA ! !!Q ' '## E  N177NN%, eT5 4t9G#$66'?#8#8#:+JJt77$; EDL501%, HQ3EJBs- K3 K8 K=7 L)r!r)rX)r7) __doc__networkxrnetworkx.utilsr__all__ _dispatchabler!r)rXrr"r r^s;. 4"4"4JZ ,!,0Z \"d$?[ @#![ r"