h5SrSS/rSSKr\R"SSS9SSj5r\R"SS9S 5rSS jrS rS r S r Sr g)a Implementation of the Wright, Richmond, Odlyzko and McKay (WROM) algorithm for the enumeration of all non-isomorphic free trees of a given order. Rooted trees are represented by level sequences, i.e., lists in which the i-th element specifies the distance of vertex i to the root. nonisomorphic_treesnumber_of_nonisomorphic_treesNT)graphs returns_graphc#T# US:a[e[[US-S-55[[SUS-S-55-nUb_[U5nUbKUS:Xa[ U5v O,US:Xa&SSKnUR S[SS9 [U5v [U5nUbM^gg7f) aGenerates lists of nonisomorphic trees Parameters ---------- order : int order of the desired tree(s) create : one of {"graph", "matrix"} (default="graph") If ``"graph"`` is selected a list of ``Graph`` instances will be returned, if matrix is selected a list of adjacency matrices will be returned. .. deprecated:: 3.3 The `create` argument is deprecated and will be removed in NetworkX version 3.5. In the future, `nonisomorphic_trees` will yield graph instances by default. To generate adjacency matrices, call ``nx.to_numpy_array`` on the output, e.g.:: [nx.to_numpy_array(G) for G in nx.nonisomorphic_trees(N)] Yields ------ list A list of nonisomorphic trees, in one of two formats depending on the value of the `create` parameter: - ``create="graph"``: yields a list of `networkx.Graph` instances - ``create="matrix"``: yields a list of list-of-lists representing adjacency matrices Ngraphmatrixrz The 'create=matrix' argument of nonisomorphic_trees is deprecated and will be removed in version 3.5. Use ``nx.to_numpy_array`` to convert graphs to adjacency matrices, e.g.:: [nx.to_numpy_array(G) for G in nx.nonisomorphic_trees(N)])category stacklevel) ValueErrorlistrange _next_tree_layout_to_graphwarningswarnDeprecationWarning_layout_to_matrix_next_rooted_tree)ordercreatelayoutrs Y/var/www/html/env/lib/python3.13/site-packages/networkx/generators/nonisomorphic_trees.pyrrs> qy % Q' (4a%!)9I0J+K KF  F#   &v..8# W 0  (//&v.F+  s B"B(&B()rc8[S[U555$)zReturns the number of nonisomorphic trees Parameters ---------- order : int order of the desired tree(s) Returns ------- length : Number of nonisomorphic graphs for the given order References ---------- c3&# UHnSv M g7f)r N).0_s r 0number_of_nonisomorphic_trees..\s54Qq4s)sumr)rs rrrKs" 5-e45 55cUc%[U5S- nXS:XaUS-nXS:XaMUS:XagUS- nXXS- :waUS-nXXS- :waM[U5n[U[U55HnX4U- U-X4'M U$)z0One iteration of the Beyer-Hedetniemi algorithm.Nr r)lenrr) predecessorpqresultis rrr_s y  q n! FAn!Av AA .KNQ. . Q .KNQ. . + F 1c&k "q519% # Mr$c[U5up[U5n[U5nXC:nU(a?XC:Xa:[U5[U5:aSnO[U5[U5:XaX:aSnU(aU$[U5n[X5nXS:a5[U5up[U5n [ SU S-5n X[U 5*S&U$)zCOne iteration of the Wright, Richmond, Odlyzko and McKay algorithm.Frr N) _split_treemaxr&rr) candidateleftrest left_height rest_heightvalidr( new_candidatenew_leftnew_restnew_left_heightsuffixs rrrrsY'JDd)Kd)K  &E + t9s4y EY#d) # E  I))7 SnSn[[U55HnXS:XdM U(aUn OSnM Uc [U5n[SU5Vs/sH o0US- PM nnS/[U[U55Vs/sHo0UPM sn-nXE4$s snfs snf)zReturns a tuple of two layouts, one containing the left subtree of the root vertex, and one containing the original tree with the left subtree removed.FNr Tr)rr&)r one_foundmr+r0r1s rr-r-s I A 3v;  9>   y K#(A; /;a1IM;D / 3U1c&k%:;%:)%:; ;D < 0;s B?Bc\[[U55Vs/sHnS/[U5-PM nn/n[[U55H[nXnU(a<USnXnXd:a UR5 USnXnXd:aM S=X!U'X%U'URU5 M] U$s snf)zXCreate the adjacency matrix for the tree specified by the given layout (level sequence).rr )rr&popappend)rr+r*stacki_leveljj_levels rrrs*/s6{); <);AqcCK);F < E 3v; ) b AiG$ "I )$+, +FIaL69Q< Q  M=sB)c [R"5n/n[[U55H^nXnU(a?USnXnXd:a UR 5 USnXnXd:aM UR X55 UR U5 M` U$)zRCreate a NetworkX Graph for the tree specified by the given layout(level sequence)r>)nxGraphrr&r?add_edger@)rGrAr+rBrCrDs rrrs  A E 3v; ) b AiG$ "I )$ JJq  Q  Hr$)r )N) __doc____all__networkxrF _dispatchablerrrrr-rrrr$rrNsu !"A BT28/38/v66&&$N.( r$