+ jRtRR.t^RIHt^RIt]P !RRR7R4t]P !RR7R 4t]!R4R 4t ]!R4R 4t RR lt R t Rt RtR#)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_trees) lru_cacheNT)graphs returns_graphc#x"V^8d \R4hV^8XdR#V^8Xd\P!^4xR#\\ V^,^,44\\ ^V^,^,44,pVe,\ V4pVfK\ V4x\V4pK/R#5i)a|Generate nonisomorphic trees of specified `order`. Parameters ---------- order : int order of the desired tree(s) Yields ------ `networkx.Graph` instances A tree with `order` number of nodes that is not isomorphic to any other yielded tree. Raises ------ ValueError If `order` is negative. Examples -------- There are 11 unique (non-isomorphic) trees with 7 nodes. >>> n = 7 >>> nit_list = list(nx.nonisomorphic_trees(n)) >>> len(nit_list) == nx.number_of_nonisomorphic_trees(n) == 11 True All trees yielded by the generator have the specified order. >>> all(len(G) == n for G in nx.nonisomorphic_trees(n)) True Each tree is nonisomorphic to every other tree yielded by the generator. >>> seen = [] >>> for G in nx.nonisomorphic_trees(n): ... assert not any(nx.is_isomorphic(G, H) for H in seen) ... seen.append(G) See Also -------- number_of_nonisomorphic_trees order must be non-negativeN) ValueErrornx empty_graphlistrange _next_tree_layout_to_graph_next_rooted_tree)orderlayouts& h/home/luca/screen-checking/.venv/lib/python3.14/site-packages/networkx/generators/nonisomorphic_trees.pyrrsX qy566 z znnQ % Q' (4a%!)9I0J+K KF  F#  "6* *&v.F s BB:B:)rc<V^8d \R4h\V4#)aReturns the number of nonisomorphic trees of the specified `order`. Based on an algorithm by Alois P. Heinz in `OEIS entry A000055 `_. Complexity is ``O(n ** 3)``. Parameters ---------- order : int Order of the desired tree(s). Returns ------- int Number of nonisomorphic trees with `order` number of nodes. Raises ------ ValueError If `order` is negative. Examples -------- >>> nx.number_of_nonisomorphic_trees(10) 106 See Also -------- nonisomorphic_trees r)r _unlabeled_trees)rs&rrrPs"> qy566 E ""c^p\V^,4F+pV\V4\W, 4,, pK- V^,^8XdV\V^,4,p\V4V^,, #)z4Implements OEIS A000055 (number of unlabeled trees).r _rooted_trees)nvalueks& rrrtsh E 1q5\ q!M!%$8881uz qAv&&  eqj ((rcV^8dV#^p\^V4FSp\^V4F@pW#,^8XgKW\V4,\W, 4,, pKB KU W^, ,#)z;Implements OEIS A000081 (number of unlabeled rooted trees).r)rrjds& rrrsk 1u E 1a[q!Auz]1-- ae0DDD U rcNVf+\V4^, pW,^8Xd V^,pKV^8XdR#V^, pW,W,^, 8wd V^,pK%\V4p\V\V44FpW4V, V,,W4&K V#)z0One iteration of the Beyer-Hedetniemi algorithm.N)lenr r ) predecessorpqresultis&& rrrs y  q n! FAAv AA .KNQ. . Q + F 1c&k "q519% # Mrc\V4wr\V4p\V4pWC8pV'dDWC8Xd>\V4\V48dRpM!\V4\V48Xd W8dRpV'dV#\V4p\W4pW,^8d:\V4wr\V4p \ ^V ^,4p W\V 4)R%V#)zCOne iteration of the Wright, Richmond, Odlyzko and McKay algorithm.FN) _split_treemaxr!rr ) candidateleftrest left_height rest_heightvalidr# new_candidatenew_leftnew_restnew_left_heightsuffixs & rrrsY'JDd)Kd)K  &E + t9s4y EY#d) # E  I))7    y K#(A; /;a1IMM;D / 3U1c&k%:;%:))%:; ;D < 0;s B* B/cB\P!4p.p\\V44FopW,pV'dLVR,pW,pWd8d$VP 4VR,pW,pK)VP W54VP V4Kq V#)zRCreate a NetworkX Graph for the tree specified by the given layout(level sequence))r Graphr r!popadd_edgeappend)rGstackr&i_levelrj_levels& rrrs~  A E 3v; ) b AiG$ "I ) JJq  Q  Hr)N)__doc____all__ functoolsrnetworkxr _dispatchablerrrrrrr(rrrrHs !"A BT2;/3;/| # #F 4)) 4  &$N. r