ިsg5dZddgZddlZejddddZejdd Zdd Zd Zd Z d Z dZ y)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#LK|dkrttt|dzdzttd|dzdzz}|]t|}|L|dk(rt |n.|dk(r)ddl}|j dtdt|t|}|\yyw) a Generates 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 Z/var/www/html/venv/lib/python3.12/site-packages/networkx/generators/nonisomorphic_trees.pyrrs> qy % Q' (4a%!)9I0J+K KF  F#   &v..8# W 0  (//&v.F+  s BB$"B$)rc8tdt|DS)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 K|]}dyw)r N).0_s r z0number_of_nonisomorphic_trees..\s5Qq5s )sumr)rs rrrKs" 5-e45 55c|$t|dz }||dk(r|dz}||dk(r|dk(ry|dz }||||dz k7r|dz}||||dz k7rt|}t|t|D]}|||z |z||<|S)z0One iteration of the Beyer-Hedetniemi algorithm.Nr r)lenrr) predecessorpqresultis rrr_s y  q !n! FA!n!Av AA a.KNQ. . Q a.KNQ. . + F 1c&k "&1q519%q & Mr#ct|\}}t|}t|}||k\}|r=||k(r8t|t|kDrd}nt|t|k(r||kDrd}|r|St|}t||}||dkDr7t|\}} t|} t d| dz} | |t|  d|S)zGOne 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'JD$d)Kd)K ; &E  + t9s4y EY#d) #t E  I))Q7 Q ! y K#(A; /aF1IM /D / 3U1c&k%:;&); ;D $< 0;s B 4 BcPtt|Dcgc]}dgt|z}}g}tt|D]Y}||}|r?|d}||}||k\r |j|d}||}||k\r dx|||<|||<|j|[|Scc}w)z\Create the adjacency matrix for the tree specified by the given layout (level sequence).rr )rr%popappend)rr*r)stacki_leveljj_levels rrrs*/s6{); add_edger?)rGr@r*rArBrCs rrrs  A E 3v;  ) b AQiGW$ "I )W$ JJq!  Q  Hr#)r )N) __doc____all__networkxrE _dispatchablerrrrr,rrrr#rrMsy !"A BT28/38/v66&&$N.( r#