9i SrSSKrSSKJr /SQr\R S5r\"S5\R S55r\"S5\"S5\R "S S S 9S S j555r g) z5Functions for computing and verifying regular graphs.N)not_implemented_for) is_regular is_k_regulark_factorc^^^[U5S:Xa[R"S5e[RR U5nUR 5(d0UR U5m[U4SjUR 55$URU5mU4SjUR5nURU5mU4SjUR5n[U5=(a [U5$)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 rzGraph has no nodes.c32># UH upTU:Hv M g7fN).0_dd1s [/var/www/html/land-doc-ocr/venv/lib/python3.13/site-packages/networkx/algorithms/regular.py is_regular..&s0xtq27xc32># UH upTU:Hv M g7fr r )r r r d_ins rrr)s8KDAdaiKrc32># UH upTU:Hv M g7fr r )r r r d_outs rrr+s;ldauzlr) lennxNetworkXPointlessConceptutilsarbitrary_element is_directeddegreeall in_degree out_degree)Gn1 in_regular out_regularrrrs @@@rrr s0 1v{))*?@@  # #A &B ==?? XXb\0qxx000{{28AKK8  R ;all; :33{#33directedcB^[U4SjUR55$)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># UH upUT:Hv M g7fr r )r nr ks rris_k_regular..Fs+($!qAv(r)rr)r!r*s `rrr/s. +!((+ ++r% multigraphT)preserve_edge_attrs returns_graphcR^^ ^^^[U4SjUR55(a[R"S5eUR 5n/nURGH8upVTUS- :m[ U5Vs/sHouU4PM snmT(a&[ USU-T- 5Vs/sHouU4PM nn/m OG[ SU-SU-T-5Vs/sHouU4PM nn[ USU-5Vs/sHouU4PM snm UR [TT 55 [TX5R55Hun upUR"X40U D6 M UR U UU4SjU55 URU5 URUTUT 45 GM; [R"USUS9m[R"UT5(d[R"S5eURU4S jUR55 UHunmnm UR!U5 [#U5n THDn UR$U R5H upX;dM UR"XZ40U D6 MB MF UR'TU-T -5 M U$s snfs snfs snfs snf) 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># UH upUT:v M g7fr r )r r r r*s rrk_factor..ts &XTQ1q5Xrz/Graph contains a vertex with degree less than kg@c3P># UHnT(aTOTHo!U4v M M g7fr r )r uvinneris_largeouters rrr1s#VAu8T!Q8Ts#&T)maxcardinalityweightz7Cannot find k-factor because no perfect matching existsc3R># UHoT;dM USSS2T;dMUv M g7f)Nr )r ems rrr1s(N7aqjQttWA=M7s ' ' ')anyrrNetworkXUnfeasiblecopyrangeadd_edges_fromzipitemsadd_edge remove_nodeappendmax_weight_matchingis_perfect_matchingremove_edges_fromedgesadd_nodeset_adjremove_nodes_from)r!r*matching_weightggadgetsnodericoreouter_nneighborattrscore_setr6r7r>r8s ` @@@@rrrIsmV &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%, HQ3EJBs9 J$ J J- J$)r:) __doc__networkxrnetworkx.utilsr__all__ _dispatchablerrrr r%rr`s;. 4"4"4JZ ,!,0Z \"d$?[ @#![ r%