From fc42d6814efc9556384526646b937ea1ece0c5fc Mon Sep 17 00:00:00 2001
From: "github-actions[bot]" <github-actions[bot]@users.noreply.github.com>
Date: Tue, 28 May 2024 01:15:23 +0000
Subject: [PATCH] Deployed d2dc2fd with MkDocs version: 1.5.3

---
 404.html                                   |   46 +-
 assets/images/social/bigtree/dag/index.png |  Bin 38146 -> 0 bytes
 assets/images/social/demo/index.png        |  Bin 27466 -> 0 bytes
 assets/images/social/resources/index.png   |  Bin 25921 -> 0 bytes
 benchmarks/index.html                      |   46 +-
 bigtree/binarytree/construct/index.html    |   46 +-
 bigtree/binarytree/index.html              |   46 +-
 bigtree/dag/construct/index.html           |   46 +-
 bigtree/dag/export/index.html              |   46 +-
 bigtree/dag/index.html                     |   46 +-
 bigtree/node/basenode/index.html           |   46 +-
 bigtree/node/binarynode/index.html         |   46 +-
 bigtree/node/dagnode/index.html            |   46 +-
 bigtree/node/index.html                    |   46 +-
 bigtree/node/node/index.html               |   46 +-
 bigtree/tree/construct/index.html          | 1273 +++++++++--
 bigtree/tree/export/index.html             |  720 ++++--
 bigtree/tree/helper/index.html             |   46 +-
 bigtree/tree/index.html                    |   46 +-
 bigtree/tree/modify/index.html             |   46 +-
 bigtree/tree/search/index.html             |   46 +-
 bigtree/utils/index.html                   |   46 +-
 bigtree/utils/iterators/index.html         |   46 +-
 bigtree/utils/plot/index.html              |   46 +-
 bigtree/workflows/app_calendar/index.html  |   46 +-
 bigtree/workflows/app_todo/index.html      |   46 +-
 bigtree/workflows/index.html               |   46 +-
 binarytree/index.html                      |   46 +-
 changelog/index.html                       |  682 +++---
 contributing/index.html                    |   46 +-
 dag/index.html                             |   46 +-
 demo/binarytree/index.html                 |   46 +-
 demo/dag/index.html                        |   46 +-
 demo/index.html                            | 2313 --------------------
 demo/tree/index.html                       | 1190 +++++-----
 demo/workflow/index.html                   |   48 +-
 home/index.html                            |   48 +-
 index.html                                 |   48 +-
 install/index.html                         |   52 +-
 objects.inv                                |  Bin 1601 -> 1623 bytes
 others/index.html                          |   46 +-
 others/list_dir/index.html                 |   46 +-
 others/merging_trees/index.html            |   46 +-
 others/nodes/index.html                    |   46 +-
 others/remove_checks/index.html            |   46 +-
 others/weighted_trees/index.html           |   46 +-
 resources/articles/index.html              |   48 +-
 resources/index.html                       | 2313 --------------------
 search/search_index.json                   |    2 +-
 sitemap.xml                                |   94 +-
 sitemap.xml.gz                             |  Bin 476 -> 474 bytes
 tree/index.html                            |   53 +-
 52 files changed, 2912 insertions(+), 7490 deletions(-)
 delete mode 100644 assets/images/social/demo/index.png
 delete mode 100644 assets/images/social/resources/index.png
 delete mode 100644 demo/index.html
 delete mode 100644 resources/index.html

diff --git a/404.html b/404.html
index 145341bc..c79e0adf 100644
--- a/404.html
+++ b/404.html
@@ -241,7 +241,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="/bigtree/demo/" class="md-tabs__link">
+        <a href="/bigtree/demo/tree/" class="md-tabs__link">
           
   
     
@@ -822,10 +822,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -850,24 +846,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="/bigtree/demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -877,8 +865,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -980,10 +966,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1000,24 +982,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="/bigtree/resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1027,8 +1001,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/assets/images/social/bigtree/dag/index.png b/assets/images/social/bigtree/dag/index.png
index c747e0d57efc7305af9617d3539626eb18f56b60..e69de29bb2d1d6434b8b29ae775ad8c2e48c5391 100644
GIT binary patch
literal 0
HcmV?d00001

literal 38146
zcmeFZby$?$_dPtQh=71dNh{qU-AW2bN+XSQ=g=V~DUGDGba%HjNOueZ(n$Av#;3lY
zKi~g<b3I;O56*Dk_c{CQz4lsb&nJ0V2{aS}6bJ-@CizBG5dwKo3W3~ndh`(dMDCT_
zdk7?^S5ow~5;S>d!5OMKae;JDLecNG-=yC|KD6i-P5kJ|8#UzYLZ(?#OIio(dTD7?
zOWJ}^hN#b<Kl{BcKO+f0TXfTmJH8^HhJLReny8OzN!#efl5XCw>zSHTtuGmJiMUsC
ztARoG&+CigZ2f)Fe_r?X?u7*X{W1(gX87k_Q5;mI|NQ*TWJ2pdKPOW+_<tYxf2;KW
zLgSwU@&Erk*q1vZt$lyD8yb+?Jh$OeGvyVbVi~yRBrtA9aq;kLP7w~zNfp)c=b-Q9
z(5AmG!=rbvUkX>E2X^D{+_5x)1}UXy#ya!7#GI|tAUq2_EmZp`HhOsDsgpUDUR{KP
z?>ND&tl<|?{=+t-awJ%QqMS*)<j<D9vEue0ky=csDcm-C0*ULQSneHXt=@iuFH@vM
z_I;3eOql%8%YX`Y?h&zae6!6;&p$h<MPB~szmMPRM|rO-`{?Xo>*$(=R48PBPI2r-
zV7=sv74F6@%trUy2cFO^mgDNZC%vhRcerAwmi^l}n3$NO^6Pm{;!!0+iZ}N$_jdzX
zFyx?lDd~zd5J>RQUCX(~=oJsmSNUhREpG2OrWWRQWJ+4>12gYd%>^I=$0OSaDcW8e
zq{ky$4kN!#Hb=I<PHc~+kG%#DEIAgQSgjJn&ZTd^&NyCEgLZk;ke_Vhd~Gv;9uXj0
zBB5@NC6z>|Fg@;l9pH-1!SS`aNVz?dQljla98RSfpG{8TvuKfaH~u>p+vYG=(e<y8
zgVl4>M-KKq?*g6X>iI;C+WtI3q+=KcN*9bavy7XU#CEY+{xn*tT;eCA%yg7X!S-R+
zXPbG#G`|ip7j8{$-~7qA;{7T!zEbiHPJ+3)!}i*|1fG}q+inCY=-?x@TAE>FAG)~p
zpQjR$VyUT=J1sd~+n?$WJPHw&(WJk1`pHmjyj1O2^Nm!qV(f6X3KarTjYU}@(N=qc
zAL6ze{Z-{O+2zV`>)HDvx}K$y<O(s>PXpmo^zeY`M?E{}WTqPICYLm|QOL7cAPzY%
ze2(O}Ag&{j@Y(l{kPV+XG$}YE=OGcpKt~|{l<hYbjG|feN(TpBRc$J#jSs80e%RM`
zzZpP4z5<ca-hqlqqMbm9`H|EiWa+alF;Ytqbx-$$xY)JvDgE9dwCcTw_<3K`Nv=@s
zT=~!TxA7uZ@q%`x_j_z~?nsudc4O+!xi>g}6K)mF$dH9Bp9F(w{9c~pC%Wu~s!G<@
z*3Z7vJG^%}E1B0hA2eOu1Fi;Tr$vjP%3iViz;kO4BU_Yi38+8i+(fV#YWyVP?{eO?
zrViz_e4kd`(4&(_*V9s>(|J`>VxO3P-vHB@41vp>j@A0=>f0|zg=6`G!yo6rIJe+&
zh>1B9()(g%y3W0-gSv!(W0zay{m2P-TMtIwt<S?6V&Z3^s>Y1%UnU}8pT<YEDzxb|
zlMbuM-3~^YBao7rxapQ<uYX-loq^|X$5itbfA|1)!5YoVMfNa#kL24_<%*LfN3{p*
z&qB#e)@ROJw<jKEeTA0}{oZ4CR1X4Iz;R2!!w<2+klQ?YrT0z%9q%V>Uv((Gw2Y)m
zPH>5QU1y4U^-D+E>g+5vYrD|5rE1O83(u)3X(y}AzEDECQ}^=9M`MDnNU)E>hp<m<
zECLKq&9YJU=j(kp!aXN*ce_Rp)%e^W<OGO5Zy!UI^1p|}I9U5$JzUO??O>>=K)8c%
za3M7>IFaDss6yg!3Lh23z1ojA?)&Em>?X5UVal}Fwbp7c_Xy)ck=yhh*`N6-roZ}N
z&Q`3ftm~zRe(MIaOM9U1#XoLVC`aN?$=bp4L+IISt37ZkX{=4#XMR7m7?kaa8%P@2
zx{CWEcZAVCQ6+Z@EiSA>PPcB-x6uh0%Jb(F+#$#_+MMTk9}`$Nw-lH=i$9zb)**1%
z!8$)hs%?fB!^yR(CW&zC`IAUC9>=*$)XfF<1rt`v&xtUqEeK*-{>OMwCMDu|e>PjK
zlDg4&8SBqR$y3zU!NAnL!};z|LbVEOKK(}bgOf;@t*R2geq-axUY59+Ih$+@_UgXs
z@QO(d-mlwmP3M~%MklUzp+{#J(%l)GP*E3G^65chOI}8)L;_oo8VFxnEstF@Y`Wg0
zX76eCo%D^{&n5RHg8+V0?7P5!u-M*!xw&PvU92|$v(IjgW86_76$_JXQ>k~Q`4(!h
z_mZEVA8m=x6S6@sg#aNndf!ttE7jO?V3l=_FYAkjEf?;C%z&Un%0tqU#93mF^9b@t
zsg9gw{7)_}Qot%RJHw5>dxH(RWj8=bCFCfRLujE`f`F5`T##pQa5_j&wcDd6IK-qz
zlH|=8vcGNH_UZKaSD99AAT=kGhCjZZLQ~SKm|U(5{-!dpenQDC#M`I)o#`2k2xsPd
zrvtydeoY-*<sB{0??P*Ncvgxxq3$t`{km@xy`FF~H{<nsB6u`U@uayaIPiPEw59TN
z*m?x=(~h@Ct(V%%TUIwrund>(%(A;7+}1k$pFjH&Vj1b~Ht*IdDl?tGOB@>RLVG7n
zR{Ej0DQL5*Tq`sl1HLi3!gS5I7uwfXmtyc0Dj8OPELUY8VF_#8zvhp4EY~p=zSGuH
zth3{s7RPIS@BP97Sd7Cf)1%AA192!+&rujfg*s~)i5g?Y8BdmAB8T<rdh8ex%HTrb
z8voltC2#rXb_9G2C}`1g`+^S+nj<2$bj;&CLRik~7J702Y~lAPPk!6_j)=ysWA)dv
z5fig`VqJv9eBd+(stEX!rV0A0GA+66L(4KAhd5cZ=5!UXP*MnUr|yvUOdy}bjxPkF
zRGY+HTn+9PFkbZ5?8_tvO|3JuIg85?*qk883j0tiN+ea18i+w%SG-VFPV0Qew;Z)}
zB2ZDf{E<>w64*Bx`^E^}R0`Y56Z|}DSe@P0RTgITSzfRUF#K3PrPs%@bv<$Y$aUW2
zl9zJWH{gFhJfD4IbrcqfRcd<J^e|erDf<#>b+ai#-$D1_>s+E{V+8Z*LQ}Qe?|eS$
z?58C|8h-KJavcq*D#w!Aj=4%S2N5$NtV}fH%V&%(iv!_7ZS-t-=$Cn;*11Dng$E{?
zvqW#a3kcB{k60%0-)Q5%q@=hPs4C#g;w%?^#@If;;p99ixDM|g;;=V%Lr!`#Ef&xU
zMqsk{3Zh#I2y+6^lO47OrFTPHhSY*;HcGsw@Xj6~hMm;9P2ncfFtYRBrXcEcM|&9D
z>mP8}dVko>53?G2td1Walq(U+QAbKG9b)s91uyUlU(4<r4F(d5y)F3P*pCbXTd<vb
zI(Sop!_J#~6r~{lSZGwDyx99l{f?KXKnd#HhVt<fnthEit!e??CBLx=w|Qke*KLgr
z<$TJx@U9n!<Kt!_E2*>%;{b`35;i=7*zwJ^-5p;v=OW+e*bQH|yp%B4GI{#g^OG1J
zaYp<?MVf<!vgj**>t9FR(=Nv-Uwigtww6}C)|tA#c{fY;M6HXzFQgIisF`@r3nBn^
zHn#qy(c0k4)%>2!7ArL<!%>+HumFs6y(02n^KTtL^O>c+-abaha!p%Ys9%dbht6yj
zpZ|`dnm_v`As&zG!jNaoKf^5h0vkY^!>NAbQVx3J*rLH_d)pDDvI&dE=c}QmGyos8
zmpwhKXK4BIvS-=z&hsaO;6Sa<<tZn{72+~qCN&!O>T<701H!Xn=?4&LXRDa^TvEAH
zB6;!-6UweGTkjulb39fln1cO0qAvXvaw(1VvE!hCw!)19<yvdu;Kugd<@o4JXSX=T
zvB|Rlp^=HAVf(u;4Ua*75lA)P8(HSskkd7meW+1MobZe&AWbfD!kGI|j(Vu`>erOQ
z`1r`lJU!dq7TZ&n+-6)MUXKUHeZe3-h9f<F2S2}V7V$fH-fpnyQre@OtTfep&LUi9
zo!X;{>TQQ-gwK4J-lmLM|JYmtMKDEERbg&1SgGaJwNW1t#i_=Lt>kg3pzS2LwMG^3
z`R)bQbZpWm@Oe{&*XI{m>K-cD$)xzGRf@=Avedt<Stt9E&N``2W=_Fs94-;Yf9*+G
zn=`M#gVECpNazcKG*v=8^YNifgILLZ?~7qekt`y6IC$boB*Zk>W>Om*UG*h7N#73+
zX3J};!(^Q<bKuyUX+oqN45P8MYQOJRv(gF<eczZSNC#M0YWJG$ma!U>Jgc@3cW2Fr
zXa>3fh9ECeO<$9U`r(JA22$W--1oQL8*Yb}Rj67K))Pv460#2kwaU8JP<_f0`Pk2Y
zeHkvJJ)%M(BwWr?YFGaGz)O|Oox|~M+HQ;6HRRUy;_Vb{djf}BF*#z}Jk2+0EIxMu
zz|q467*f3zFR1I390WAe`{{c;Pd_NVDs5XD&0o+gEt&f~8#-&|uJZZg5r%tq590KK
zWEizXXxs1*5u%Op@x=7k&m@){CbO(=b8a*yg-8&?$%$npb<BJX&4Ys83O9=e2F|uE
z<U)?C>Jyq<kE(nk5SG(b*KLAxw=1i(?suJS#XVg4^dP;4{JDZtGgEQU@v*QTEM+Z_
zV~8+CJK{r{MSENOeDOxHvg$H`bj3o)N)ed0#dOq<j}AME67xOh2)}oJJ`g0|8B&c|
z4I_-NC#f;7g6?e^tEGJYVGxs4A?088I{mznTjxh}*oQs)xhLi%e>P0oPLU3CW0&nb
z09{|sQ)OyOR*G_6tUGaj9UyWGbvtI2o!QW>NnFEm6@!J_6!?vk?C*w!QD1e?`rUiH
za9-o!u#ABxd*af3hN9h_fHmqYI#IP1OwwB*%iBak9hPur&V;cu6Ck9`9|k&z&12U}
z^Qv#w)*VrsdN#@@jcRM0<M<3elHcisMA*9)>#t`!bx&KJgbsiW`8DeNp=ELJ6Y1hc
zod+V1fYkw?awR)VbtC-D#Z$Q^k{cC`;_;$f%Vcch)*i?G4VlK8eO)ci1_2ij)rqUd
zG-cT1n^b0{n2gcZzVKTnop7g$ZkKmsle6TJKYkg>P)a3UdIn?Z>awSnaT+iBt&+C<
zI<#)j;kvSz`exd*JG&(~j8v!YsZ3~}HW#3Flz;^QuzFO5B8OoP2B+Dq+v9b3ei=tl
zLC0ogWPfTssJU2`Fqxjgf4w$<*?VZHlhFF|z6g0y*0oPK`r}_m^FzsxB|To&+<$0A
zhM=qXMlEgQ^rx{%E?4qAD?6{gLk+Lcy47&h<0c5l2|+B!i`xC+BU5dav<=?f%~&;r
zz43{yLM;x#Z`N)%I4p%$mal(Ym5~4Z=;e6hc3eSxvp1IrAi2qy*%klN=<uU&bobLf
zJKV)|O>W4DNmuyXewy%)>XWw{o}N|60cD)AFYYfS7Nb(Keb!W*S*NBD;2Xd!q??9C
zVle49+E?32!X|TT_v^6}#(|(iDYTq4S=i)ZfOrdcfs&20VrE_DK6}OOGXepdiku%=
z&FUJJ#!Gsoa$(Oxavz|KI^Wg7PZj>G+`ec?I<Fl5L-7FzI!i0zXz?)vx(tmxQGl!L
zw#?DO3u!r7o@Pg<kMe{Ik6PaQB9OwB;X6NXYwiAYU80+8Lg<O!Uh09JQ<+qh+4FV5
znoj^f5~(MtghZ`(3sz|nj~avESkGq&4(GZOOeJN*&y@-(<=`XMXd)RVUI?UpvAtrw
z=61PvXeh*eum3SSZ%SLQVbk^twC<79lU)x9)$gA+hfRW<Ysg0atbfsyDK|s8eN#*C
z6->5;Dw8WJ0lv9I7MAwTkvBQ%-Kj%_2DCUR*A_qCt_hwxHVPUe12CoQ=k)|s0gKee
zdjnop@KE8YzwI;OehLoojlWJ@%p)7eju`pF-@G3c=&;Y{3LEMLl?Dq7+DeAgJ`>5E
zww*e^MhE@kDQ)fJ;}luWXCh*4T84sLs)l~*UNH+QeQcnxJO$Mt^5Ijprre{6s+yCT
zZpY8}J_h7aO?r*We)M_ZGe3-piSp4)@?%B(k$5KnF3Y)C#_dgMrnb8pjI)&*<aA}~
z0d>Qc@LVl%c3MRLa7lzG3iPt?iy8J^`B}Liw^@<k&ZznY;%TSy)@&b|PYuBoKYUq(
zMhSTyTRzkyN%cq_+jMB>nuvX9R{z~2$h6K!kd$Gd%lIJ*&)J5dX=K-IMNH2-@e_Q+
zv7CuhT3xNhALG=VR^Gx}k*V4q;#r%AKgT=!CYyVDMlQI<r~6$D3O}$SL!nTOhz$o<
zfm@qHY<Ro6b2(eQ-M^w7q3Z-)LVV6JIKROO)-*D+Kfj=@BJgZk$UZ*t!$Y4J)KaJl
z$6Znj3yz+fc~f3>*s&z84soHo?kXic-lU)DAT-#{g3!HdoxIv3xor96x9YYLSIZ5s
zOQvfBSqwB%pSx_Gu4Z2%(7!Kl7)R*OMO{&LMPIY}e0cayg#3!%Sz35EUpn>!)Z{#f
zWVk3)rn3aCaFG&kqhI>Ka4UgixUOIVdeJVaUTKUxs=atV>i5ed^^OI`Yc{9h#_wET
zSUW7{W;(#~kzV><tCoVtMxag}gG52~eTYqSBX+<3Q&)E{yEok6nJ1}bi<DNI{GCN6
zEDaS@v>3IyU7kQjinsYrMtZssQ667sP)eNIEC#7XC(Lft!80mpGQZ)+#b-u)_DSGO
zn9!Vq>%QE|KLik$g^~RpLa~(=8^V0@IMs0R`AHp27;%u%(%9<Z{Dj#&4o-x;^HD^n
zA_&Hb7#?_C1bBeY{-sT0)|0W0%f(DWEV<v^Aj|K`z1cfT1|?)aEak_>1z=v<cL_C^
zJQd$S(;}a>rVN~|eGYm(H+~i!%%a-1wcrBaglp2%r#^VyGP_*eV%hD|uw49PSwqk-
zF@nR4wC`Cf*ObLsG^v|0I+AbEZ-50LU(WCmz)9!nKAqFK7dq8?CZeO{9b-@Qm%DU7
z%-g^_qpJW)=NswYS9YRl>5<H!`n^Tob<?K2LVP~iUo(8PPUVQ3Ha|@GY6sw#25W`O
zBOFSP)OU~rM<<T$KUMF~8hztd)%HC>a?(HU=K6fO(!#nL;<cZn!%=5hrKtT=4DdI4
zpwK<5I7D;b-V_AYJi&t$;Ji}a7l;rzxZIG=rR<4rw0#igU9-+8k+1W-+HgTw*&Ow$
z$IW5K;TVe`P33Sk>3lQO{Ov`s;`@Atj)d0FsaGj2M1UljPIkcxOLY1hZ|Z3q?tHc6
zG-V&zbnwV&xN+&ecMaQeaoBVKbU>8*3tE%H9=Dp3m9nfzfmAO5KnEg1yUeGUo;Ova
z3=*KV^YgRv@e>SZg^7T^5Lc|npm!)tARr;JK_IVPfS;9|0i`viUNDkGyOy389rWm|
zYOk(xjRm=&kC~O@R^$~()}0#iR3X!K795@~d(Q-W2SqEyKOVN}op)ua2kmnp7RVHI
z0e)=P)x9taf=A!S!nxUR-#OKVlUCx2EyVBmY@<(l88iZ2tcT}^e)t}jV>e?7`IETV
zTpVPLQ`ntnxQk)?#6sTm%0EH=?!Nx6*2wNz-xa`<^zr>rl26bzBSC)P834|<%^BG0
zI?2WcAB7JpK2@;rmRd7%zB{#K0Hqh+Fp0=WOCV|RHWP&{F1MbP^(7`9oY8L_-0p5e
z^>&opjRz<ynBE>=C-lM>*iwTLY~zZ!BPHNV!C`i1^`UG9>{tjacctra?BV?0TXj}I
z9!bvjgn$ls49DD+KUakg@LZ-))6X}j8yd=D5q?Mzc+ep=e}8#*evEnD=Vux$#BKZN
zh}__+aJiI)4jnaf^)f68ha`-+U&Y{X2yJuZ7sF&Kb^(@R=umr0yeC=<p>F=Hy@XH)
z;JiADG=0qFs@Oca97({RMQ_Wyoq-J+E3=)$`8(pJh#P02aRaku8yznTZTEd|%MVji
zs|%U}LK8EQ_Jm-Ew-4Vp)-Vfd*e!Wm_C^v7CAB@fs)2rGK?-qW<l+~k!Tu7#9|C|{
zEiccB<~;GM2zwcaC9(mJKa~jWgPo?*_ow-qng{K@9{~&`wI0wksy6jExF=Fd!%M<v
z_i`kEx3%Gysy|Ala|HFpDz-42`FJG^z<<iAC$rIMVX90?&Pwff11#8%&jE^8JM9&Z
z;XGs9;!n8mU*{3^5EM?uW5})D#p6lhX`W>#)q=jVy;j*uRHLIMnHDn^R;OATjA7Cx
zW{2>J$}0V?Vi}Juw41{prkSe!mEF0RimERj?7$jXPpuED%<(RX(SGi4aq9j?fwa$G
z;hxrXI=22*05H+e8h*blJB~*CZvKr;Gf6HdeE0G)vrx00jiJ6LnjhrtEPxfK6KoAy
zEv1r@N}(GM-{;Yh+BCGeZ%iA*GquUdO)kyLZL`O?dz@<%1skPH?FDq80QO9WS?d}X
z+v0D}2k;gyR^YS<c(v2*ewp(RR%Ez7zkj_{cH?2jj9<=kM78d9jquW}0BNCGGP4as
zmZZJ@hVM#7vB~a&VRC1|$cD0ZQ8pGwuY1zjHnV=e{hqob2O!nvyd@a~yoI!Q8BH|`
zt9ozXk6Q+Q!F9w^Pgk%{JVLXQdVmmq0!(PAwbDph3+eCu8y&F$B+8k`Wn^3IWHz9Z
z$CRtdDvHHxnH<lcQPi?8*njNK(zzcUc|fUe=$aFG;ic;dzzPAUobY}GmOOXfGja5d
zt)uaSz}{QR`2^ehAf`HezpMGVLDNM_L|kQXKpJZYXT1aTqdQo0v!l*p%we*DlxY^7
zY~<Z~y9Y|42N=GA(F9eyMQ=*-y1}AEUp=0eTrQfg!Uu75FmiyIKui**W=(otSDUUd
z7XD*hJei)kYiR!Q&b7WtF2`JSzDTZ!r5pWAGjp5z!bgCcx2>#wRhwc!iTLJXSqJng
zzOlBS5{RDq=yEx8(<^_ouxu+zl-i;H-loY_@+>xCHpT@DzWYq3*m2$H9pAilAJo@p
zg4?%!cOOul2JgCM+!L2-T3wve){OK!1Mj+PB;-1^6b^$9fBQ(~y)w1O3djBlt1{oP
ztuK7$l`N=pZd{F6m&_FaGSNEMxWVtZ8u)XlMRVVS`3f)ZuLeAn;VV{&g>{4yp6`cA
zKf`|#y3zA?uPm)=v|~A4<?PK{jo-Ywf0f^$fPf>MZ0P9$iG^BazQiYNT0pcge8La#
zdM|*nJd`0~kH)}aXu;nL7nKu9{pRvK=%-Hec8}m^^2Yxi=N14s@R#IaJU;5d?r8K|
zGg#_^=7H^yCELk&*IPbo{N|{avujRHKR@VSP$xkk(ZcPvzndL}tGYn!U)!LhKc<B=
z0@^0WU;MOT5KtZrEb<ALqLPt_ZsPDXDk^HIEhOZIJyFC+Rl~+agYC&w4Dmirq+7YH
zU4Th?CbUMSgR0%t(J^*#(G;;-1^6yn3Zfx89LV#|h5N%{sX+_$Bs=f+cr&XBdZasZ
ztN*%V%o!<95rM@9%lBa$K7RFXWTR805c#RafYAE3?aEU;x!)ZGYA@M1*zdI@^Ake8
z0)FW2EH{5NCpy446Hb)nu47v#=j)>$454rTx=*K#repJSjaeu+ZFWS30_4phYU>wf
zl-i}@qVAmoliouLW+ER-Hdld>Z>E6ZyNyzX9PDPM=~;VLXV;7U^*an%RrC8I)m07b
z_>cv4!oT(vm2l9euK6P~eBn`6@yjD^`Y0eyl?i%~GLxP_=*boj>RBkjQQ-CcB|yud
zcC*!`us9DFm-JH<dM^lo&%S%~VN*p0CvIon`%{}9ob89VD1e8&Ew=gwS~7KMEGDHG
zeN89c({<xanSv_EczC-4UT^ioG1Z!xn6z}JY6w#o;DLaOrS{UPy77T=zcgS1;h-G6
zLJD4XNck;D@0&QReiV2}w;)p8MeFz16N#=p;dQ7lE>T7~jFA9GAManI!T0rREiD<V
z%=EbolT@=RNw7X|b^qR+$U(HDQ?|OWA34mZHAr=JN!W6~+aKWmvvn~Vd7YcBy3upJ
z#dqaT+(Y9d{`b=|+2@F4qdiM&PF9mjjvkEJO?&_I+hvMm->|wMwu0(2e@TY$b1$pg
zMyKq73b;Sg|L)J|`u+PdCYP+<-S@?G5@P)+1S-gao`C6yBLdO!-`xz<h|7q^=$7|>
z7PwF!@j5&KQT#1dpEd$qROr7)k_knB+<jy~oir~C8o?BvFIo}t-RNv!djtP9VwCgh
z;Hh3aFWLdIRK{xC#8%L1Lg^j^aQOflN!juD0_N%Obv0DplQnB(^Fr)K@=wfe^3rOV
z=D4v|c7N)gtVIFJ3eU{Hz7KYX2etJpMHl^LWSpZ6yIMd(q^@($xq}m_{2yXKtHk`@
zQ`1pB3|u+kk!BfsOI`w5KEsnsSDr(Fs1XrIu=>1+f=M?2XAcQMv9s^tl8|Wy47hJD
zzL~Zoueyex%oi>M2%Z1EB|<(iaLa`M-ZJ`Ek=zPLJXd*eHZVH3^k~7=v4J=+FxxDi
z+kr}rk)c(9Xp?&y`{wX;@sPs$-?iiMhLY-lWWMEExOw8?pRvK#)Z%4K*kL(USw+^8
z-n?xK)DO^qBS2hlQn>MAvB1t@{`?gdiSQbpn-vh+Z0yV5Zmq!6Xk{$~vYhACJxo0q
z1@^J$pM8wHf8HPJKeCOaBVFQ5X5MPqa(?F@jda)(lG~8#1%#b>9O5MdzU)^GIrWOl
z;c3aYjoXLLJ+k8YUSHwO=D#aQ<SmuH>GdcU8T5wexa*Dr=#FQtF(W~IR~0_9)hhg+
z%UI)8H3$%(4<b)AZxPF#zBb)PfAUvsN4hV7baAp3T-*Z+;>yOVS#&c1*U+tl+*)}B
z6v%-hA56zSu603@kv4S)>EERtF9AZd$+pU-yFyLg$H~(hETpo!xqKh5l)5LNE&%+0
zqx-Lu=d!BidBe6jUMz||S%&40h^15^pO*K6V<+cVu$*Oj+D!0vkN=!PkMpf8+j@Uw
z6!(x{fBd`*vp(@`^xVA%gnyeU7+^aOl4$MW7tjMj>|d{!n-(s}0P)t73`c}kxgMUP
z;d31nWnKYNb^=|s8?C2hoq@HUbOF}uY5ULmW8znqJkRZcHDs(7*53iT-5qw+1iB0e
z1PB{T&v+I$Gj^N62Uvan&XuAbU}3n`66Q|02Ntlfd^-wf1D|kVTpLW1LGx1(AV7JK
z*jw@u5p#)J{hyD`gB1=-?EACA%iF7F6M{52DEtWt!9~)0BA=7^AYUu%kl}WV(=}s^
zr<Q;5y?>v&@t&1ce!vH6Md0;3u29#(74KS!{($iuq*I9e++;A)nbkI1*XT5~{J)d0
zK<d^IW@D$!qvr&zM030U76rLy4+ld(A%Yb0wYdq+{LHfFSGm6AANuX@70e(3bgWJO
zaet@0#;eZ^PlZfxU&ATs)kY5l2&jc>4c2@>Uk9zi|JhepxD(-bTuyNhfc(H~VKJS_
z4A+Y?yUt!r58j7-29#w9(e(q%g&e-%&S;PSBEof3&_f<U_Y>N-4*p9{ng`Z{I_So+
zC=j?f(<12n9vtJe=pw#Xf3HFgJ)9KFAr7`8&*p8}axdOK#M5!Kn!T|NlnuOD2+l;R
zb9vr5ct3kkMqqZ6xI~d=c|9v2DcVsHP1+z}#Td(YHTzv40;Ht{`ZOd1#wx&|sQ5pL
zV%c2cR9DUu*P9tju{B;Y2gpDnyQ#}RV6r~PvJ;k!3C$;3n?Nb+EgN!DmO|v87y{C@
zXuj8T03-B`pxCR7YSvqB2D!^`Yz6<SYF+S_g}i{or=YLa0bYo>{yVU*0Jp(NOl)Lb
z1JItMd5FSXTsktqzuYQ{-d;K_kC?02i~=O|Jbu#@21&E?mKid@wYGuxLA08SuPrs{
zhhlJGMM<g$7PH)-4(SyB6QOI6H3j{qTmZ=6&7Duv91ASd`A}h!v0|URmkR>&WA^sp
zK2x%2*sGWM&i|9#ZGn7jdzV@Swb|#yW}i%|+O-ZPiqI4Egm^aw@HV<_=YyO>{qG}u
zH{<-U*tui5zw*Ymd1m(5$q6n>Zn<7xo}dbk(YgVs#q!TxiK@hcIKTl6ef5q*Mb*W@
z0Vb$v_aO86dF?*!?*UHvFLWa(fKYJw-I%Ym=Pf<tvc6VdM&E1-hGC_{^%pGpJ6y{@
zt)rt&?k;`O<WM#;-EZ?#;-=lt;zh^(Nzmk)kq*lKt;!!r0dR^@pJw90_{svHePyi7
z9dsWlUf)B2d>E7g(Mv{@wnM0EC-nXLzao>wtMT6ZZn4qOj?XOnX+=k7i$zV=D{fC&
z(a_$T=STk;6fO47@MM7@YGTa^Y?q^lM|I(J7BmXuzg1fQO|Vreuu<K+3yO)~WeBgz
z7e@}0y^%NJ)ECRvet+Mgp`JlETJ&7d!GZAC0+0<Fv+-jY_5J4?dZOL`Tg7r4KmY(`
zgsN%<&<RhRF(9wNiNNvQbp+k$e<#Z@y*wLV-LZ<QDqV@@$@11i$jJR~Ryc${69Aii
z{I~E&Aqsc{QZst)(9UV^vR+}#3LJ?0|E6~eLbTmg<lM#N*!<!W4&D@-#(K^F{dZX@
z|6a?@<ICcbSd_z4cwhN{ZWU8E00)x9$F8N*z{7*wQ{xaq?ec$au}wW&I5fVdcNf$p
zM~_|D4jGZo+$86@xS{gDB{-4+Zk3qqpUUC{I8&*5Ufo5$NU42E%tEXUuyF8&IPn>X
z`0s)IXI4g|a;_a!K~@ZAekw0GRQ$*ROIjE7(is^5(AND|U<_B<I+dd5fEXnKP7~z$
z_<{)Zfy!$Gj|kcz3XK15VGwS}N<J`&o~u*Q8m$V}jnaW6$LQxpm@DJF_m>a&KQZHG
z+U@{2f2tb$jI7e_ZQyNbKctpMMOq3f4FC5Y%kzL@3rnqCp{f}xo>&z%RhWY1rDIY7
z{^h^L<HQ0$Le+=~7-LxKiU>JkftL#r0vvIjo8G$V=i3vpZ|=zcK=gmk0y4-Ki&~}k
zShWR>OsxTV$<9j*(N%%60|ne4#@8G~?egEV7Y_BzAd=2IVyugHCS*4`72zhaSvv|e
zTdS4Jy91m!_=Rim2i{8|YE5VFzvD9?PE^OMk;fX}$WQD`(O^f{MXic5It0XPJ7|x~
z&NKMmmlU&TdVO#FcR|Won~L~!DS=c*A|usNk~{D^p&?g&&hw<Nt{8T%tDk>x+@@NR
zO8Bw`$*uFBiX0i67b^v7?8tq2h<y9;y>*Qy_c3N|Gh-lI^Z?A;Ibd@XR=?$tU--!F
zcLfAuB`bSwwq=rj9-S>Vos?#I>KS?Q?>ZV%>PX^;IrfrcE^h^>6yXA?O%{ccOrYtl
z72kXZR@p~v5$lo4%>1hCZCl_-XdEA++SeR4M|@qS_z9xQ_4w?h=NRbWAwg}xh8TTj
z5Jb|-JWR4px9E9SYM6D77~GY1^)hws)4!Wb4{yb;4Nl2Is_uqoLeeKrgixf@A<Y*T
zf{iXmzf*c3aJvlc3rwRKuQQ@JsdT>(sSj~ZNJqA(mhOqp#>cS@(F9ART*@?_ZlE=C
z$CUfs_3z5~yL_8C-<$5mT?j1bLw@$$IBWEmO?l<FZCgNV<^+fXd}cZ7sjdjTea&9K
zbyausfir}BQ0V*SIp{eWZGJy7*O@`c{<os8ZFVF2lTFS|<#^O;D2LBgDQiUl=faF5
zpp&%uT^`|AO+dV9<gBl4t{uwG-vu_TN-qAlxuw6-BaLXrtP%mSC4kbz92{PwXZ`l<
zcGvv;>?A}h!b`}KM0j2xG~A2%hTwLLF?H=f>o+PP{u7IBCS9G^vQty3X2t`L*zU}{
zC+$Fww{-5VGd11<_N<JGbz<|J?L!y5;Z5c>kx;uIa(Q6u)D|=HNE8Z%=Z_E4Y(U8+
z%Wa+n4pK6DjVCyP!z#r%!93cELHL?WRq_!*-=9uW<g9iy>|q990DB-%*TsI^o(p~q
z3ZMhZchX)<Rvji_XX{BKkRQK3eol|ur|jgx2*{}b0GlDsQ6Ifhn_D-}3+o9A7iya5
zQ+Ggq9H;E=M`}soMZ%!S63*V_t37cSqt)hh`6e-$3XaS7XYOgQMMbny!lEgG*Tj{=
z0syudcd1P53$zopDmT>fmh)xukqP2`#`mTUzAP>2Bn5&u-@xxi%6;+_qAT_00TcfL
zPN58u-hm7yBoySI)L8RF-{q(*0EO5q4?P}YV%p@D59C}eMaNH^R4JynwtwR$JQYs_
z8hqh&6*B1O5g?#byS84D3VmtkY9wyS5w}0<SD*s`7)S$8*4D!T8%r2lrUHQiz8rW;
z4KKn$GZ47|yLwEP!FPH__ti=U*foi0hxT2GU_T8Uen>FM#^CCY4xwrF(gPH4J){}X
zC61f1A8P!&&(jtq9RZlQYA;5{j4UgZ=X~m`Ie||$y|@XjOC}7sw8HyiKfwPQs3+L8
zaA0-Qn^$^JSBKhlZQ6a$Vz|z-LJ$j6y}$q621>*ub>OSxG@363+qZ+dWc&nk!L}>|
z8)Q;TMeZ9{N6PXoGXU}*hxi6+Se|&kIRVa#!|TJFZ|2tbA<%CVQ2RwYz)9;XT@!LK
ztz5v6<nP4zX8>*~>;!%XRp(q1Y1iUV>7C1ZU>KY$A1ebIXkhT~k@PY3BI|-c{4<Fq
zt-^Q=cuVS_UWVu@DoTL?OpXy0*~mQtsr<pn3>nM^U=K#&$|(S<L=CEiWv;t<_Ynmo
zycok-t;VB@V%fP?v!eqKfp(}h>|g7)oN_^5`aLL86_CQv!?hQU_S^ZC4U#JDw0<u!
zSND93e{}0D^;OZhUGu=LC@XUG*$46kn7cn2X*nl^Mh2Q*kVVCVF6GI}3MEmEygpH6
z<_dhLQbD@_)0tvY^Juw3DQ{>#Rpc{p{dOYZ^9j)Ga5H8?_0JUGGO&G}K3!wC`?a@V
z@9?cQ4|;fO)C&;*joh9Dse}TUcXgh~UbRpZF&Q-6nfQk2W4%lg*&(AHWX#BG;K8J%
zmCci1E(3-lV2Lr>!;JL!bMfX>Ax}tT>LPFj>c-ySaB-}<i<wTrfQ2F`>U_mF``586
zu-ta<GbisTRG>oOglkJ0Ck7zX?st17rui@FaQhFtfo{U!o^&^`P(iJZMcpYK*_)k#
z6UFf+W9Cd@VfJ2_EK-%CJBzlubo9)Xh)4%$f4fO@2JwO~7W|{n+j>QCw=flSfE}ck
z&$D*z+!2&+_z8(b7$hbroT))88K^~-%L=bPzXkD|QC$SgGvKro$mtQibu>o>9N~%(
z7t^YV?dynr%JcITu6OIYCy<k3xC$VtO?7L3^E5mb`?!I427vb+@Az4KU?cRMK&FMR
zE;9iu=9ePNBJBvk%>ure96J{&VU&t2u$qb$r<m>+bF^eLLIN(qC#-CLqaB>TmW`|<
zk)6Q(WP}M2w%tJTGjRC&Q{};Y(%sMF*V)28{tC9ZbMZmJaYo6s%-z5Wu`|>!42LEA
zSM{~4UoZ_0o66ojE;iI${NY#elX5yT+D8tpGa3f$`{8iis|zWuwNEQ)Fj4t-F1DiG
znt{t`{*^kL5I!YY52fR!ZUm>IIA~`@NZ<$S#QNR3%+A1ID{!UGW5xSPzR&|815RJ(
zGmDobzSPLqD%fSkVFuP^(9p~5R2}j<@K&1e$xlrN0N&bgVq#fJnP(_29{g3;X6^x?
z>m<5d7nitfE0Ac|olWFN)FOVYQyET8EQ4NjC^jB$%<1FNaDD^scL*@xs}&7XtC7P_
z%RrkjGPQR*wY&!Pf`r2^y9oGT;97*y3>Ri35#_~0UAs56y}SItUA_^%Cn7Boi0>+9
zm<G?~Cc2=Lnoji~oU5?z5X%+@{j__E)=Ht`>pb~a;6DV1tIPfk?1#5V&2L?SVg9qS
z>R46D)}#tNSza=$P>g5h4)rv(2yMcw7=N8OlQ?fWnEWu2FEJId)FdRBox9u_e!@jf
z4IoaZD!QjHJh@dZT^L*N^Du#+_zcQ%5^hoZSfEfBNI74!2dTlEfM3qtW9=NFrU4j6
zuFl;36g}yrMA0ogf`4U}Kw9T!5YM`)VK;MA13yS2n^wVTCWBR)R?%2kyn4Y<5v2OT
z+&+TV-%e>nZTOeB;S(%1Cn<0U0ZI0GN<MHH#qO<@T;|vcVcLF|m$i2L7!V(vpzHwK
zEEg)JmscSg_lLlZULcQps|+`CVe&9#3+o-f!88Epx%UAsnhU&0iHhdv-|G)0VBa;F
zGDGtmR?qeY0EEu}V$w~X7JItV1SiMy7#+}o;F&^jK0wzGa*a$wg1(b5h6aoH1;)?J
zCIP3p3A6PY*Fm%>S@ZC7fJgIypC_~Dbieg<XYRfg*3P;Q)LIA5KQw-S#t=^O5HD8h
zx1fjC`!f5P`)~o7-IP6Q?ggki0}72zeBcQ5M2W8g_fk@o798DXq>BQo>M;kHXy68P
zbc+^Gh?|r3>+eZkU2yg;BU{}r2~ebPE!Jp<5_5E94YuR!wi=k!q-9Ut^#{HN5Kxs`
z6oOjR(qe-mx!)3gmn~fq`Fnm-@)_1M{q9suOf&)Wr|(wsU*0XRfqpjupX9@-(;q@Q
z0EMd5Far$CMC>m4>=Vr~o0`f4&#l+67D_h0xdr$n$GV2c$mgDD3C+Skh7mG}9zfzB
z0e2<P!4GP_I3xGSK1S~VHlf$sHZ$}fj0%HfI)kT0Ls3!0{BrU5lgEM4O9U|DL-Fye
zK-IGW12q;`Z-1k;j*mP7Z|X{Ded1T^);iUN*gOPuh#YjZt=YNHnmQqc^&0RbaTq21
z2Yi#h#ex0&_+>=_@Q>jSNWD5;uAa9}pn*&d-0UMiMtyR^ov=AL$x71E;|u!WGbw=~
zzenfW>dj7}=rjOmpm%5~*ghjA3NT!PJZNa>klwwAxW~X9IVT?ox*cw%n2?mZFMz%;
zQ}_C*Ut1yshAY$xZzhm?0YqymFHrq%?q_*WJBJ$~1fax?!t#WUebK6R)XhDcqx4*V
zn2JYzmql;p-GEkbNlrLsINx6|4JTMVIw2Tizg~i79Y}Ds#%FP_YwQ*2(p^rGge{pD
z>k!<IDjG=W0biEHi7xbo`#x~r-0yCN{(hp}Y@=x6)g<QXx-yy-sg{%w9Es2tHTxa-
zg@8XFdUJ`0&B>WCPD%@R(L?)a0H*R8_4(l$pkj%1`g3C$OhN$0htt8gKk?4?(w$$(
zs65L<I#OHHf9>q<LtORF3DJQPA8e-57D{DFwA$nm7H&RfRtA(!PtQ}hI9i{o^Ec?+
z`WR#W`8~XNgQA)^Iv3B$_2T=WmWktx<CXL3!f}COy|Id2t+<7btI%FJRtXm;7##si
zN=-DC0%jAG<=l~md_%s0VHdJnue+E=9UdZQ5rzxFR)SqZ>EfO=5Xhk&m})Oib`8?>
z^puDIh3&VR6DXz+;3Cja)xR0XZEUa3o;ZRW%*j-bbVOzl7Q8#MO|j1fm`djGw18ak
zP!7`%Z<b~CZh+Z09N1KRoySU619QUx+t8cE83s4elFB56gE#soMVopp0`o{=sB~vv
zt>}DVUMF0?4Nrc|cA}KJb3p{3odMGX7{GJZUdBX+Ln0~Fk=Utpy?%{+y*1Bj;_%}x
zZYL5z(@aTnfBnT44>X{DvMhby#)9ytzU<3EX5i5x=QN!E9Mh@+@Ppkwb3LVG8_;@i
z8ZE|D3h@x1r3b;E`a5gs!??E`rtAPV=}DF?kqC@7rj)(ZF~)<u3Ti+?FL9mTT*HAl
zY<3DED?`pFzkT}d3M8@hZ^%^CO!f9Ec?T2YthFZxW6*iuDo1ZV<j^DxA^#0=Ira-Q
zS8G~NpL6IhGYc&{(tBD9gR|8{(?>i&v4nkW*y{$yFexc*$BitdRcb6_UEsfOTbdYr
zD^Q7nN@jrh>lY<<1&9PrWGZ$eiO%P;x(>-ay}JZu<kTWR9Qr<#A-A)7%mzhHb_axR
zx3k*u?TMiMIT$cq0C&JszEY|A#ow)go1{BQXk&ilXzL#$<sT7W-2Le8dHOVZn*uqA
zb6_QX-T2ZzeP(IeX=7tGm}`Tvr)7gF_BikERkAW&Bdaq$X#0PxT7OmTqF(utNKGNv
z^qJgE5DE1CWp{glrJS~Y>a*MI^!x-8ssh2SFJd~MGA?R^vJ5(_>BLy{qE>7&L~qAl
zee$NalvC!S_JI%6)`BD6Oa4ZC<r|R}vxiW7#HU8U_m+DP2zpGaafD4x?<20{+hB5{
zqH9nfg|Y(c-c+&Hlkg)YK2#agNJ6-rq&MsS79ANcd;;a|i_pX0ZM|1hdXk~%VWCRE
ziqJMmdG>|TXC+<50DxX7*@SCBk{A@aGTjuR=c<-9acW9?>W&TuMfCQAIdJKDQ@2Qi
zrZyPL-ptv-0Pp3t8s(=Cba-D9_|y<O&N@n0u`~&yc@ZA{nR#cx0AbWAm_kudB!YnK
z8OyF=D-v+%5qo9p?7)8uN?thV*T2jGja;$sV{weUswfkjP~Rr+kq+i?dN2uEefQ=q
zg>>Pm^>PL(1j2od55Lh0L5b&!7w`uBlF_gDN5G-t#OU=TlLD7J{=S<K(qd}My=V#w
z7qN49)|9EyBFVQnBpx+&bK`A;>NS4)22JiP)MVl`;wWyl;_iv@{`IGvE2r^aK0Czm
zB92Z!h!Y@kmgxSoptWE@>wLRi-{;d{g=;>wY{H~m=LEhLDIevgdbXUPhKLGO_$(%<
zxsq2bfuPR8jH8XdjCZ%JGqt^^pMP-H1Lt-a>o69b64px3?Eg&gyb=!n;>PY!B!`<M
zs5U<C{VrRFDW;5rUJH6zz8ND%yR$+tnll09*m|3}iuTNvY^S(!X4;byCgr#nP1Swh
zEO%FG`CgKEfpXl_^&pNIkkrqKuy%hg7;v<tw<jchuUTj2%JU4ayN0el2J-_^*jIp;
z=BKLFPo$&(pqiNtce<Xi9i$C7VU(6LTq7S5kP0Se5(wxx(d?zyi%7@~=rxo4Rl6FP
z1@Tj#VzG3W=9>F`A8(Wesyf&o<Q~KZ7u^iM$PiKj^~QzN@CNeLLofkhXYp2d#;4+E
zSJdi{2dH29eA`rBTwi`aRKsCb+3r>ZBTWL%pKKVjz<OPK&hqy=NcjTWrF6ck5&fwr
zI+#DS@GQ3$-+myWgW$ZSb5gBt!y$}OHLIVwxwA_Ep9=xAZSA{Kc^|7NsI;M5#U!oW
zp>19*r%v<4f1l=x`6x|8&Kk4Or0Nk(pqpfkYMxqrrS$_!_xaDY8LFx@1<f$FpItQO
zR=&}SpPq9$g9(jz{zU37<|lA^Y6>y<q~#@yDO%hLknS)bVu7i!(VX2^rAbIRe&TO#
z@v&>!qD+91!Ij^ul%-|~(-!y{{BxnnboA|!8P}dII#!)%rA=w~L9+oJ=)~Cp6T8U;
zG_PNa2;|Rdz-32(#Y2%F`xKa&G*Q51r^Fa4?056yL9mC#1@O^NKvk_|vESOKgISw{
z^}&AOE3Sa1_vE~en-1qR+qkKcgw*4EKN9rhA;OMi*%VE(vA8cv(yc~zcXn&}2>uES
zuF5@?9VKzCu&i1zPr-I3diyX@_<ZaW+cLGS#?Ru$w~f%>EX6AL+QJ?HIe7BxJtUEp
z!n$?1LxSb3ws0}MHt0O=0hDPiwYG-OEohjaE1fThm}yy{9b9zJp8>iBPnr^2LYpAk
z8!(Z;Xzwgg!^e!;a8&-->JCiN_+zO_1phw#7#-+$HJJidV~Icjf$r1E%GTT*m_zJ2
z*efddX0e;Ja|F~(K>c2uv^#V{FW$@sHhm$*522AO<251uu<-Ky?A^qyFA(sA$7bOI
z3=qu9DYRi|Wx3{}&ZI{3Ph@pLKd&on^9-~-&#Ib$D?saM4lw}`;ItzeGMC{&Nk9Nb
zpwY*xtAMtQ6OQU&U-8P?q5$YTMp|gHakzS3uh9jWhkAhT5x^6mPk*dV!&C!>6v`>%
z{y_w!Q)~BTyndmXaqHE45UVK_*ys&ksnI@XCGu@CsQaNLI0u=?WB#*y$8$&2EcV-X
zHic<in-H7qe4>8AnIO_sUWWPRd##CnN|GKGxFA0PhYdenS#^Ka7E0*SG1aa6ugW%1
zG{H3HVK=brT&#GNDhn%Ex>0B}60`7ol#WrgnffVSu{?2W5+`CDl2CZ}(WZfnJRgw1
z$Z{<czfQzuFsi0tdo<8%fRY0qf+k2*Oo%JxzHJOJ*6muJgVr;lVppK{Zu<<(eR90L
z+9YO}KYU?i?S_HH+4Sj~^DTP(l-JaLP#QpjJ{r1aa=Bo(6m9{sK0Zx)X$_xGMcFq_
z!5nLEpBJE%@p6H6Q#Lwmu{gNGsAm6wjKfvam7Bs)to<a8nJb=B2CCOT^38!H0QcM(
z67clpz8(ulI<@EmkY&YV2FuzQZ$-ldh=ccK`xoOFn+aCHfK-&K*6v_x38w2CX$VsY
zho{)<NJ~Cq+93%^dzkm!^pUOegFhuh1c=^F8QGa4+})a%cgTepY{drCciJ6r*J9-A
zHA1c$;5t5XMF0bWT=+Bc#{CF;D;V(1`N0;O9T9;S%U?fE6ysx{hQKms1XV7w9BF@E
zNf(#U5;gXH2y-g0;c?VqO80|+$Cqr=!Q{#J6;X$UY;Ev>*y^ue=_)WuI?b~g)*#@<
z@&eIHR=;9XsIQ)5dC&^jY0*)N#h(GOz$LOwnDwUY%-k<#;!zLabq5y4zFEdgztP1X
zqjnS8I}L|}DU(gzd;PMNW|S1AJMIrA`|)H~(>+Mf_<r`P*^}w}ZO@yWxPn=m*S%NQ
zfLsxt<10`~z##!QO>fY(?RLG_E-ASo3*^@L;gFlhfY=wmL_*!~Cm>oOQhS0!KOcyS
zlN}|Y2-KEURpSWh;3}l;cLRJNoO0eCQVh6ap&mJxg9`nnT;FhN3Z*K~+m^flfa=IK
z!sp}F>mjSZKbD=rtoHv3Ds&K3ek#=ELqCX_=wcCF^@+hc9!7maY~W)I4#x|hNpwW5
zk)f$~1?CE{t-`GK?N`iZdq7BPByt8K1_ouQ$!4X%24|(XY|$qB+f_4}IHUcISLHeo
z0QLN@o`0y9cCOhbsyML80IiI_I7(Lx2iMBc>aA+qP9@`2^#OZ3m?D$8ZEaI1##9v7
zV+_IP_o4g{JOkz^zL{C#+Yn0d?41VxSyvN4XZU={D-50hfxz#4%$A-#ibO`~Ql=ox
z7`GTsU|TV_knr`hXA2iFcggymB!%N{WHvX+(Bw4CR!<^?#1TH-1C%I<dBvH%u43sl
z8UdJ^`c7RJuGJ%z@Ax!$#kyaXD_=zxFjnZ;>nK&b>uY{USc-mE<0+Z%$+IX*aYeh(
zFMYydE>#I%7Gu<hWfD2Nb-@t@dnJ%V$}>lQ4OAC4g7Hc5he2oy)>CF>)Jrz3P|S>X
zdg5p!!+^7EzY<bWq#+v9)XSXC*VP_c73*dk#2oU$zI(Oekw(WT{4qz1duSAlbVwHP
zSaIspsZ-N-eJ7Q}XCxYf-vr$M=j!M$p9ClLNpvrZ;L(1DW;)@d>vp;eI=UE`Rmopl
zi(7_LZOEo5{;tZjYJEQ_Me+pIZ!^6?Tk8{5SofMoJhCh)s^ghApdto|J<bGPK7Rwf
z%Sd}d_#3di!d1yAgk8b@njgVA>GiF0gFNF{u%t=+!$Xw0nt*!EO(vi0;WlL1Sgc7_
zx%Crt(O{DK5nj;V+MB7MFnq4VkY0VE;osAufPrH@Zvu>4`@1dYjSu*-5T`7dRm9&n
z36H;q=yMd#oX3&Q*u9>sT(_WY9w^_(MMl)`0Q1D*f+45Jm{!sb#}O}T%nM}l?^7a$
z+n|d=U6E@H_FK55BNbUZ0H%^3Od2xv3qi~+E|$ah$D^FQwa@y4Q{i7QAk5mYj|F@x
z0jjZVIpQj5g3owjM<c@<1pdGq0*!>$a;zUu)sh9-=cjbIjo^L&Ib5Ce0iyPKH0n|^
zN(z?X#LgUUZaN8WB;k2}zq#Igu3`4~602ZBEdQKhg*)=sM=jPbT%bO}zv>_`7oAYq
zynsuhUL4d=7!WSHQQu;OoSljV>pTa>wbP45#kL13nK=uam$u;!^ShYvo@I2Toj}d$
z6~gn82^sEUAM(;C3@hDBar_ejSh0#KUkfbFIjZ>3+d#BHkiG8eP8`=a!$n+JSe4H^
zy!$4Nh;S1Gr%i#`kKMNb6FyiCTD^m2NKb?Kvv;qWYJNUMsfs{D!DRZ{L{1G%5#3>_
z4wWz~>;LxQm3IMOGUB!~<dyPVYrhu;;ti$WTHi$P!PoD%srwP)xme9EPD)_ygKlpT
zO1&Ep6vZbjhnvIDk-eljEQ_X><YaPu_?c|i(lSBQX*7?m{b^GEUVqdW5<(B(-f6(U
zXBZuzRmtE6b;hD+rQ|>sFLT86tNnJ_jPDHih^K|CC8K5DULc<$DWUiu?2~%8bwL8k
zACL-xCBzP&W6%?8E1qUJoNj;xc1(3C({y8&V1mhH?iaNh^OYmt1$(SqEHdN?;kTsu
z*>b!(96G;?{MQ0^09gGD^9c>DtOKo`#G29b7Zk<;i^0;8+HYvmVWm4aMDkMSH(*{d
zN*s-+-0`V6r*cj8@>joKA5*G7Ea8&uuH@Ub&vq)MKa*$@4+;hIC=~4VQ^csiEZ4cr
zlFnIel%2Wo9mk#cq;?J!4%sr&dz$xl0=`MMtwgOBtDZ3$@r}QMdeQSK=J0X14_h*w
zdNKeJ`Iseneg|WJ)Kw7zWsr0~c@1O(lhhlZ3qJNBI9vo@8zOGK|7|L0P@U^=>I<s>
zQyeg@Q~y*)IwKI7+MCOeAdTIA9A?G**KU%8x0c_pAkXkO09Gye#UF+~i_`I(<U*41
zY$@8z*WwG3Z9==UU?-pPk!3}PNFh>F4*SRgG6QHKmfKd(EEV5yE8c{Wx@?0>makJ0
z(G39p=;_giA7)>C64mb0T4T<oWs*3%{pnBHj}KzsuLA<=Gbk}cHPlPB1SH`@)3I4=
zvX!ZkY*^2<K<P3W2`Zu4dQm%@N*=A)xG*VtwexN2Q6#29YYGluF3?rMOoWy%J+IYJ
zBVy4q5u1d--l^|j5wn6V{6#Z~TUc=(*tglvIt3@HLYU*VCg=S$kZsrHm#nxI6c*<n
zkhbZs0qPDIwK*kfb`nA2`Z+k*-rsdqSDR6sc4SI(2r%iQo@Di2Kq=hYw%RKqPOU_A
zLI7Gc;=AN3H51B3F#RP@uiV~sAZBib5bid=i}?4!d=M8}_e}|E)~U8q3zYmT?t7>Z
z`H|`8L`MM0Lw}9y9XWSD0K(3j;}g7K<fDVNBnR$p9{I^1eo8@%>nz~QFzV18aknCG
zpwC$m_nf#17y(}tk{PI{s-2@S$G61+XFsn{>`LG3@-F|L=0j%q6Vlp>&u0Y!|Iboz
zo8e!XZ9N0F=0`od%mZQ{a~AFilna3`8fs_FC{R%s(H3d4d7E4l0ZO?SSoY7q*(k0g
zHJipqr(wr!vfJ-M_Z!G{$ib*NQ{~NfZ(aT<(4|zsXSlmCh%Rd9?*A3Ea9i?kXU7h>
zl@j}^?<bqlUf4~&it-C0;G2F5Y7gqMczuEL&vsVeUc=q|bYtsh4+epxxQ*V+e*>4+
z3Ai}d6IY8VYIrfzH!XVJP>)|#1g`6}X834|_vy{SM#r4KWVvj(`}{7#-%AWcx|8nt
z>_;rWyR#e2Cvc`!KO6Xv%;W;N1I&W*sMwY#;QL=*38O4Fy3F_rVA<!DzvVVEGs)_`
zy7~XwJMVC=|Nq}hLzHA@WbY`Wtb~%iB4tKqku9=9va(lEDH0(gd+$w1_8#wuviBb6
z@#ORS{=VnB&biJxf1j`G>hk#{yx*_a>-l^>#{GVKER-5+kQwfFeH42r8U!6L<7Kzj
zCfF#cy5Cgu$Q%3uh0Z5pPPsXm9_El-`wI%c((Yp7Y6(GRU39C!e!@&5K9Rb__G;F3
zddXZDsV1mwLfRmk_3tn5MC92$yI%@v{!wann{81_(M1C5>Cl6PtoSX<rq7zNAqxfy
zkbllU_&j(Q3;<_X^#QL?bN{!OTKek!O{tS77$x+WZkMRhG^7f{F#_q`nT8XPZlluT
zYcj1*(#uI$iyGmsteIG2ORrU=m@_Z#QD)JP`_vI>-1RSTuw5O$;&2owpGi9Zy@h~P
zp`neX^)*Q}R8lvXl{~GDpwH@U*s<%m*cwLMG7|MrDJCe1nPk!m+%pM!4ArW0oI-?n
zLz=;EX=B%Np|#YsLlr1Tzh`R<5u34DPJ*e|D7CPrU}A|N*G@X=RRLZyo@YY`O3;<!
z;iYr@Ifq`5Fjwm6eJw>}Iqc^4kdmRLO|X~ZUslj-k^pfBKgeC&_?+@5_+x}hapttr
zDO`S&=NpZL-}|u93q8LlCSLv9$PtKAt0f><fNohu&`ny&$GU}}{*Jd?-1*?+FIZI@
zPB-X=3gS1ALmM;PkQ#HbFN#Z)Z!>0-sVOhB^rOyVgkMMaUt797M;8!cfS{6dIYY?+
z`%zh#Dn0cUWjh#%);|n}8{pWc7i0IP*3C@VPc=3S(<~moT57Nk8`3=Ci=p5-hxkcQ
zEoho6b)CTjAJ)69$H9yRapz(ujrGAP87By>gy-3_$2j|zj$KiE)!Y9k0Sp7pO*u<|
zmeL6k;DjP@enm*9as3^9mxFb_UCV(RaRNW$v0pB&$mT4@cS?J0-+<-MrTF#=iR$pc
z%fY;EDT~20!q{RS7B&gN#0c1^;Jz)jsu(a<lVFLK&d?}~Ec1h7GbmW~5{aYPzO96_
zGw$4-E1-oeRIffA0G>9l@-_du#2}FEeV$#K8cVy2TPG6!+UJ524Q1}bV7nl0qucfP
zId{(R8L!@Fl@^<~Z8(fl?W}?HB*gv(cBuwKS;nQ2>Nn5~A4L2U7Um59Xv(Fsah%pZ
z`3A;3{<jduDh(B!gGyo;i5L{eq!(P%IBeRR06OronFf_D+b!Pk3+Ss`CR)?F3F=>m
z9(Vhnxrpb-GaY_wIpTh+X63#9`E#CTvc=estc%9A_fq!zc7zt4Y()K|Ym?%T@F$;n
zgZ^iCp;@4>RuBQ%$Yu6pOcy}!QF%L^EO;>7zWFm>8(fGbQ@2R#2bs~nDoyGTQjsrf
z-Z}^OT;WN)z*8nzC56q@M|%i>z$nU~%JV>bC!xx{fY$9)U5NXc^tRF$g9Kup4rFPS
zU?yQ2HnQ&>imQVDtui}3J@;#bcz8^t{@Cum5N7mg)UWE}cg8%tND77UZ&<g(y9FOm
zUzR!F57EUpZb_d`78Mz``SXc4H9w3MyVA9x<o+@1d`YC3pdNN3v>QQJbaINu@nROy
z6Pz;F8UOY{wOkqDhXq%P2s&#L(&=ESy#O~bP_ABg9S9Nf6lSldg5j9*!F`{ddB`_V
zTkiXN)+JDGCG0hNcm4I8lzDV^^0wcO;|-@=l|iBJeAS`nKAuBWl&?Ya(Cnp4{Z`Lu
zA+&5$fOE7v98Ws`UL`lG;QmGuPNwC7QWL~-e4|47v=?Zfi<{(qp07XUtvCMpKFBm}
zK;iY5?>;12w^V&k!M+X$3tc}K);RX<pcsa0Ee!;*oGw^T3o1e;&$WIUjAiGjXDxcC
zL1VVNJp3`T{%j4@t7J0Lt3l-a`WoM7*?5nNR1T?ACk(YrCO-MS+Xv58Rr@dO_=2|d
zj5oQl(Df61wqOWOLkVXKQUC;4s|Z!8rc31}5yS`=6KLbG^;s@VRnGKsjd|OsGVjGe
zSpq$zn+>y)NU~d9e+ue7)o__*p{jY2NZ(dm=N#m=Jd8Kw1iyjEDE7jX_9tnPxt6Az
z5mJoL)1vBF=o(vHe@<jT?zEjlKYl7EJoCH{{oM#ZAHi*#DB+{y4!}*qUvL(8v-bK7
z>hHu;53fz*?Sj#=^oIR6*}1~xd&o?7Se5QYD2fNUcpI}LXVcvl?~adNFD8J%X>6Y9
zazDgBFM#MIo3*z!f}6#j21h>IlP5R5d~+$~F*GsI^q*ZRwGE|YgQ6(Pg5PjFUh;(Z
zxzG&N<Yt3ftL53c;t7?|yYHRAJ@zMXbLZ-P=oARsS{YjWIvpnnf;nH`BuqwB+u7oD
zMtDO{69j2N>vH<(!p;VlIDwvOqLcK{e?JMqA*!e6LcxGxxZ^O!B{kHjd<S~7L?G$2
z7!DFm^zs2fR!y?S(`mD%j;}S5bD=Ll&Chh1&N`uSIbP>%7Sy$YE~8w{+>Z}&X-gyN
zj&n{uL=m(jk@;MPNmAG0Sv(JgG(`#lMawCTrH?AFCMW*2%?gP^Zl?eTE7aItZFFSx
z7jrz5B^dJ%(KhCr%f6jdbKE5#mzi0&=s6ixx?|07?CiGI4cARo*{sPlW5(){HV-J^
z-*B=nAayo&2Mwi6ib@3ZNL7s`$^L}tgTPCLG4qm9QoBbLIkCymlMlhxL4QJo!h<5^
zG_L<^F$9AiPS_SMlOg~9g&iic&xyj&hu6q{dK{|m@QOgdlL^+)i{XpxbL!{jtD(z#
zX7#%u<PL=!otL3y96?e6vf|cAvI3|XK(ID(pHwo>EKjXJL@4b}m|E%ZfIunm4DuhX
zJxsNr3pukJxb7D8r|oMt1HeRNgL|jf$UeF)BsUD}9-cjiQU-W7J*@x+Q8YMmb<kh-
zwvMFyRaCSCNRma5FLX`k2UiG13te^YK8M>M;9yyqMKp8aRl1o~jgGKrEzrr3AlMmo
z0I#mg1)?&nu+8~c8I9|@wXoVs-lfb!J=%4tDcm4k2ns{K6dn8Xw3MRNe<V-O?oslb
zR}BxwIrCHn5`+4Y)qlHVptCSa`x1ZLy~LIbb?_@53gI+IU7*o|@-8y3!f&)mC9#^H
z*Rns!V&O&wUR{MJNno$^rgb;zHZHchr*5!3Szz<6w00tYA6&=C%zir~A#3XC&7|J(
zeG%Gs&(Ez*J#fOE-?9s6m1^?S`WVV-N?Nx%a49;lR`}j)-;PI1Omfg&RjXy8EGsK}
z$hd7N*U?UiEB~*AppgeG)VHAqxe3*?SFRhhh%LkRgx4xgbNeoo%@FMCo%Vrm0BK}}
zpGEhxvEOG{d2Bkh3$=`6?wDxjQ9JHdvTC^NvBDA3(ve6HdewtsH^PYgQg3(}Ie9xR
zm^(HJef%efkL`%!fFydTV2UwbEs;1YgAQj!Y#*648n5c7MDkH+kCh5&2bN>c?}}Lb
zc&!%rz%C^LUh>%@u+B#Fy{Sf|i~L9O(dF#l2}4RmFo(UA8z@!+_or^fvtwsO_p#!v
z%3mUOLOc7pu1>!WafQBJ7N|w~0U+p+RRu(t2P1`nwHvxM;137Gmj1dc=-MuYj~-k=
zO9%8<Ir(K3bU5PzWqyy(x%;yOISpF={ZsieM68k{s_lKAj>@|8IS~79{>a+X*lz-v
zQ1AOLHL$QF`6<E?ri>cMrPG`Ft*qCzESkt><;&?E>qsKJ;z#3i-eFwr^4t&I48pyB
zHhsQok*)sZH_A6hNrImZ&HdAwu?7sPk3S?u_H!1=7G{zbE>wuP2W9f8OU<C5Jlk*2
z_kqF05Uw-O4gDP~b?ROw3*LAwh|Muh1e#%%uOguBdit9g0V77r?C*D^7=A{uM(Dv~
zK%p|u@iiVbSld%0*VNiO0@M5dI<9>edXRHdJgEdu!coz63dm=IkymusrUpWNuYsS_
zYbLx)leIBz9y(6%`VMZLi;<!5v<iOz!l(i(-Vg-yjv#<?v!55lqnvShp7AM*=6ad#
z=7zrFOt`eT+yZo9$JK)7q!d1ImZ`#R{Vf5$5X7>JWg=NF=r!}ANBlpCzDfME?pJsG
ztCD1U7O!;MY*O*nHYVYofr8#?5O3(2E1w2)58?Rl<6;-o3x&VJmp&KW_LNc-zNGy=
zOhw%jtQCR}bx}J+O;!t^1$3`ht3PuKF<q>2-2)&}z)f|5!qjeSwUnP-akp-}2+O^v
zvdJkX>P_LW2DBOoYtwWuq^JTVZBnXMPfCLXYTQVY0<rVrvuC$Tlmg&aL2wtQ{m>V3
zHbHfjmo<`GWE7hE8B>*gpU#6^$OrtR;A)kCUOz;cKWEkefJr|UU|3K=ccEm3SEYe8
z$A{CUR0`___RVhf1EemLvKSqTyR{hY{-#xi!bN00_%K^<+=oIaw11yHb~EB!AKeRW
zAGG>j>Idej9K8@E6KV_xg)w}d4K~5JY4->-BK1+{k@f3Y9q{H{e3>cATwPtLz*(b}
zDGfhM!pQW{DG;Wk2|!GcFiKg$o{Y>2XV%e=e8qVrdd{YTVmTmpG}$I=2751eQK285
zO?GG!X|#OqK1%{2r-1Vg)XHYLTJj$FqVH|IbfmT}S(Ld;=_cfquiO&ZqK)tgU576%
zo9rKbezF+IQ^AV{UTEShcpR;f@bz7V>fsASdPq>?a3ZOv6wZm;I3n;ePupzV%(lV;
zjR12Vuvf^z_|rNhfB2$K9=<3UG9)e0RCw7x;PQJ}GbiuR|CV1ziJYJl)<D?OGn~ZN
zcJM?mw8iUC0B<YE6?5anM_sEKOJpnzdv|ob&;3RgWhQ~no?)a8W4LN?=n1?i1v=~U
zr7hk6`XPZwKjbvj@(axxd_m2dW3PUA9a{dm4pExwo=$_K(rP+E=_TUm-I0wM9l03a
z8Gw-ShP{b^v@Y^A3UMD@+W9}n06$v?6tcRkaBOXd!|Td<^qa!Hr$VSJzYQrU;09I7
z9Dql@2m*d;xRmyD>B%Oh^>CPdxWZ8nh9&6B4i+~bUQTATion-^v~!0aU9@C2(DFO_
z_<tug|F@Iq)&D&kT_zEh)7Z-W5QaLgpFKMC+1F3Ls7a-%0^Q{ct)>DF^ulgaj}j6Q
zHYot3D4(<Z0?vXH`PG_uc$D6!mq-}dU#*Vk1}KVqto?;=8LoH^l6C#X^62}FZledL
zsd3ti<blo(6F^#r)`n_oq;Klih!XZ!LvB`5t^`Ti2uRYmKQLQAwawN)1V1;bq1zOG
z4AgOA3eh2o0curkb$JaN(6HoYyzyO1gfUwbbmPGN*uHVF`YKD%Y1A1MYFht1r>eW;
z5wEuG!B_!gj|}COBfe^h@%4#M5AI!hZrv+VC?NWE)Pja0#wWh+q#DR+=Z2^SE&>hb
zRE5BGZgSQIZC^mZ)k1lM<H(<G?#&2*dGkgnbU<22&h2z^=$+P|w7Z&L)g|)RG?p8W
zRnUU=`ZioS=n-(Np@;32`QeJCQUOY%Nt3IFiG<A)*c&+mWHZGxUYR!o89U(fFPz~Y
zupg9h^comgza@1(S{wiYBAbA{)ytg@wmCi6Vx>-<KstZXD_6j`;8Bos2B~MC2>(oI
z{{+(WFRek1rpa}ADR@BMXee4H0`+J9zRIgc?0vq+?2y7-eKLsn%{ppE7@Brvx{cmM
z@Nw*}woD-sk>?fNF(~nW`%Peg@EIlf0}Olg=qUt~RddUS*K$Y<d>ofugEY1)iTtV6
zr8jt>(gL6M`FRX3T|&c#_Vw$aG(1l`H3R}BDtO@Y^%ndZwRFh^NJEkWd7li1WLsh|
zZK5>S^g{ut7)>Bz5j<}X?VL~F(($3k3kwv05{%#Oy&1PPrhre3Ip0oQFB?hQ$<2=f
z(&w4+M7%l>U{h0FwbV$Ko_uVTp;#g0jt%v2N0)s(HqzrsSzw=DYRbmpHf<h+^O?^~
z4BY`4Q4o+46Xa2X0ryy2$h$x&g5>1QKnA)Mmh~2T^<sA(zCaCDV6y%)ck=6Bza`Pb
zC&o)w5yRV%Yyo=bO2!=rWcxNx+J>t5%hVELaH15)Xj4S>t=R*rJKs3T(CpdubELof
z(_-&JM+?;&FK#$4vz5r`^{<$99&}{fI(BkIH`Cx}n1)~Zejhx3C^DZF{wRkQ$sV-(
zBtV!_&SQ)1#%-CRX?5<b&D~2jqnSoS0-O}WPp>WxwYP!w)vVo>D9q_3IN=enimx%5
z2uo1;ZGg1J+frUBIMP5`;S1XTxZ=E%DAIE;dR}iS6)-|d>U)}i3sdO*u$GjMPvet%
z;?vi?iJ;bF=;&-t_F4eB_6@OTy!(zzxti;W=oKwjGt9Ff&R)budJPiTY~qVsA-1dQ
zoGKE-sSR@xzMG`YA*0V7G)de?c4XIBw-Z5ufOp+0DMrAb(4D?sL~CYd_DQpF&9><j
zbb%@lNTeQf1g{UQMgz^Ws<GX&BIX7TNcm2UhN7D_dyZIxNF?k!<pml?1Ou_?!GW^W
zuEnGdQV$P(5PTafGe1uo8HhuyiZlETKuMl1$QIIySH>&mz{-c*2LiNily^eN&1U9T
zn*o~S&_ED%u|mlQms8r+!g+f!Nh)aC7Ib|3)g@c+W#GL|ya18Z*oBD4n4qF&5bF&V
zb6~vyMgFE;9VIXfEQU!LrllcJ*Nx8UOSW)-zI_@pD$PRa$SGJbGfyLtl8?T=xuIwH
zuc4yBr3d#rh^dc+`lj_X@9M)IMkCEg-~LCb?gF_rg4#BgAG}Vn=qe*x1nze0YaxVj
z%Ac2_1!w5eQg*j8#})^3czmqld%v5#RY^~E0B7~^N^F*RNE(VZu83})0O<rIbs{n!
zMf>9M8P&scbK@2V?0^?#HC$@ml@Gc`LQpZYEJUEII^o%W?if<Kf^PHCjOD7CrNmj?
z*qmB8LO<&wg4XLW)xYI#Mj2@V`SQO(7T7kg8vx)hbS35kW8PmRva}T@U`gnEUOb@e
zY~c)2nl37yydKRjAim<_ZWcw_W*Hh-XC2^$*oES;wu7NEQX|1-1kgI6{mODzkyOx4
z<e5Sx;5g}g)L%-JOht0a{CWR=DJ3W2lCcrTLFV5+17@mFqis(;3$~hC_<<1{vgm3p
zSDuI@{HIQ$Oqn%XmIclSz;4HZ)!jlXy?@~3i{3|EQZG`YH3yj(Oj&$EF0q+#tDy7v
zX8Tvh$c4}#Sen2M^iw28lyPWZzDqA#<G(a1dhcO0Vkm(}BXD5-_t&S2Bedw)Z#o|J
zm!~><C5o}nV$pa3=PtzLU>k0T+2wqY#(7)wscOiAOUg$cFq<P<G{4P>`ctwGPu+ls
zRO~%BH58&o6GVx_{sP4}MP+dAM{_L*X3lKXXM&r0U`JN%2<Uj*xSq*RF0K+T2KQRL
zgLP`+ck?+)kgr~3xKY~DGg8{90W5LGintMT3rfS}a(=!i1BkA_iGgOFr7+-R0ExAz
zc`I0UhY4-igNE2<=fRN<$bVhi=U_&4d$!I7DVTocog6BF$Ac3Y4!q5pI@Pz7lpa8i
z4=*Lz?(L`_54mtBKKbjdC%t}+5?Q*Ug~FDFDu7F^W<Rr$=#KR2bNvN4LoDFJUm7WY
zOF|Uv6vm@*QRFPhDJEQzuX+l$-bdq9V0B<BVDuJ(N<N}D1F9Wm(>eLVp>g{Is~f3P
zKq*!YypB^L_6+aH9enPE>S>%$@NY}Lt}r#kX0X-04LYcUoDT0!ogmOSnzTpiW3N!C
z&%_IWqaPSb5hU^wlTb(|4x}uyOHIU+_FqZ=$@mvs+160!LrFc9tzL!-9QZ?_SOPel
z6a2)_cNYU>b6WbEtF{D7#$p`D!~GdrK9W$Kei;1%I)CPEN&-&?Pl8~biwARv?OCom
z(St=pDT*C`+>^O3h7(xQ77HL$Q(E2^w!8j(WAj+4?N(aCCKU1C+7A#AQnbN@4AwwS
zwS5plk<A4#gB2MAc5eE=d%a5)t7hSYPL``ofw-?lFDrI|wz)8+MQqa%1Yw{Hdsn7&
zdvn090lXLd&Vvhq?~IoB(aLSie_KgeDIl#BN}>)T+Y$#WDQJXo?rm0#?*QsuL+}a!
zf*=rU?Z9CmdJ5=HIFU~cD-q~HRlM1uQT)k()>7X-HOh#8%D+-)C)wN>`ts<qgy{LF
z>7pi$<4y6Gd!9Kww<tCQ5gBA#K?BbKzjEkYJ={6WefcuC!zO9L%7Y0vsIaw;lI?ur
z-1&EHb0ADaFlXBa6J2_Lsm7*|t<Bt(Co(#M7|Iz2lI9G^3ko!U8l@-5x0m(>7s!q1
zsTEYwGU;%GCmVt|JmQzt+${|kYM$?ch435!E8mT-A22S%r2QG1DN?71kCgW)Zf0Yz
z?O!%9S-Wdll+Fq;Lm)8dJDZS%@9q*#&m*rgbe5sWifWL+)cWx{O7EdteyjhB0Q8u`
zd;tJI2SYv#7Qq_TxwAosc_J{2Lyx4CXwpO!N3+GSu`G>@0?(5YXvCdUNu7uC<IU7w
zjMdczqTr8!j)wBMXAg$A8}yF~xPF-$JE_FsORe!Pm$f<rG87+n97lNP3`(93R7>B1
zuk|3({Xf?cH_eTF#iuXyvSvZ%D0ZDeoBHctH}$_QcC0*QGzc8&k^Sm5*-v{quL7!1
zv#o9O&S|h7K=rz7^y{o=sv#Vzpccmmfq9{>4n4ca8>qng`h--%a|F2_t+n<Wxs$Lq
zAbfqbwp^9_Q-<#Ej}7p3ASCxenG<e<yn=j!eYow};|Dtz?yYGN?T>6SJ$E0vr!YSy
z)eXNKZXJYAJS^NN2v`!aJEz8>@`VaFRzrnM4+iVQyCCDF<RKfq$af45w^IcwUq6hc
z*ouFe`50?zU;XjKPe4fTt}RpSZcP4mQ~w@8g~HsxYx7q2(!s_N{5`8c4&=T>r_r&t
zQev2>0n#U}q!ie>VGx7V9S6{QkC$&60gU>-+(sZT$;0SV*;fT>{unO9_HhJ1m?cj-
zPl+}O>yFd1Srs>2T3X7s!e0xF0MRAzeLd5gi~zIVUXO3{o94f@O0S!RsmPZ&{IM6`
zc~3#(EyB?=)>Ct59EA60-<MJbg6x?F#50B)qCW8FQQkIRnRlVPQyP@mm$p)*m)gU3
zwiR{pnOen8BOpDBR#&GTBJ=4kofDvOri8!ivRZyZ2W1PScD1o@jo{y*_R}JbJ@J@P
z{m)=ngg$0OqqiW$mE~)B$7-fbKyWZ1KOL``CMdVS%n#fUBIlu(sw7(jUA_A+9{>fF
zJa2CH6*+A5(WQ6LE}o6gl6e;FL@#fuJ75Z7!!EpQT=Z87D&%MGI6)jmZdTPD^}M3+
z7_QAmCFVYXp{`L{dlvQeakohDSkFFK#}a+G#zyuo(|q?P<les;;Z4OB$-_j6{6^7j
z;$_KfD`@&X&|0~l!(<9Yn=IGAdz(|UbyBQ%TNICtA=@Ho>17s|t`?Pnuv*Y@qvlyw
z@nl&|c;LVluoy$di*tx-=1GSM$O~#<YY=h%>?GXT3hsT>#H&LyPXMCiZGgNCKL*v=
z>NTEQOs7IM$WyXN$|4mjlUI$#&lSB@qJ|TZ$L=QampW)~%RQ)v<HK4~T;vlIvGgT;
zM7@MOLsYkz5^l4Xfv}xtNTn9|du9kkynkom-Yqe?c5+^!O{mOS#GvdsXL*HE+<Xk6
zTK&QK!0!@<dE8mAzZ1TLnKT;iuLkzU!l=D~?nN>DNzT?eFk%2|Z3&XcN9Nt7D97Q=
zzPUE?a<)n!`!>~8E9f^#30i8JV?W@0ZB6>`His*(Kd4}7L~-(WG{f8CHHXe%`{0$}
ztQKE76sZ_FrFj@vUi1^dEm;Y4C%)Vbw>+*m-FOkdB+Dqy_8&uoZ0B&Urvm*hoa0E@
z{YdczIoRt@$Byo>O`5w9^snWSjgG?l2AJI`)-T4(P4Wgl7~tUO1IAH}T`NPGZLw$f
zw?;IZMM?zEzNi@?%AF7kc%8l*G&=FbVNfuGn=}Z6P8{b3PVRywDNYc)2Ea};aL|p^
z+&OYT1X7Xqn#%WF{&VbJKL5C~{uQ#*U5;8&H}J&7p5E(72|SK5i_lLxsV4q`nC3XR
z?bP_NQM}hEsGvtdXN=dI{{9jPzm^+w79bXb;E%=99ytnM>QDK|_*0vl=vjgBOzIJj
z<>w-s&_oZjEzh^5zb)Wg(6oC9mC?%sqSmZ_YbB;Di-3jaEYE;_*80BYddFv=gHD$I
zCeOo&{UqlJZ+kBx)g<@?^e6}vLz~!kLFr~jAeH6%i5|F07?oGiC5qHTAMEAXJV<AL
zdqT@m&}foWZ)?D)58^HW9!V)itt+SUT)i>CaB}YOEo2LNXGX!G2w89Aw(E;Qe{KSZ
z438^z<ZA`PJfi#%ykr#Mq=z=)!P~sXo?-527(}F*EcNbQq>`?^91L$!<^3RMVve1v
zlUjEa+dYFatIb#O((+zFtv^}__%rPZVj0113%k*tG`sl38ykH|?*fWe^1ix5$^0AM
z?q!M+akj%~6S#C`Oq+5X{H|G_yIMqSp8HsyE&~O?LXmvBs70n2IL6;u6gg<CV!@1-
zyQ$1?(=af{hnZFR@~vZfw#haee|7c@x?V8~|I1Bbud0d<z2|$3?yMg{n=s9@myw;P
z>3FRhIwp(P3>AgT`SE8<Z+^DCEA#fG%V7yDvigJ?*Ijk_=GV%Zj>%VZ@h}ASijrQw
zeRBH4ZwjvIKLo9Lp)2*mmxnb;PMR=QfcHx@nq|OJ*DU*?fUBI}wluv&pC4vTh0kDX
zil-GUgl4#R5BJ-Sn-SYbu@utP-t55*hDJhH#k57v*b^^MC(y{q5RN#wZw_4J4y#B4
zZ+Z4s=po1^a7yqtPYY9(^gxP?kQ&?ioQd-tdOL@^^13>fR&M-=o*NuRLb<y?5o*2r
zZ2Ez0{8yy0H@eCFP0O0X`8Lc9vM$QL$gCJ-(rZdMkMRR(9j2Sc#l>d#-tNk@6BJKc
zx;m>sV~a{A@EmvL=2gR47#qL=+LF+T3wj-`6Vv)lK<G02_U*k9Oekm{97*|_t#@bQ
z)^yujvhz%)t7=w9$pmg4@OOU|dbnD(Dm92b<|5NFN4O;bb!7kC->K<M^w3G?b;FB;
zx{c4yDY~+rrGr!GA-sqS_x(gkk-UGZi3R`DI~N}=uzLl>k7E|5S%!Xa{h+D2)An3+
zj6bQ_KWl89U~$x`*=q)a<=}r)o6!S$xnM+a{QaHc!EBP7GSH)7-j0gxUJ@J|X|f7+
zg9YE-{!|@D3mcU;=AzYA`rAfj05!L7)nfGAWtAzJNdYHUN{7oZ=q$Hrk;YFAtE!mB
z+dj4JVqe`n9`zppJs7AtXX?;^ov~?;`{|d#W$5dTT{i@9k3%~{3pbvBhT?JJJ(u_A
zFV-LOMZ!K}NUC+gCLn8bKi#0&m*6Dzb!zZ80$=1b4BSG>2q0~I&dfRnf1g_>rPmrn
zLQ8F*$?foS;yx=hT2X%o^_6zsS$Q+bg7Rh3!ku=8V0Ko(=_D2mZdh7{*44&*E6O$I
znknnrHZDxi{oZp&Nz6ucDfWDz<JSDrap(d`$#USG+gO7HJ~!IsDHS_6wiz2!CTJ~~
zySMP{i0>FtF)(Xdm~87MDZcDH{bjxCJS>W|gd&yXpXH4vvgm*c#|f^SuB(wP{bL!e
z#!)K%CO!p5DZr)GGgG?`>Fj!RsPZKeSAQ${ca$3t<BAU!nC3Zd?aG$s=y@v-6@F5N
zOplDCco@Vw)zGYR@_5+{4MivkQ1@j|h+^0sRmB+r#o!I}q$-(lq|&%s<<%9lYreZZ
zWP^zJn7yDyg4(cO&oP2esaTYglC4iOWxfz*d?7J2;3ThM(WXq5`YXcA0MNUqJ`@*T
z7N*X?RbqS)b%RJuWJSo%`Sy5mU;{jX@T9}kIZBaVS9%5;szuP7V|Y4#I!!m>`S;;R
zbz0)K>-zQfXLm-;P^%H><YIcu;z_+5MOk>Sxm_3ES9bjUDEhq|bc?MCFiIeI>>d*#
z*T);2uS=(M0eg|5E5v#+36AzFDuO@AK{~CG<4}^&elO#JP(b9lrHUj>dB^neciM%%
zNh*Wj24dm5qQ{l6D_Yi_$eKx`Amb4o(f9Zo2tFve+wXyG#uMp#ot&eM-*Z4f$jY0-
z(-Uw6$8iDgYFVMM-zbwzk&44Lu7`qt7w*u2PDF)jgj?0>R8K<tn3TQuPdl!$A3@2?
zYO5UpAY4mvBueSb_(9!3{59UYZ5U37YR0}m8+hz0**%YcwJ@vOufCY}id6oacXX!h
zm!f16Jg-70@;nPLtTZv&&U(MD!*1chHgolNN+Ng$T-@UhxLsA)FV+ArQ$Z(PC^o#5
zXKH;Cf9+<n&7kekN`Ts4YSc*Q04F;fBLcL}1HX2*de;Jw_npkl9cI_*^71$tTNt-0
zl2g!;jejMJtu{OhU5}2SM^5s@pa7(Ry5%i4OD&Ux30JKS003i7sAZPSndx~uIa0dr
zu~|`2dgmRxnM!=83xu02b64AYA8zhmF|(|ml2W)m9O+7x(Wc9AEogCM)5uYHLDJPF
zS~<3O+^lm9<$ELikk4BxDTPa&CW2Ea%)%Ov{+$H0u#4hjDIVm>|9F4BHXyb{p7XOg
z{$RG%nFfgN==&N8Z};5mW7Cb2mvg0iN=$LGhXJ!oC8yBZohDDoelh2=@Nlw<4YZG;
zI?2(M54i>0UBY={KT|RVDGFhOaFp9lfEb0>Pb%qZGtts|rSmv#t*h>b5a8rs3Yo;5
zx`L;_DOIzPI#g*%M~-oD&jrPca!LcTKm`{!tyM~ac9zMQuNusEXBtAu+iNqUC=yc+
z-@zL6i6*e1H2xq|`GoG3y0((eKeg)4xs$6Y`-Qk&Y~gn=eAkuT>dt+aIWTotT=BbH
zs0^hYM(n!&f~g_0m~~-rRmhgVT#1x@Wn$3REZ$jt7%lLci<#egl#n(sVQx@H7G4ke
zSj5X3ZeBWasOi31S-zE7f&)1e29w~E`rTA!&(gA64L9Q%8NKJPso?7SdL(_ylpf4q
zHVfJFKKHQ7M~kv$^O{awtA+$sd`B~uS8mzh!gCAC57yYt@BVqr(P_LkH&@N`<9nQa
zgq}Ri(6e!eF=DkWF!>@hy@ZjY;7N*?;e^KVX5Au0N|4aPmfyX8c8EeH=aQ(bppwzH
zp1Q)MBIZO-ysYUa=4(y3+NTM)_gc9Is;67C2AEOkp-BKokj&P^sN|QIFmd1+ablVB
z!E3yesQ7Up;LHm$s=i|3?EBpV3>S&VrXP94oK<9C%=GzAB7XA4P24FB&sstaNE`83
zTcDk7qoD`8sRcBzU4IZIpHyQE1d}F|@gS=u8=*xD`8_$mecn-j@JdhRwB&RbDZ7B_
zwL)MG6c$g)?pjsJv1FWTPbQ>|!(8Hi^6J!N0{6b{CF2vpB6!yJQP+afQxtDdoWYuj
zkj8B=N5cFnXEiM4&L020lS0)tA@YA1D|=ZCWwt~Pp9sK9rbbcXauglAnOu_e&V@G@
z4HAKP;iBdm8^G!<hN(+_CKE=B9=AU6GCkQy*=~fA==m;F-EbON?78T%ao@lCVbwO#
z%xP?Wq|wYYE-<Kbv$zniVJWX^SK`bP8aonZVY4a8rMboz{tLd<OWkAU=U=ZR*R7($
z?*?^zXy8wlY5OJFJad`A##L6zw`x|qt(lE>w_W%dZfY%Wfz!ph<vK27G}Iui0aR9{
z1d9zQsdnP-(#STisDLIAoSuU^gQqI4ZX5Vu_YR-QXFl~hud&!;caI}P3g#^UkxuM`
zM2g3IrsD4+M?;y2yHJEWQK7tyzunoeujV~;yxyt_V<jTdBp0u+&pX?H`MHjV6~gS7
zA^K-w`c!L<*!keA-P;o?)wrB+5dOHGxv$xL{;MQvPfxI+U-lxJ&p<%wBa2+AN_<SY
zsO=3JnwUp-seta3(0dOArDQN^0T>*AJ|=3CP={!6(MGH@3fxt5F&oGK(EmySV;8Yl
zk}dsjntdjct6aQfFvX*KC;JW5nPi|wj_)Bs4NuC{*Joq{<zGBe;|-bvC{ltD?K5<{
z=;vv~Z2&L(32U24uF(<x7m=rAvw+;<2;M&PAH{y-%-)`4O(W&2Zocw*ej}yFex*KB
zIiQq~(!=*)_X50>%rgG@;6X-xZ&CKTK?@5A){t2(zF-R0$BixnKg^?lDi3&P#>gRb
zkr8BpfwSYDHJm@A<Ho-%buuyQuS48{DRcj&Exmy;v8f8x#H0(bGb&5W3@IN_o>23n
z!oy9=^J8SHn`>!3KQMCG_U|8kjhM4u0b471rh1<<XuH!p@WzjxB5p_=p}s6@vyp8X
zVT3kje{T2iXg?srOW3H!pL8~U=;IWSv8mR>$$vj!n>GBb-732mq{vX5Q4{<Id5CBg
ztVO0onfIb*W?%w^3atX055#9HB;+1nI%iady7a0>4m;{afbFl;#Z}dKA)KlwWOH9Y
zmQ13)s-a(!EfLCZ5N%1|M2X{IF>U&@X8JoGf6NcPHmN(Ec%&arJ+cD)l2k`qVFkCk
z$t4!O*iIbb^gDzz!f?}Ac(GG~H%VFk4E>gV(gt^Fj$4+uslj=Aror3A@fW>c=OdqD
zAtHZ~3i}n_q)OK+sF!7V#8ulAJV{75mvRLk7n^{sgf^_!8Ws{X<qZ_ZOm*e9TY*2<
zp<2idAnA_s2|Z(T2KZv&NDREafYobml=im_%l<2o8GGxX{Af{kn@`q8?Bg}!Z<iV}
ztPCwpk5yIk-1Qd`PU$CX2abu?c)~YxDWBhbT@-mA<>GDvQ_$PRkje_6B3K>?3Q0%u
zd`6NSfM_qeP1I_BAyVR8g6xgq%u^EHLj{PD!`sT~26xK`udkKSjSQ+U|M86DRI2uW
z(VKFK^C$66?hXE1f-KO@<g?&3FjuN)$;6_AzS~QYte{w>4}SNFW-jk-b(qG@kz&!v
zXD^%}!@6-rFeo%b(TANbKUA{VE6n_`sGzN&w-yf-Gl-ACssJA4EZ!^aEh4t&BQMu7
zus*3|ss%qlcDnea>rgG!*9mu|{sbVY@C{iXzabK7Tm^@095hN(Ec%-2U2~A70!2fI
z?UAJsrvVdF`EM{Z08t?D=5NUM(duGsL2a%~fy3X8tDuKJW~Kf^&L3(|n|c@#Xq=jj
zoD<?^Uwgs86s%{X_BC|+0vme|5!4CGMV!MYHWvb8P7ru>7hHE`5!4Ad<p4?T9}CIp
zwMNbVm3&?~u<O?xh!H`co7GqWdPrGUEiOUQ@C-#)KbEUp_m9LMMphR~=zRQ;=@|+Z
zLt>nof<3p>QP=v{*7(j+Na~d0d;mZ~fP+OpRI`*weGI8%9|$~_UFDXQY;+f}zXI(p
z?{Ut*QxT6adiqzubbY$66($rymP<PFutY5Yrp|hgo9JCQDP`Zt?sv%>^xBW50&AfC
z4AZ7{Y=x~xi$PT6B+dgG;vo+G6a#S0ijO+i8E{1Xmq?vc@bhw5!Zko7hPLnhGE;rH
zG*X{YJ&@2&7ay#88g1LN_|kg#ze*YiK7k4NZW@3(&;(yJcL{t06QZ22{A>JndN5HD
zk8jf#kvc_WGjwg#D|*BRq$;;?v9$4;=0<!0v2I_9?d3<lR27utUSr%y=aA5D1`c**
zE}PubYg{nSFi)z7l!}(K{7J&)|C1QrdmPg6uxr!SaA5<O;dz3o+_967k3b2?A3$Et
zzs9t@VONxL7TWSJ0U-w;@?)pdZUMFoLvY~^28ydPmWF_hLTY-LTLTjlPeD^01C`|W
z*WQZ`ULwV-b>7m0^!$;xGzKgVwJtmF7m53jR_iSd89NE_<h&n%1kv~f<?aFAv3yit
zolcX~ASY!l3W?OMYHq6|MbeXlBAY|NoTfeBse%=-@2J9DS=b}Iq@C@yr}#Rhbwl+p
za5QrZFg*G>C$))F1r)F7u`VHbN8@^(J*8uIYAIuXX9M*F2$D%A<yC<!mTB9|0$K8z
z2Dy)-g<wTV5F`Y5ekI84;KJO2X){6;QdVufi7_lEeW}Xkrs~oT(2-~q0x?&0MjLGd
z>Qjn-J@q2%7Cku?Nyl1Y=@(r5IW!m!z+qLe@81O3!3fhpfTyGr(0@Ky4*_By<ohK1
zc7I7ke>B~EWWje`Og#kPCQvU<qlrXQIh5Z!KKK&2dHxHOy`fC$=v=FThG+ld^w&w1
zO!me3Rr;KVi?=7?^8(1^GGo^=I45OP%2jYVK|~GI`07rn%eRcy_@Dkfu2JC5`r}O3
z*%^|Bxc~}`O0^A0s?m5tL8UGr!@;3l-5UU)nbWpUr6mKFa7D`bhXKLOeWh`eP~)HX
z8w>AO9F_?pkgX8h@KAOj$jPGuD3_kVN?tFm%iBv?90J7n@1H^E+}rT>u*jmX>B<uP
zfzjtMp5)w}yqtuu_Q!1;vY%t8mH=K!JT-!12H1x52Un}zT-8DiSD!qG#=mh`Wj2e*
zi>Z*g1~Na6zv=Qc%%;TyiGk5-MP&SNyBIh4dsu?c`>S%iL8bzjG#S{=gZfwy7PsTp
zL<XO`IE9yn_O54se3^mw08i2FlK<VHIOG+8;CA<`Wl@V7G^M*!+maE3ptisOMtvP9
z200^i1K$B6J=?<P_MXU3SXI~D&Na&qyEEpZ$A2lzv1Q-SlVH&hKgi06;7cTUw!N62
z>ni(>vZ<Fv@9wL{)vD(u!fNQ3+kw*`8-Ra$Ti+B<&3HDd=o=oNv~(u`!8~-mRRB0e
z)a}`oo&80FqT40xGYE_`XoieuECowJ@97&57@d;Oc73F}EGz_+jgjuzgiv^k7^?s9
ziX2wb>4x9@U6^~CVH11)1KOcMl#Bse4oJInsHez`f_5uY_GaD4u6fSvVHYY5*v7Y@
z{*noGB&OjH8l6y4P#D-H%bqa<l|wul^EeZ`kY_Kj&7AbI?(U7Jjv>QLSLcT3OBLet
z16Eh3Ra_cXfM?Kv+Owj>W(4U-815QRif|{1>lUqYQ6xKswXrtPrH1`R16V{|`Jjf4
z&ar%NT!F5Kk*k89Eb7sAiaB3^9)kJs8&OErb^-I$GP*Ac87Tzg`e=YPG)^_2i`6SF
zO<Te(m7Lc5tG{*K81XR|Mk7U+y=%>zicbb9J?_c}S;}Roa+^Xc0{Hyg4udXx-%?CD
zq0l`aa3_+)tQ9=1$OgzhABSQ56e)PpnXR0^)$bMBPE`hJ0MDRr=-Gdyd+7ljjRYFR
zZn~nq*<CdL^Lv8KHWWIc293YF*rngUDvMgmwa}Z^O4|#clv3FHLw(KRm0|%XyjU{U
zjb&hMB%NEx*U(=RdvL>>_M@mlTu)OdIGJWSK-m+{$dajb{rX}7$K$Zo{h7_3H%}i4
z6{xc^$!p<W12hf`?ne;ELRpmvI3M-`e?O2v$xz&=#TRhaW?4EsIbak83%CR~m;N%o
zE#102o28<I4+S$2|Gqs~!qM1nk^;C^uB=$g++c%f4KN`dud<OD>cF6-*O#rvrR={X
zbdLspOktP?NQxnhyf*p!hg&-uYSA&m+Z5&QzdrR3Fpaxf4;B&%LZl1oE>q}aNdp+k
z%>lz?FuI3>{+<8(7J&gtIgh86{P7ttxDr#1<)Xi_*rymJ#jOtH^8P3^dI-pb5GJLW
zLrH=YQchn)PD9TAqGM<dd_3+|s1gy%dB64^35o)id+WP`MF71wX2oAuXV5KkJ_jxR
zr3@i?1)8k{nEw_f|9COts&sL<1QgD^{131zixa{e|4!)VK530Ina<?__Kf=dF_;g+
zLoe8pkdM%i{fsWwO5)+cE#rWJGwI5O*6)q6XLwj<MABnmYt&9Me55uo<Tcm-w=dlO
z46y4sd8b)_3|_c;@<2_v|B?sD`=mBOW8gIou#MZGuKLatI5z#G{b4j{oncx6Xv_p2
zk4U7q%y^<Cy1f#%#(0=Tq_Osw4BSOyaKHfx*9)pl;WO{-)JI3qprXEqp`LJ-6sqay
z`_O>=FU1zYOc25kXw;Rv$%3zj-16+~kQ^2*3NY1gY>o&Qd_x_%O35$0#UfysR=^Lc
zgn_3Xy5tMUpJ3%g1-L;3^7K+?5(cQD`jyx^5ImAahs)HXWdVI?DQ0dEhF=~$p#~2q
zgja|rlV64prE!GOg-MGrlip{xm@**N420o$d&3UJ4>W@j3V$Ia3*s&Mf;c6|{}zY0
z*eMB4n{`Go){~db(Q;{)=QE&dpc#pVENv8#p*htsYK5Hie4vU)mCQQ+3$ROpHUT*E
zX9-Zd{xYnBpCGFSkv9moLq|12U?u>Xngy1L4zrZEp;+gq=RLmg;3APq?h85zm+eY8
z{2|c+HFQ^g0Yk|*GT;*1fZ?U&>DBg6rUhCD(7{7ia%F{RwKKiF?vEE;z?_)H^oSg2
z91Kluw2%!gDhtO0IL9*)Uot4DP*c?pINzJs#8U5s2b*(@3|=Upbt1dOC{@-nv@Ld#
zgB^)9XAkn4z=u^gQ(=5hCl?9~8inJxIad8qM#|~On8}$2^Dn@THNNuexwb<cJt&ee
zt<h0SV3&q1{yyp~yh*VISu)f2Zy9wU{~Z!DU+i81`8E`JvMF8MEu2{_(%L2W4%j-|
zgU}|)<Rdxc_lomR$c3Qj;#^oJ&~PW4#}C^>__?8ESt$#bxX&am7WWzvANp0xVNLYR
zbse?9k3|%omPm9H(3F$*laXO(9ij%QjG-;}hIQ@2qfj0ktZ<|HHiBs-e3b<LJOc%-
zg04q+V;Gv(4rW!5fB;${xbH8?VexzV=%>qr_YK@?XNx~#SElBW-7=MEclaFl2SPrE
zzE(qM{^x0-<e6g?y`ooXV5??e;Mm-HXP9hiMr~KpM2~UgxA;KnEMfEz)U0EJ@vJb?
zES4+w)+3!DZx{5gC3+CGJ&Y9fDxzZ-K&?7@C)(FYjLeR8dIH2^!e`VfWra2eBOzKu
zbEngPa-aw_n*}B5X%j#`%@kUh{4`i3{51>n?LJZx!`+)$XuC?Lckd=lng=tJ<3tWM
zph^GdZ~X%sh4R4AwLi~5=mRFa5>0{tpHh%fQi!ClH#`nTFxr1!Vt(b}OT3?#uQ$9;
z4SiKlOBWE`?2FD^fhR&HW<HoI7$SL4yOwSBZ;sb>lFg%KLD+vNbW+O)UkywcuT8e7
zh~%d^_)zwiG0UW}NI(=f`oid$H-uAeYC8Bm^MjW64Bn#4h=z1aNboNLmTA#)`+j`B
zE5F6X{L4kO$d|t1FGB+l5e53zJVMFAR4why)rcUe^yNdf-1^~tquQFT(&>wc1vmtB
zTG8wzsQPE4Jp?)aRN~KpB1|L8j2Lor?YPJ2E*Qz9=cE4>ggR&xcLm+!pBC_s`odfW
z@yZyo(?K&ldzt)3)?h-r-d|QKo9x_1_<QuBjl}1TJ}~MWe&SUS#S#<__srTsSgAHm
z8fH=EVm9_S58O;|H<orlg{Jp~23?x4bYzJzGKBikP{m`8eY>v*q+O><;#h5&V5^5|
zW{(zKAh6}OZx$9*RWtv6D98`HjJ}EKIK&pCB5qg&^TRz!<n|C-Aq{TwV~L(#XthkX
zM7zeguS^;%^e^*6^U3_52Zk9vFh)k8@DJQw6cb4#DR<wYv~w=Qcab!59ajI_0<&(j
z@9_Wf^DGg36A8D$<kekZkFI<JjiV2Y>HhT?X1}~+jQs_NX?n?Rqx*PRzUm?`L$W)T
zGG;FPOza-`cj-HNkMJ(jZ1Cuh{u6YCl>ZuvA;DyZF89$#SlW?01l<OS?4wTF;aC3i
z4gcG#w0<zxmxTo%m2~birn78;P(FbVGf)X&VZGq<IElXWz7iWg=_%?RgHM@Ie}NAT
zVh!{u4VM#r>iN&N{pXVW=PCKm!uijp@c+|3d1mO^w&U>J1|2#BWF?g(zKQF-{2v?K
BY{>us

diff --git a/assets/images/social/demo/index.png b/assets/images/social/demo/index.png
deleted file mode 100644
index 10f93b00dd68db1c83cc714051b62e279b9c688b..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 27466
zcmeGE_g7Qf_XP}NuYeU41XM&s1XP-I8z3OPhiajQBE1Hzpdz4D=_0))QbR{YK|lyC
z2^|#!Bq8*Gg!Zg>@BKXA_dj@lco@SW1H#EUd#}CLTyxHq7dl$1tb4ikvaqnQs@=M&
z$HKDx0}IPm@7+7$C)!s7%vo5F2i0y~Gw@BO4g0(`Abr}H3kaA&#asB#)a`q|`(<u!
zAM*VR@>hwmBx(GY80i;kYYrFGB&0q(*?s!fVRBumXB@2#o3OIJrO?dwPRG>Lbm{E6
zIVY!h>4eZ!vcgo=gpehpIht(?ydQjp%ui3T{qrpg=Z%Lu{`ofJp!Gk$|7gG6<ewj1
z<l4gV&v&m>{=b*OO8kEd@;4m*|0hDm2m5(0>gJ|3wARl*;lS)tSl(qgNEt>;f5B<5
z^WQTt&@Vci_0@Uu6ib;H+L(Fsx353MUmMS)cOy$(^gOL!pK&1PWmMbr%jK8%%U0Q$
zD9&iLYf<qOB6Z69DA7Q;E>kC|1V>4^7fSc@R@t?5VA8}K!@SVj5TU0$zrPktNDb{*
z?;e^)Eq;4<Fok%k@;h$O%<bBz#F#$KQNBx-+%9!iNv;7p#sWEB-o%IApXkg)@X+Dd
zBm9=FsKD40hX}vuBL{V9Bi;d;p|#!N8n+0EE6bETS{n6*Ci3^>6x%1?l$BEZELumc
zB^*)nmh0<lc%{pTC-3j!h2_=NPNnZ%Scs2|k3Z8w{X9Cs7a$p|X*oadzTq?G&dDo{
zE|m!#8{&x=Te}x}CiH~+l`}PsZqtz`O8RLfawqbA`fNO|7`S2!I$VsEEs9<`=EoYE
zqOlRYdJfL*0-NiP6zi+=jFmJsw4#T9>S)<KD-mvs)z!`JvB{D()6M>s=qO!ZT4{d3
z+UudCSzX2N`;LLv-J^*_o7Cw{-cN^X&nPJRN8Nq$m>!Gg^YZp#iTvRY8K<*YrCETI
z{-{w>uqfU?M76ahRwqxmwJ5)HP?cR$o-h7&p_xCOm{^)qCMm7418>M`RZxLP&b{D2
zk14`Os%rN3rsu)WN(W=j4Ac3)J{w4m&MVhy9h+B${hdb4)o+ZJ$s|VgYAQ?O8H1@s
z{+oZ^bWC#~=BDQw{k=!o)b!p(Mn>KE?5T<6t*$Z-Uh$Jo@mqy0958!b&@j_aIBu~+
zK7x9bh2`q12HPGyrb)A>Zawte$L5^UnjTR_8IS7%;VM?cU3Ty4mG0IC$veL9Fp44f
zywdmQM>QDPCF_+JSsK#m2!BehqO6wzmVP|fDzZTxqVo3yttjU8#jK}K9aPkP)-!ci
zq<faBJqsi^KmL!DlY;7DUc*t+ay8r!x)MtCisU`sw;*vdqj`^Xi~TnlgS}#xt6PXc
z(sx1>uejaJX;YUgNxE9|&#Km+J(D@vQ0iik))tr$LduDhmS3VT5njdcvf}iwfA+N6
zJXMX^JV5Kf;rH$Grr;Y_4fM?TLo;E!dnvE<8Tda1i{+;>5WT~dYpIXT6&iwbEaghl
z975tRak%ZeaK$7BQ!pB=soXC5@>Ea|gFM-i(ksk74HjSjJiRYcb?1`}pJgl&PbvK_
z&Wc;TdDB71v#{r0Xmb;l&$yisw}YMB_9R65yMGG?-Ag2j5{HEqD<?fa-MKW;>RM0x
zbQad&&h|Lv8~1+E`<~AwzUj7j@#)n0qJpkBzpmH$1htwfTcq^3C%FWC_?mcmA-)dP
z<sftKS2XkNRacv_3xqyx{rURxdG+$~DTj3wPRb@GKL5{~=ERtliH#J0&-Tl-8tOsT
zhzMl)biQhE@9dvy0avLrV;vj;BX3bg(IbAQ8Dod&rN#OZGI>dBwW!7UbOlBSLmSbn
z0D(G9kv2JeSTE)f*I8FFF_NL7qfZc8Q9c13&rU0ssO{;Ym*e|iUS4;n`mcMn7M{h7
zjt1ujRo;nhr8t_2P{&AFW&!M-MRmLEZwE$2J-$Jrk+Rk(>NMeRJ*}?}`;$LTb8In1
zUSC^V{PFNkH9EkRH9W%DT<60STc~@%dFDx&;Z-WcM)JnAcey95oa%BL2q5xnTDIjC
z>ilX*^B#yR^>8HolIBv$myz=!Br9YcpJ~X}Q3^&me>*okRFK9{RuTR#cC|m2#JE6x
zwNY=EBsFngDn@PJK4QibRdNU~Du#n2orRCj#xMqnA{<}0A#%`Kac<;*p11|us|K&w
zM%M9XF(S8>-pLu)Vy5pLWHfblRZEq}SBE|m?jvgZ;bR%{!Z(6PYc#3c>w?1r%SFY6
zAP#Qs6FfPC{_LGoWtQr!tj2*l9~`Hom~Wz?l|2Giv&o5U8JR+PW1W4_#?A^@g%yQe
zP;U(bb)H+Mctzjc_C&5mnC1e@trZ(9A)l7oy&k16u&S&={d(NPOS|C|<7bHBKx({*
z8uR$E9i5<-n@T%a$1EI}x(hLN@?*&l?i;Gq<!H1^-;V21cTtazCLJqOdojF7yK_%+
zGXp!gcH@@-c{AHQV`e}1;N2|^8*eUA_>O0U?h5Y=W}9}<mqWjtW$$EFU`*0vuu@e&
zGM}kP$cW0EG1zB^BgSO*jvJnnlrYar|5=@`%BOJ2wuIND>Sh5hwc5TW6^)DD2=GnY
zxH#vyBFzZezQUjklv(;u^qtDF3Ax!!E|S68Up2TLhOu~yQ;;i)-|(3-SjT0TGZPml
zt<kw|*JOf2=~2ET-M^3u>!<PJ@_N|i<GI`JWly4y&LFj~p}z*(3@Y!~?r{D3%aQtN
zjx346esqAz)9O&=$q2<Ki{V~;)RlEP=0f?qFit#UtVqjL*!`&r#?`HdOj42Y)U;Kf
ziUHez6zNNkt}&KA6f+t#3(VG<lMWrq-htZbcrEP_qooPYSdR!7#go;OHl<g%hLx;y
z6U9j6nX!xy-|XpOuLzJJ?e#lMhf9BL;}H{Cx;1Fz%NVMECtg1RDS}3}yC-P1#E%jE
z^ZWaYvo+;7EgH$a|G3a_x&KBTqkp{I-+#Gkl*ebBWWV%Fy4=1aQ1jNUVsl;#zA?&$
zKRv$_G(Q)N>)mK9pU<wrE0vHmlaJ!G8ni~a6{p|VX#er`W9AlY9*=R>(-3k4aj5Ut
z&hGIK((=4V<8yhi!Tk>Qo#u}Am2tQleUF-D2l_E>;)KI9yrI^%^cJ<@WL_nVs+F_l
z?7JTBweinuYxKolQ~x_n^djDc_VjyY_8lTxjRoU7m75*cMV1|Woz?^*>1CD&-yqz2
zEJQvRGzHex(IX3NsW};f<XGf*`ECr?!qR-Vc+a@Kf%*F$40gg#TqLU|HC2`xmBzL1
z@@v0EZ1T8X3g_X&$1=5D>s8sW?7<`_yng*&a$&|$?}2^NV8!R23GaJ6>&&xYudUF?
zPlvpaG91qKv$KkY`gro=NzL1}zLUM?Z_^q!WNqR$#640!cZ~8U3yI-1HAV>&{l`V)
zgI5y8S~HORALl=Odw8|Zw;U;L*D=&rim8|Ny`QvNd}+1N$R@cr(MTn}P%%Kg;IfvZ
zVUrrk>Mpfw_a=+-&g~Vxbt6HdANS5J^t|t1h&>QUzDU{{%*R*f-Y%c>DI|xA6bsll
zkEk7Yx`ITQRBp&oRd%d0O!GH?UgKZP&^?T(Rg{!53{H`4%hDNp{9u!%&W{$j;yr6V
zdr>Jkexr1DVTllZIJ>6I<^zD3po{K-VZ_1JS~oA=y7=DTD34{kxo5|TNR!)botFwq
z%;gr`4F>F`<M%-*&_mUXu~p8-evBcPj^P;@09G$tDE%|<`3RO;kSXkaK5=RUzY5nb
zSq$*M$G-nqKKr<+{kb&23}*3lWAojomzP};ycV4LyG1_8oM2F=Mf{ih?vRX)^R4ce
zr5+Qn`a1hnNG&fhDkdLSQiy4rAKcTEQn9+MU`AJAY>6ch;M~5dmku0KRy`qK!r)iy
zAPPifQsXap1`MC8X*}gBh6(YCO-;OVqb`Z{Nx94kf5+7cglEutR`Hw~qy4Fa=40kI
zuG{xM<)GU8Ro5@+8T8DDC`nz+{fZR({<dKE=EJiXLjsYE9aJJl9VX|O;E_&&Q9&}(
z`5cWef)%~<E#+#h?1WpnECc*o%SBYSrk)caY&uyMh{z<oWZh4op>|OQ8=ItLT;NV!
z$at%;2wqR>C>70>q^V82vg}$^J}7xv>RLm}l{$RqBxDKte0tq^bP?fQuF1OhXHU9w
z1$E5Jq0TIZ`g|dKzz8$yylJkX&1)Fmo_*?)8-r9?fS6L3DK%qX@e2SH=|i<ERyBF*
zGL3KeS{zxpaZ8M+Paw48nJZ2!DMO6aN%qjflHxWxy}ZrP$aoM<+|sfzQ6WAZhy!eU
zTY^6;z|JSVu@EQUb00N{)DNi0t7oQ&Ka3sKD;ZcOHl1qSI}9B%!mDQ(Y6%t+#NjP*
zJFF1&bW539?9UZ|3Pr6~@<jIWcE7gWConn~{G7ysgv{8pBfg<(`kn&TRkd;9hVl+X
z;AxAt@!|gQeUA#xQ>lv!BGj_U$!mZaT8M*Y0DNDv?eA`UqEdEcV;8p(8B>FmkRP>r
zn^T^UQ@)ADocp#M)-w$lmi~mbfXhWz!NMxwyibXB@N=u4H|HAf{z|D=T~P8j6Xs&g
z(-af!6|~c`U!_?&x^H1yqWADWQJv&8BWTD<GaT=mUyrT^j37y?Gxo}^HHh*o%e<B3
z-jV;VTD{@8Qc+8>N5CR^mWA4JbVky2Ex`2}dcHuod@)20abmSOC227Or{wG#^zNcn
zvqo6?`jVKWjOgW)I>Xl+V|0T=*CwAYG)+ISpAHRMbZBY`Aub&qcYsQ|G`b#pmj4$t
zA$Ymd>Y*?9B8q12Hl00#J$47HAZ8}U+lQa6CD``(5Q5)B4Ujrc8i!Q>#_a_n-fy6&
z!h%Hh7)*#*OWnr8QYL8S>Pp`qS-JQq{sq8J$-l4@KkQ#t)#0|M#ecQhOv06HcD@j;
z=kJ!ztc)72l^HEFOXxUNV&jqP`;v$M7~_f5NI9u;-?|kxOZ3~+Zugt``p>mzf8uv|
zhu+|}c)Ls$!ioiJ2M<)40_wH#xnh7U%`2-=A!gBy-f8!QeQhZ@loKYA2Jyd3Fmd`W
z$M^*1O*lb(-V;S@Nsp6TmGtqz1c_LhxsBh9=3d)3pMRd7<jf7}siEsuvZ>bACq%Xx
zB&6*CLW^IIu>8E9#Zo0H2Qi(GMaNo<CD-BP=1UBx@7py`J`_`_@%rMYZ=gSX=2q1Y
zYu);i^N66AhsW+qq!x_G`s-NY)+$=kE`@F2e^t&`BY1>Fo#y<_byjB_$NulC1-qsR
z+cK>EES#f1omfAeAvt+kZWrQ`P;t@*iq6WK<WK||d9%i*Xpq!Ze!$xAVd)#A>9vP!
zk(%~%1CR||=q)`)GF2~PGTrv5F`tZ4ImI^dGorNXU?X?Y!Wfw`5M8?Y@O)x;E7#%C
z`O(s;-eL}n#fM7M52sVijH#ao3^T?M1meKf5GaI{%>fUtKMW=AjiKe1Uq*w|w@6;)
z`NjQ+TFcSa-ML!@(_Tw##AKD?l4|qS1=mX}L}O}_p9P@NJa~>&MQjn}``-*~C>2_V
zAN3NGhD`05Jr%~@mm}!2Y;Wy(4_B{go45v;66N`3^oE!ruf;C?-3lN3Cpn><K+VW2
zsV7O460UG7Jos>~K@){^bx0Qp{S;&~dkgjT^Yz8>&EZruMnMLd<JbAiDJ92Kkl$AH
z8@f<O*}@_^?|IP32qXmJi|)HQ{K(5GuWnYsrIXv98E5RdZ$YjtJ}-LC1iMJVBn<o8
zLtg>_{OCAe=c!ZpuK-hkjH^t>_c^uZUvMq1ppqt|#RU_;8z!U>+QyvarS8^B*`(oX
zn%UdNA56+ojqR_0e)7_L&WF)N>hij{wQU<^$~z~zB@q+qDbx`mR^%*G{rQa1W_ZU_
zX~gycXbc4H<i1Gq_4foKl70t%xqZ*DA})R6ng8|VR~Ox+qR8q!u^rsTegS@D&arID
z@Ac76j~-0VW5sQfS7f!i9$ib}wNy)0!a|M|^(hj`aFZ#PJAp`;`x<o!09)c~dz4>_
z#vH(nQFL|1&l~s*0cC&p)d`n)RbuCg&$ak1O0F{;`$RQFa-uC>mMVYRwm&TiY4g++
zS<6j}nSe0SaI*doBD?29qV|MvUXg>_?H>Xh$2_GZix&eGY_zs+?ZF)su1(%JV}UT1
zaV_*ECHgT|`ttU=*dWY{+OxTm+MmVt4TR?4oS_7_4F|K)+!%7bq~A`;3EmSEQu2J<
zX_<fCz4mqx7C3WTTQj+9cC8;ZST3y8Oq;*R$A=2Is&~sij0lU^CXHXwB6waxJ$FDy
zD+VXJ>7`vU{Z=K(U5cwPL(xc(ZxOE^=Rs6nuud^E?0WBn3%igxA|g@v_4$#|`nQR1
zt%m1U$EMb5x;<kTnhXKzbt$ZeNcgo+KbVY^lO{vc>seb?`IAv%yHS@IH{`zU`O-Mq
zgPVorhr3T<<}E9;QggBIl_UJ(yOUSs<!;#FW_pMFp0O+NM2J<qcmI~YPov4w7yq+U
zS?MG_>Nm-2`pLw;;DCUX)iG%Bpz3N)KXIk>yN~f{SJ#YMuP@J97G3eU4qO0(M4<c6
zR1XfFXJ0sI?f3D^7Z(vrx!+9#hBfmZo<0qqG%ah2Rjm}r_m@TWop9~l{7+OQ{6zY2
z+S;@}`<p1*DUl22o8q?aVZ_l}qnKZbl(QJ;jut1kuKM}_*Bm(w_3rXKk%`cm7Mvll
z4^d?b(q>GgJ5Qg39890B=OC@s*3l`2NxysS?{^hP-Cg$`%ZbWF1hnOa9^A5JzWeKD
z&t+ZXE3So=r8Dn1FzXHzw(IxDC|Z-@9&o@R_|V&3GiQwb)za%_JYSs^$Ub-WV(y)@
zS6^eSlI)D-tDK)??PwnyjEW}jU0UcV&#Q|$HnsA`WW>@EunrlK<cE-yN{UOqMGPt2
zuc_te7dfr&_cmPUDaR1O?rIou4HdZ9_yz!Dy^LUw`+7%37!W~2ch7`)imvdcy>@Sr
z<te&(FctBEk)hv=m|B!NbxK)@SF#v?d5fYVun}rnIfwnK6}7pK@DymfR_A>6SA+NK
zdDqpCc9LG4EFcRFo7M9E<a;NWy!~FAR<Lep=|Sb?CGPjz1vifaBu;ag5!b;k@pjJU
z1ov|CGm^st_bkrgpMHs(z(34AM&BLgG*_KdB^QQUTu>=lD(&O1CB0u9TqptXD<IUZ
z)S2O2)7mp3#lrG2_O6*r9Itu#%|_1p+-t7#m`@X%weG&INz|nUDWu<<NG+b8ZNl;P
zUp{lvX>?&I_}|8y0jPGvkrz;t3cV3LQr-_|gPZ@ug+I%9X?q=m!VyL9TR??TxQ`bJ
zs%UplR(|1Vt`EB3Kw@AgY>>u55h`EKN;vzBvvR@n1Epi&XHm5C=GV!9#%40bMM2cm
z4%idQ)DlO}@P<5zOQF=KhC=fu85vfhPRZz7<{L*&^{lUlO8Kqly%3iGK&MdS8p_7W
znOlO^0+ul`E;(B@^p)Q7huuJtW>MoVI9>kI+e5DshAvn?N>3ogjF@9~>n&Q7ng_kU
zXZ6D+9JbJdp)eGimVvj^c2LPk@)uLn7#HotU{TrZ03mHGQdF7+$;M-7J&djX2S+C<
zAZ-XC6KOUnT^+S2!e6caI`Lxv?%wK^WipVVWg^lVKR31{_SD4(N!hB0ZAffLWCKP@
zI7(7?k=ikbH<c!bavM27L;QJdT@s#P-E;A`H~09|p6q04&U+-gu6}=CB`!%_*fX!G
zH9x7#qSqRZ1;mClSD1$tiTuC2mz`e^?48vs6|tIE#OBt#!p_lUryiv061ACMkP^V(
z<mY+seY46dqM0gtev@sFYEA_C>YaM%4yz4$$4`GO`3MLyGBP!@Syj7w(#_2MGB8p?
z*a6?bF-MUkAG>HG^Cb3kMKAVflno}LcKB&-Wml`N!(AN?QncBCW|*PLoh`KSdjX%=
zU!)qwbHX-jskg8<wJ5IUyo_epglK27fNTDUiz}8fRQwKiHD3RZG5bu<jM!yEnjBTB
zYkZK`Kqq4d`o{Vief5Pgb@?!+-hQ~DuS5$LOVe_7BP15#*E6h{y>kf~cQX%{Dtik6
zkM!2`>@>;+MYo%gY{&7x%PoJt@t>$R6GOzmxP8S{^eaB?tKo4$iJX4#Mj*<(7Dq67
zAF9<K)z=q^PK)NXRN0n03(KQi01}$F+#WQ@RXAc~Om5~@!dHLq@t>nq@g^BvIW2Xq
zw8!6J?u93C_4L-Cb#WZ_uI9YsclV};GP%Pyc)qH-kk0v@X8NKFE<*heW>?62%iBga
zRpUXGI{mRCoL==Ya2IAzcLExyyK-jTW|>3bgJX+w<RFl@yNpD1i@r*1#x@3|?7WBU
zNbSDIZG@0*24-8*mHeKA%DV1Aw2k*^n|iLzKQ#PIhr%@xUZ50)n;z_<*ym1ud>0mC
z92Ik9$o<adQYG6z(BNb29i~pO(J1YeU-;#om*Qpn`;B8h5j-XGjqlz3-o9XIQx@(>
z?)<#CjZ@)lP04kSxY|609aWqP(|YyG{eu3E%_{vTid2uNYP?Jq9in|#T5{=W^&T<2
z13+9wG*DMVt2)jk?SgREW6})8XHaS8HACK6)w04CHCtW3+26{66q8vXbUjI2`9xJ0
z6RrJSeALT}Ny+$IlcJ1n<mdRf;#2q<COicz$E8Tg_!u9nu1BBaxc8k97V1tB9;vZ^
zPI|o<Tq9K@DN>P<5HwQBC^gYF&Pm{_%}(*-9Np;)`C|jua$-|gD_asv^!oTWkFlWl
zGf^D1#3y;WY&rruG48mcD+s;&eioD_(w(!}2dXD;xjm{ccX?*1SZmDA&XxY+g%I?e
zMyAf;5phSzPY$atejlNopZi#A6WXCEVE#7fDuh-RvYM{re(NoT$D2p=eCJ>@8+j(6
zf;@3Ar{bKM#i+X~Mz+R+h^o|yWaG`MVX$`pn7s1r4<oO#0udUvx13+BrX3a6vBOtd
z6s5s`_b{_~GSd_9&x0@b?$(362P#Fmh_o5di^!Ih^b{V`G-j?lN;DF#tGt!u(Los=
z3oTb%ct!G8Y?IA+gxS>J$JpN+uCNO7#miq$U>9f^Yn1am=Ua&{#RV5<o&=ch&F0`y
z$j!=$pgh`W^h8CDaB&>Q^nJ9(%T2Wwp6eM;zAd7zlxve?Ci-BcFH|tnah4lLt!Zqg
z4D?!3csWk-xr*5s8`;zPdq9BjhQi&Ob{1E*<~qF}l2eDtimAMXQU09krkT$&ccI)W
z8zHxHyYjB>d4*`BfPL;vzM;<3IzFW73$^&*SW=m|U=bFm;>7LIG(Vo%#VS@nUc!w_
zwN5DKcK14&fS_mry`h7@CUU6N%LMTNtcEO>+__(ndw&&zcYLl}DfRc0Sy9KY;XdUi
zgA>dn%IEDw$>fD1&%!b^7cWGdgnKW~i%5bNmM{6ruXJ9o<al&yff(zFk#YaHRM~uP
zMe{RiTp-niV->9(oQokKc(V_1ebeYJD0S)0{Nhr?D=r{pNW5bDma$M+O6wD6UYkXp
z8gE7{_)wkSPJi`M!@%I`yEEhmx{pY7H}3dQzuh19FOKORW>S?1pEi`g_rM8|#Nrwv
zBhLt(x^i>$xS|nXdrihycOn^7pVu}hM?h}yl|u3~&9hYaHNb`Aj6QZEzy3{ERA$rw
zS5~~ae+q%n+9+T6$mT5sCxiaSA?ggDn3#g>{TN=J%j!|kM@nutZSOz9hC;6I<xpYj
z@+_V*7~YW_4Eu2rE7#@beqS}NV@ESYCO97`>6zy`v^coLhngOHWOFR^#(7ME7o(i;
zSy+uR&Cp()BahMWBFsy$477uY!XqN&=%Ii*U4QJFS4ml=Cg~2x)(eeJtuh5KW@-yb
zq9MAV_(%rKaWk4noM}V<tkHlfuqzfTGR|m0p(|xS-6FW<tffWSOD{g_yb7JVCkRB6
zQi^JTRo+22!(^VJM_{(sT87WOf7?*&#zN_EBhb9b*0lY-m$DavD%QZ}Nyv*9c`4Sk
z;O8&y+Y<MwV%*jN>0)H(11TE<$lLhGqm<p;Vs-j<SjE1vyBf>yJT5&u@b?Pl92DA8
zNVB3Pfj<(q8lK|sk2}flw{06VS2fMh>;h$Sz<}5G)W@xVf0csv@ij=IenbDc`*W%C
z-4ChQP}AMueSoj4IrBjK&G!9~B6`#=hCTaH6RKR6C;$EWzeWRD{Ks4qdiZk}4~1P}
zd%1XP^sUC2cl?hbVbTCjtJ4D8L+Dy%Jry7BU83tZ+(K?Kg4eMB_ZkV^Esy-IKXytH
zOKVOV`x#CUK2Q!H%yLQp33~@|_V0bH0NbrzeoRWHbZzmHOovixRLprLSL7Sj|9h<?
zjrYdrec$Gs(K%4<qYkTbr&^6>_#{DC{p*%^*9ePC$trNwd7BoTL`9_eAwply3#fr2
z0PG>fn^`0F{e4T%Tx%<(I(d&&kU;%2>w~99`!BA$24OZpV0cg?|NS?J+J9fjVjS@n
zxWRyN)<j|kMwP;>ZtU8rNgETu!-Vc+^MDsC|F>RW`u?0zkY1M!pYQwzk=WRwnO}j|
zh+<0J&-=Dx+ZxUPyHSg;J9bdb8k?B7P^fns($eAsaKMn;&Z*7M&3Ch_YBBHPU&qHs
zn|C8FGgG1xKLs4DJqtM&d2`{N^#KD$60Gd7R7f0#MeS$FLj%S}9ImdGyte%RZ2phS
zox-Q}o@9)1r3Of@R>vFn7$*j=4_)e@ist7L$R*t&6D_CGU+&u*cSh#KMC*<}f6kvj
zsROIU#dSDmZjTT%xt<(ddcm7IjJ2SO<8DPkaM9b`jH@ho$N%>pv++WuzaN<Ui`9)^
zBPd5IY%WJi2jwf#hK6PtVdCRVnME^Vp+d*ij3)FAzv*I0oL$?+-;9Lze~@%X@!t>@
z-KJ=1S;U_1xUHr!U0YmBQeJyMTi4SsF&;Fp$DnX4lu>TP_7ZMIHGL5@MXcug`FXOA
zqzwN}l`Ph1ru=O6mN*-D_pUUEFy87`P-;*%AU1w$i#zjdWrdp7gVFzhNizek;J`mN
zn}<e4G6Cw6;T*DQ!}b(w)zz+vG)j?5&CU%k%7yTk8lE-s)olNru>45e30L0}KgKf1
zLJle2kxT|QxW6vz=SrlCW@r3PHXnHPf9LUs!5yzyDcdw>Uqzq}P^aI^)$-wJgXw}&
zMGn3}uA8SAw5P|J#6aWe>Azw2F|Vk~6d<m>uVSfLB%4+3di&xw#uDSG`{a;IsPxiQ
zPOw%(2PsHGG!h+l@E>o`$GoF<S`vOi&W<=XXC+|eN6nXup?g=0!eFt`8<w?&RY;4$
z>;H}UG96bewdYkdD=zx+4au{Lc{f&HA2{;f4xLy8@}!zx$}oD>NR&V+%^5oXfBx!0
zW~I)qm-F1I+P81(-oI)cy7XzVO~YrAC({R0V+bybs7xjsTr$NYqJ&yIl$8RHb@Sg7
zfiQ{oQ!ke?Yg~{S4)8%(F#&X_hpRD2KxgtQvk^XlYnEX`5lja1KNA$<Pi5EcoU43R
z;C7&X8M!rfD2m=yE7uG3Xp{lMEThJ#7Sk@1;1a7!{4Y->p36mdXHSVeP6sYrWxLXi
z_hV(iRa1`h3aLRp?zRvfA(Bh<u&o)?lmBK#O{eyDJr_ge#sx^--<sPB4hJkgyVh0g
zZ`V=ul6~)+GbzAe#w)JtNQP(2A%r5)kN#ami7sEpyZB71tlPS<ol29y<fypoYi40|
z0KrB9nr~)Ek9PdCt1R|4ur!9f_|}51TY38;MQaJOYik+%LZyN%U9m`;jIUi|kFUqT
zCQP-yJnJPPHUsR%Nh_rtE8e$zAE1^;7+?GH802ips7$4)q1=9lI;JFUM!F;Qze8hX
zRb$?!%@@6>d{O{)@G>yBy8TUC;%`iF+-i9DAzM9q6s61-+URh_JKYk%52%j9LRSpH
zwjv1xXZG2gd}BGZG#wiLGO2|!MMac3H0$*Zcd`f_4aScY(O-GO+Zvtz&06L=^PTDW
z`Iu$jI=Xkw-hu*iSt-?{vPOEDxRMU0YH<|U-n^DP{|6s0wp06wB<mK#`jHWTf64_-
z-&Gs1@-U_54b+3kda3&{@ED?m|MHY|(;=#6EFMn*Qo(bzdB&kt4l@acANdiL&2Pun
zAN+nAGSM(vtgFoNId>c|?|-Lqx?;kHS^;o9B674RVO}qiu-=}Y!Q|4TJo5{0VonTD
z|8LfRtE|fII1qqwbRKtz#2=sLdpE<%2kEG4UG9Qrj*}(t_<v=ShjP=QcpO!EYlcT@
zs#tc0ENuc*{uwnW{AK6IGGUi_|GS5upc;712!@pp-H>BZfdbS~|AZ^GA?SWEl%@;+
zWqf@D5Re|lYIx@6e&nZvXXSNZ9Zs1iEmeU$KmDQuURnFs#liBf=eLpJq%cxZFT9;F
zULDeW*52Bn@QhGS$#pZ2(hKo?2aflQ2Yp=lU-5)8ry|BPgdg{ZepXUMh8E^u+F>H9
zq>vSmw7LcNZ=PmJnP!)hf<sr`PQR_G<?LH4DOd_X=zj^03|igf`eD@pbKH+fla&;!
zW{SPq8_;BiMA<!NBmSv|{1<L3b&kvGUH^Q9``86FFbf$3#g;!C0@Nt;?+raX2zw&j
zP+g+w^>lUDIlzli2D-)t@?msIxX{0;mxcegu_47o%`J&CyELzN8%$s=r}91w4D2oh
zSo7aKS#J-`EIn!i0POo{!%sJ$=wU_o|GT0ekJ*$Hw&jek)uFg}iT$*=wpGdV?Bf5u
z!M#8J0p(R}HH}@feS>ZOD2U_#_b)H;_HFr4Qjh-W_8NmB%^QaQpUdvvP*j9g0r0iD
zBa(|(_0KL7Q7dzO5Au`F^#45~=$?4~3-E}&z*b{qu?z3gu-Nz83Tfv|?v)BLA0G8^
z;y*Vh|7{H|4`i#=y|0q^Ryn?_%71p9m->cyXb9H0+Vfj4^!#_v{6k$nI!V+kzym?W
zQ`5Wq;5q4_iCwEk((P+ckN<DOxq0Gq$t@1fXgjMrmW`s1*E8<^raFr-`ix&Ui$2|X
z`rjOvGM#hpY};saPCGp?HMVQk7Yr|?dG1niQPct16aOJJ18MqHPEx=U(nFzKDoGKi
zILNG_>afr!{tMln%#aW&Ij{6Ljf5YsW;;TnLc4iJ2pFfvd%r|tL5{;TPPF}>P=5;L
z7UcIla6hP0fOoO*@~$~U&i^d|@C+ep6<q&+FsAv_;D?qCOSYQY<mopIM`x)zuSK24
z1u*G+FsKKd2jq@_rr50f|8i<&$zu2`LIZR`APVyqcxaA0fO#kO40yT7i7pC-u}T5z
ztNRw@34FdB|2|~O_pW}P$&-+an9eH&nLE{>J18KQm6n{4e-uZ$d|s2tPd58%XfOTv
zs!#uWu4UiCmI8>7Ipe1`Z#2kx5i9dO+zLzylHd-hS8yuKJ{#cDi{Aknq2mhqUR35u
zD=P(g`^qd>VjN|xr&(b{%$M!oJK*`Pu`QJPXv>YGU^H+{(gZcF-g1P(!38Hg`o?wq
z*rBlWcsw4&#{8dta2nuk28Sw)OL?}h*VZxrCg@F9VscD=fqr#?&rO4*LARz;WTKf8
z(xi61Vq}}d#q$KjinCQrXu`iyGRb1acNu}Zoiyx1-)wO3xL=A@+}qZs!5~y0We`6N
zPo!!ft^_c>YQCB4O~>OR<FQ)<1LgH*vH~BhJ&#KPN%TB;iGZi;(py=M<Ri>4K)z-!
zO{c)kKfCO&-+c*5;5UHawS0AFTpQs<_pgp=E*6&fBhc>hy*e?9cHYkTqt4m#3LuH|
zcL=Lm2#2$0v(NPrF&3-%RN#W>8R2PCg%)(uwMNM^vK^#(XeAhPP543-e#hT4k>SN2
z);V)li%3K5Y-uhaF-`($Nbd<RDF5~Sh1MiMbo6m>mhk?3lQIxmx1&l{&%ARs(9zv7
zo(*$`JQrRNYiWK?jVVYS&JZ*cZg9}N;rF(^rc@5HS!d#&JwgL+tMQ)3qo1@Ih1Iy=
zSdpYhviQuBMOj#`swO7)wQp-H!?x$Yiq_=tPfH;HO6c*%@bu?QEYCRkZh-MY_|%mz
zq<LnS%E=WQ+Rt44hi`s8eq8Q5y;XVFPK$XHF*T4{(!ogSx*4&B<wr>RrMZ;hXJ<2F
zffbY#Xj!P);vECnk1<|-lvRI|_t-@PpCz8(?kgZ-FbIsJw|S<nzr8;B1*mVH+SLNy
zqEb-*qY}Bm_K=%dp#ntWfd1=(;T0L?f1o&(aMzNASXg*y%^7DwYwOcX*i3Q{A5n69
zx~ac~rOA!7Enz7J1bpWzQ&ybnm$T<+hvYaCDZUQH(`$bephRoPa<Xms%}a{LD?wog
zv^A>3Yq4#M(Jo-&4Xr=8M*n;TaCC6?3e+R0jfFlC8vq#%a7!t`eGEMw*(MTCKFE;{
z-U{%8_OmH$W%-B_NI4Pb1Tk>tLqhC8X-|$s^%yV(<H3s+5ox1e1f(vSU^=S1NDpV3
zKNSneNeAE!EXHXl9!#R@DC|mdXnn@0)?1eqeLK+KIKld;zHgsT!PL7+6ZYkuEDtLN
zW7B%_XktoUg+Gh2@$mpPr@o9-3f5KXEX0X+0|}s}2k@WijA8X~^S1>J+{L8&Rsas*
z>h*^<@4x}VbjfOsY_fuH@B(BLFYkC3mPsAw{)0kah@(#wwy=B@H<B{DTE`EZX}Q#b
zXX65x??gitv;TlZRT^L0f4~x2s7Whh9R36+=lceo)Y*J0Fsh#(qt+Kwe%_;JU2CK_
zvKB0Ad#kc^Dz97r_FZ@DzO7*s)Nn5&sKm`nj=tN-YcasY#3Bo*x1bS%60$8X|3QH!
z&=@@(wNB38J0@eE^(=FaQ%%%#8yE7_^7hVoY&O1+Sn7T>?C;d5&g_t6rS(>=j7Q%M
zu2xnIeGJ>>O)h3FFz~OJuRg0{?X~4j&<6O=yqL^0Wki{?e;doky-AJf0O3qTCtjDK
zy9B?3v-&egtS!#mvNpsTL%YO?jl`bea$SuS5oj~mix@iW7|VeJmIB*DCsSmw)kiFC
z4CAPu3^f+NQ6hI^M7M1>vH14gMWJjVLd=I;q_u_R0e*DJsodQ54r2?+;PTdeEY{gz
zQ2@uAx2JE7a0j!q0_@oG!gf@jFi7)X>9o}JU$t4E=u8bEs(uw<Qe+NG0@<umqMP81
zp$%Jj9@ttadKS9Xv?0%U7n;Jm(weO-S8Kpxd=S(=#rQ}iAo6BVOKNgUyCFCNoEp!g
zeCO>$%i~RT(KNq)2>vF4^Z52~y@90RpPfwYAd%gY_@p3i^1i8BBaxR^;<~VF_3C@1
zPd^Wvh=P}acuI^av6;)nLg!s1hNC?dgF%~SbFxoSrU2}By40_cL(dl#bxDUr)K9uG
z3ERPWpP2SZVU~wK0YrIDyj)&fj6pJU-C$iEu2kH>Tz_~r(8y8SuRNfD031EI;P3hW
z{HRrgbE<xNHSPI1rt?Rn@>|TO&lI?MO0H#JLtBx+?oLTCdh3Fo$J|C)L!<ZF9m$h_
zZ$cDOEy`oK*`NGF6y-I04q7OEZ0E(5fYoyi)#_#*;^kni0pn<=gPhzJ7HdP0qIfOq
z3}F3<+N#>X1T767oE_`2y3Mx;GBzk3G(y}_Kf~C8sH8jr!ESn2-aT1;%Yon2H^Az6
z&fWrC4(#a8^1o&-NMe7@JjpT5q)?W&CxD6#k)<;0iO?Ov0r)*eswy08Zqo>}#Sy>w
zSQ66TZ;iz70~fycIBBv=vQ4%INJQV>_Zhp&f8VdR&7pU<E36{TuSbDH{Kzk=VA_J*
zTm^}(1l%wKDoII;FP?YjR(_FM8t{T<B;SdCJ}*z#+omca_6SpZVsdKmUyqmYy=_mt
zj2o^o#yc-jIFA>#GGtSP#0<S{o<+nTaqxjxl5Cky9QS^|KQFI8Bwbs^m={99tD3wt
zckLAAC~qE^XTaC&)2>D>0#`0}@D+$*QB_zZ$cBcx#uMHOOlbTt!r0IX1Ao`G+8hZE
zbyaALUoNu8z{A(p)dF%75X<Wt6SG`!pT{mLPZ~NG5R0SUhg3ip1&YXNnT|+=i=y|+
z=Y?^rhTjV+lEBBL5(jDdxdr+T7U3_Ejs`|%W8G}8uGQBA&w&v`G1Ao?9S!sXrXveT
zZY!rhQmm^Ck21~s*~z6$&nnX?YaIHjmtEzy4%nB?yp~|WFijR&%~FN)4_yE9COlb9
zw)!f536~8BqVx%4W2po^`}g9ctlPVu>Q7zoYXJbf7|N5>yIDSQfmYT#<P#Fv14I`4
z(*D2Qz()YoA?JWeS{LS|2BZ~vB26;EJ(!y2R#&S~+4K)h_;AnL>-KLOrbkXEHKH3d
z>j>`sP#UU>?M5}wjU*xP;!9k*q@3~VkR)hQdp@0dxqr7#X7IZ+dGG7B1j;34O%a9n
z1imsOkk#}!lj1qGjw}G{zD4xF4gKhDiIeA5z?6A(dIkfHGnn+4Zlq?7m*tp?+G)1Q
zy`W$jS{hT0%;3CmrM)g>_Rts3T5ij@dzAY~=EVk<6<<HFyl7P!#>(m<3RC=K5NTeB
zv}Bp|L?bEI$=#MwO#)|-p5{>@%}q%A+qK|=KGHRLB3C|`E&04~*If5qXIwj>X=*?1
zJMK;0J{kuBjKRe0rQY9}2CUCt>LTnbK?XhgW2_*bA$t^WKs7LZ0d5S(8%7~a`o4Q0
zQHzY6d45h)TaCH2tgl`gs^5Bh=<$sszp28(u6+0bXXv<%Ee*3u&bN7$Ro+_NyHF;y
zT3A7{$pca_CMfB`H=^-^|02GY7bSUKR97f{g2PCps7M!B=!ywjYClSD5vFF62GsWK
z>52Jm5dK0#Z|3<edc<=*2#f21>wwq923M4I!eHveR5u$i#6U_~0j~5ic-^CU{>bho
zDvD!J;LMnx$O@M4_X>)poZR;QuIKDD1|cdP+&{>>FVga@TODM~&+b*QNs05*!o1`s
z;?OU{utR!v!OTh4a5vWiB3v2)(i4t0n*Pci_nih~5k|wrpu2hBbCty$>@2myh!e{c
z4DkI~33&=4v_HCVN;GzPQ<vqWs^#tE6wlqX;*(Xk;*nQ}i3ARW9F|IIV4o)N`MAvY
zEq5ISst6>DPt`@sS78XD+E5h^`G{PQiP(ug@}h!$n2bYRnbSy$D4!MdXtPzLSl?ld
zZXVPwGT73Q>U#NEiqOp=JQv>u)u3*KP8~?(;zEPcf(}?^*M)S9r3w`k;KA|bPy41Q
zBIose-o8^wGc^w+XrCHX0f_YWACa4$3`rmK9*`dU?<SEktjDu9dE}Jmu5oUz1cL6Y
zP<}5XYbn!%Z~M@&>xbznxm(~k6Nztl2Uu=~SFSLgZMr+;!txV|=#d+0)ul5h>)dGV
zag?<mUk(nhbqzXCnQEA?nirJv|J{++&$}<&KrNSQO9+?efY03IyfpAbfa#eI@W>^Q
zEex3YH)cO?f40TpERV1bB{0PYU2%U5E=^-?C&Zx8U|Q35DGP~U=na|EI$Ydozl~5}
zyJXH30CBH_+ANKQqJ%bzq{9#kHZ&YB)}(0&US~5JlT-y)E2V9l>g0=d<l^FVkqdq-
zpK0iCbJO?Ibi_#!V~?G9&s+rNKd@}l|1{wT-qQL#2!`Mm0XH+UBy0jiDu3GnCoC~`
z-|So$YCUuk2$aPdn7smx3fq<&_WQNYy8oKQFfllHt#(k6U;aDJimA`ltg;foXu57Y
zXvcKc2-{-gzdigI(p>!L6XMFMt;KLrsD=%dhoFMi)YQU52Y~cOh-r`zhrxXU1bWYn
zZJ`cu4tYn*5I}DGW=;$95EYSL-e1buK|4<{+19250<VAI7#FrR$mfqqB)w6io4EwV
ztMzDCR_>nh+5Ai3nuD(IDckUZp@PJNx6KqU!`s$6jbmUs=x#FOdmvZqc%c_(g~L@^
z2B*4*_h1CKhuY&ceW;sfah}Xy!kAoe%4H1zz`FIkyDue%?b+WA9`Ev>gjEIiZN#Cn
z-x8=G>NbC8g62!dBPTsGCm(uDJdV#y3r~3Og&mrBqj`|&V`#XSV?Q^vgLl3EO(t`-
z8<*wtA$X_X%;r}?^XN}X<SzI7bOUTD)H#Oc5i;LN@(^wkrrat|SgPsO4VNb^_I5rH
zNeHMRv^U`H{WSE5j;?l~t*tJ8enmYxMJ0+loA0Sys=_Gz6MD)IZ9Y6xWuG)rdqZ*u
zYwX-Nu~$$q5&n%lOu}!+O2w#kUGBrH>r@K&;@T@JY4lOUWYf-_Ok3|}f{b=U%EjTa
zpSWcxDVSz$<U9hBptHs7YqYx7g1uRkCv%>Jh?n*)>oCnzC|^damVv_}l0f}FyuK5O
zONlf|E%~+Q(gf~VJf=#wfh#yRP`>u~XXXsxc=>{erkb-R6Q*^fVm76nBd#kPcxc%Q
z>Ws75tibSSuzd{{-+y}BR>;d4>}acZpSs-QTB}RE`%+N595#oox?skna!@(mPtD)A
zb2oD!!QbRW%RV$J^;Zj$4~ieCb}$eGvPh$Q6_DrcWf$E)CO|hZ;5)bthK6RO@b|ug
zb8K>$>O%W)Ko}YvF$)D__Wkw^+zWzDw+ZDFN>$o0@slGxoYC7k>y4bL-?+gX`-0-}
zWLt<sf2~~Xk*N`c*z_a^S9YxQaM7ULkL==N(4v^C)ihNpb9kV#%2)~25RTmU?9Yk=
zAY`vU%Ysl0#H_@%m5xgm-x#FX15jg(WhOx7bE+z&9n#;Oc1+w9V---Us$zk-bVgQ-
z>Qbd$_nBX=Y#99tnP%trYXIgPP9C&A?%LJ$#HC2d;~p-^1=|mVDs|kagB1r0T=wCK
zV$nL`!zG$x{uhmI@d?$|TJZ^^tY_s`zFwbZ1TCEXuKgLWzvNlAA-S+KGMH=TCEzAd
z!|SJ=o4NDHnNEB-zC+WrH8|DSZMQ)Ot_v7;PD~t{%a9QLGyLT^gYmj6g%A{w6g!|l
zdW<sCFmspx126X_OQsXMM<pEyDI}TI=iJ)b5w)@iq}8f@8}rQm*b1sHpgX*%wD<XH
z(e}DG`Uf|*AQWdh*!Cb09^gD?e61`Ps7q-=T9@Z29@HK1UcJFJ_K03?eh}IZ*ck7c
zwe~s&dB(VXx>tzLGKy&d=8@X^A!8&7=$-Y*q?vZHCJX$<M2xtCf>)dwe@yk`F1Hu+
z-r|+^&IgyNHOmA(L7bBYR{kzn{Zp$Pz3qG&?afyQw9U{^Ls>Whx^GFdF&$MqFLI%_
zB?5tFEPv<j6+GSQE~CBL-zSt(!h0)#%y+yeou(jRU3q%wm~)r(WdxiU+;h4*bH0U9
zm?T<54}cIb=;CPXfzb62T+H;QypiN2gd-zaw^d)Z<Nxq^eH-)Ch5zx3%7psW^(tmM
zWtf%UjfM=KHeZE1;TmJh+}D?wL^i5A#ld-M1M+?1XhDOSvtMF-=7gO&F+Hr>N(;;l
zo*rVzo?CTwwQ#VcYmNq%Lz2B(cWKoYtNQirIVSiJsh8H)dOJ>t$%g4uj%>b8ETO2g
zov*IQG;Flfxos4`tYnr4Jb_VByKR*gdB{FhjQzy4QGZ)(sm1Q#%Z~4XNg6_nWAm>w
z?K@O3c!58(Y^wJXST)MBk{C9-Ub)a5E0?_X`}|$R@bXcD`|Mko9&m}}K6H3uezFK0
zLmYDBra<@Pic}?lkoFohFyLW8pzo(0v;eqA&w?R=WbS?a*soACK#4R2OchvLd*tYW
zT;OCVd`Ejk(>mf|ngr<*rxhQY-)fWtvo~1~X-<LeN#4P=Rd&I3f%cfT=3u`c5B|!7
z3TgmIbDk*gXgwzun}&s1*6Wh;Qt9BmgQ=-5=J{uibmh5DUokLv2lP}c2F=vwPOmWu
zI~CAn2R!fj>EnW6>d+-VLKE@<fH)EC-}zXWlZ4?$*>#4Mx2vxEtz65umyC%umn_Jj
z8khNME4E+hryz6y@`yxk^v8G@A#tfLbZS-6+Mw)>1)-;(>Vp`RA8%anObY^oUV$q+
zCEQ3RHVdAi`W&{aluUGVbk7GL3lioSdN5WmW=;|7<8D_jL0=#N<GVXD<BwDsx`5%a
zt$8DG>WFgHC6Z1Q6R|c+qaElWxiFdo_P>|YWTh|eEQ`^)hw0sqEb=|>gfS|ZLp&23
zJTS;p1THC0|Jxu`g9q>o>T7#a_qbLJ2Q^p<gO_V&%WG=6bqwk!B;?%G<cpef*9e?8
zX^F|_#agm7Ss;Q3j#$@wT4Oh=1HxclLS~)u<;#(E-`<<UzsJY7Ldc<s5mUxsG#W&C
z8iIOhx9m&=nxUuIC}`>K)+dXTuXX+JF5bspZxT{NH%Ln_Pr0syxB&$*T>fiagOCPH
zfS(2@85j%%Z?QB8wXh>)4P5~n(C0EHdoSfQZvsWr_Op4QG>0A?ULX=nzR-Rn4PfL@
zqA0zfD2+T}MzC0X3vy)j_!A<%8}Gp!4vQOPI(LmQMB{;gZ{;)lvMreBE%DyoJDfV^
z`ZR(;THi^cODa&%bV+G%j#9Z3K>kH~HHL;E>W)WsgxgoUlI{+#%mrvYNem<Na-?$)
z9Yft!4)V%E`!6>zng$}xSb^PyMxwsjHUVs3%1MLfK(gN$4ZMco>mQ{oXF`t*ypO}L
zK`~)$E2AtO$_CxtZE?_eSERvXZaL1lUIL7w?4!?8vWiANs&zL_l`<!L=s)rWTvFPY
z<A(#Ub>rGhnS(H6qZ`=z(v4^%*B@u{!04&%GWbpnTr=GRTy3<QJGSR*-!Ic>wzP30
zeu60r6l%CxboAr^4;#vlu7};=5wD?tFwZW?#}0bIKn+mij--UcFuj5RCO1~sGTXn#
zqQaK{gRN(&qAUf}>G=H^(GPMbm~+BB7h17H9kGk`7JG^H9=B`%3r^+VhGuEDKPho!
z@VcE+lIFO-0pr0;i<>B4127y4uq-5Rpi+C?j~j#f>M*{Fp)NR0=zArvfWHUfH~w_c
z8QmsdG#J-V@UmJqK0?V7Q3!ppdqL3_(F?pY0#%auybc$lNZW{mS6PU-7~epF7^=Fr
zNPDzFJkY5Iy(=0hRH2#r_bD9S>r89yjH?ORC;%Pt`h@+RGg)VtW^>@O<64>4%h*P=
zwsf7f{i|}XrRqdjwsmKmk!J9W;f~D(cFHQHG;y(`EwTI$t7gEAVYum{SXTX-&kp(J
zRSu<HPejny&Z*%L$)XnbO38UNZV{~bdC@oY9be05w(2vH7)$#>Yp;XgY>#Vux@sZ&
zk!c@+xh50zD%18CSvPngeifIlz?^~4y38EYd7hR=sxY5hXB94=IGxdqSop3;d{WbN
zo<dpts7_7$A_k+tTf@?yo}qi+*-j{Ts56&ESMdeat3x|oW<Ficzq&YKkt7nY0sW*T
zO~U;Pc>0$}Gi0D{NhO;Kwc0W+7Yc`azLvY0^QifK$}2h4hI*5UKb~_TUajW4w;FOP
zd~uz!K59o#p{Ln9kCVf+?p4U05XnB!RDB6Gdzar2vCuJhqeQ0g>uKgR$v#%>5P=ke
zOzS5q0?#sTvaKL2x1#Exb=AeKNPl&oEJW>_Vn{h)-at&_b}&_9Fx<PX_(EoZ>CS8$
z4n>-`G7Ly?4w;|uAtgk+--;tHGCzMH#gpGUw{(!{3LYK^c$norckNTW{5TBjURa*c
z(S5X0-0c6*?-QmXD0|n={f16IvQ~+G763n$xm6m<$01lnU41*5vlrlm^#c22T&qC!
z6=$K3%>y>F9lw?rA0M{)%9$ej`?i{9xtVjqbRG{k-Itr_%(XNg#!G4c3b6@}<y1(+
zX6NIf+01Z3V|=TA4A?C((abv;pg2E|-w#{T*z@4d%Wp8Z9Y;ki_nqRY`i9VrF9GLd
ziLmg6^+R$BRW;4qE`$zQ-KwZX8-bNgWac7$WUkSr;v7xnTj>ewuay_~-Uq6&4YdN}
zm2s*l2_vvlC{6WcD&4Lg(5ph~7o}m)xy5EyN!i6IEB$e<zsxOu)WF3KifZkO%dAph
zoP(yzhJzC|k`SMvh*3o5eJ9z29hZ^!DJ()RTHiE1Jw8=r=w@zO@TzC_zMublhU^2D
zP3EST8&g=2KLJrLX6Mlpid+k(zdx^hDupFG__;W3y0|umYu9sA-|eux8=ng{3=qa_
z^E!Y750ihuR{N%Y)cxVx6NeoAG;<?<bW|Of`o(6+d`dhw6z_OULNk}D3*-#uhXhm)
zu{j*2ql<EgCJ*E^+osP~F8QehSpLnx{2!|y16^sF>aB+?byy)+L_U>unad7*`!&dW
zyN|cEV^|4-I+$zacw_{6(m3i+49ZBE_pNLkq^WQY4qSuv?ZCT9gG&<2BiuxnU+_5_
z2y_5=#s(g=t-I7U7?;S_49`onqVw0|w$E_=|GY8f^ico9-0?&Ep0U4tSsr+}wBh0?
zX?Q`jiSii(T*lrdN#vKSW-9ts_*Cw(>$PHYZ0xT}uFTx(-YM-;izrp>VGIa2-u=!U
zKG6{{M!}8zI!unE#${dtk>vq(eIRh~2@^8MsV1?+i$j;vmHN+F`E#r=?15lyRqyWf
zEiP+Y8)`nnB&k?-Yq&Bw`ug=6m`d~>+A}P&ZRl-OiQK68#KYesXykgvdj&#}@dq%3
zEOCxIJn&35BQ*mFW`4aSH9^V@wADpZqYy=0E0bz;Mzpb|9_2Zf={BbZt}zT)J}JjJ
z(*OK801h|dFGOwN5^nFKpZp8lEZDagasIS?=rxzVzJ9uB^YR*$OQu_-jU<0csFJ$N
zB%3_e#4(>5$i8&cq~V3eo~n73Lkjh7;T$-N&T;>ps?E&XfuZTlGfdBWnvIQpd%r%y
zZT#s{jhjB}a(IMBuQQCwTSh9n?2387{&yA7p)3XaW}}W!o6rh2@y8w=<?Ai4C}FGH
z&%v{F*=hdf{fE?=L5tVAmgB`s9tDM(0<j(8UuwE9$RwbR*=F!Cjp1K50`kx>%xk+$
z^&9_nmM}jALb`{&vV4g{w4LdP0zP7foe%S7r;C<b)(>VE)k$Z9{Y#HNxoGkT<>pmS
z5^E4AJ@a_z))w$-Ii$<a;;&!|D|^pfv%9|EY+q4EpcnlzeQ#the2{@RG6Td?m}yRC
z{$qMv$irrfwu~+Kej1H19(y0aTWXSb%1-4ZY|>C{2(u@>$~2Q%Je1StIYYL-^GUgZ
zcieUT@MOoA4&_w%kP90>N5{J1pqBP6g}J!}<+a;qWBqvz1}X44C(mF3Z-$mh%Zln^
z%sn!eM(EGcGb1%O25QZj!*GBX?STi_joJV4Z(2eE*}QdUbEQwCM;_hjadn?qqpfDW
zN2FR<<*J|A=G^k)trMXg!^aQ@e~fvUChwa*hbh3*HAZ?}vB9EdyJ(O5l`gBm?CA~W
zn>{|Z!yy4M@kpviSkPt1Uq=H*690Xin*c*!g=u>i3~hW~3kw>~ytso0LkREMu1I^(
zZBm!unY`(dRRZJOcYC<NU!*kf7FE$WPzMUXb1nUoDAwE3ZWZ^PTcW{uvtxQE*U!Iu
zB01;g&v{Wqpxr$ox%H)n=pkwg`M{+A30WVu?ItEx?W4`A;Qw$LW|2Mot4Y?$knY9n
zP*X4%mz2fCJbnrcieQGIquyPtx2uP*Q!Vp@48%u*4F%%+&TQ=l?S}w!Ze@89&<L?{
z9;MtjEpDYcf=WO<{pD>6K||s5>4Dyk*r)&O*Ug7Em0NU~A8~Q7Y6ysGF~8e}s5&`|
z>)dZE_T2$oyEU+o_TV^W0&_jdjzc_x?L&Rd*$HR;zlQo2Pu9qAV*LNp-j#keeXZ+W
zJr1?E;!vTWVAXmQ#dt&}!_@0=IEvN*Lj;1L6$fa-Oe8X>h*pszh@?UlEps42WC%$>
zR8%SvWJU>tC}E0#B4aRco{jeW4QJiOhkRkN@=G@R-TQr?iCMo^V8gH0%~$!YU98Ey
zrE!#zDYFd91Uj(fd(d-m5jC!H05t)os>-2cE&-n3a(|;J#|MS;o$V%}u3L&__w^ec
z17}HStfx;0taWVmIWR@dzn9KgB-vZOaEIpmR!_TY@=IUl_^nv9_}j#XuFo4EfgrV`
zT(vn7I5xWWLGMRK;3?IdNhlI%zIPQz5nH1JLcOgn)>0!I$W7D9Bk}6-`2)V~JBa0`
zv7w8FK9J*FyTHXZTDT?C<A46DRjD&El9j%SjFHwh{A}O)aCXK<xl4><9I6GPg^Q6s
z*m+DUHGp7X-*x2ifb;K+96EL0%AVq#Tu`%u=_CL&V|2vjIKFC7o<IL=Kp@6IJDaOE
zhMS;yOG>nBK2vrb@EKyLE)mhjKb(J)do8_b#v7G3=N04|XT14TzIT3+JRm&a#Rqj7
zI}cv>+~?w(%QfqTFib8kd9uom60-icJdg3psO3_ZnN||v+T@LpD6ivsb`%sw(Q516
z9NSM2NuXfD<Mtm;AG6!_{B1}pd5Jn)U!%D&{?XvAMfE<4G>n<nE<_H2_WK-N`}6MD
za@qw(nD10xjWpJ^K+do__g5MH$}v&z#fwdivFg(|A`~WzaTHdGl7{#z#|tTJ<>mDN
zu$3bNp62<k7o#RV7^?!LRGL_1GJrPDtWhE@_AxeU9vObnwB}vKfB{46KWn~ceR+O!
zzj8@b4tNtx;T~NtwEbW5vPVt?qhEw2ufnUyIT=5Skuu`ys`=VEv0n|VRctk8%@#^3
zkD1WXPB<}DJKr=bBkr!@XNqd(n=bX+w&id}guv6~&DSUAetwi8tOXykYz&L&!NSsU
zf0%$G_z0D9V<pSuD*D2|O~H}t!V6oxQx@t0H_RMfx?X4!?hvBBMo3LXa-PP3=6Atg
z$zE7@B-`~AY-YVan&?yCs1wMruqfi~gG;m1mfTT3&o8MBbd?PsSi@CU@3lR}mE2^#
zo!wdf%YpoePvwUN{*7R90JMG6-?qM<R_J%6C`liphMzax*IJ;R;{LUELQ%d6t&&!x
zW4TLHo`kXXh7MnYkC6>WX1=_M5=`Yp5!JS&xYbs2Fp8Yk*h=vhl(;yipCN=<1Bg%p
z;eY~c>3gx7U1Xa6{ALvZ2t>8`i7uNaY~{au-yIuru6Ugwc;$9ECBxyxqU%Z>uO4^-
zIyuiimi5p12J#={%tAY0Uu8X19mi}2gjz}Z?n}+v>b~wnYKPk&i``D<w8w2J=?upA
zA!#QEBkt*>*BcxSFQRtzBwWzrYT|CbFw?%prROaCgH_I9rl+@8$x1SYbJKyA-0=y3
z5YEA-UMpMtubkbceLLnYn)gC5DAaIrS4`w4pF1zACH9Y*+x%Icp1U`Wnzv1s2>kHA
zcjsAJn!}roSRz^zq*SuOj~x{{P*#_EiLSb=wD;>qb%C~2di3^aX>y%KKmP=!Hw4gK
z$}w8Kky)_!P#N&a#$-;bc;%|<YYr~!^db{eQW%OlicfV^^#J7MdR)XSRlHtkrN>q9
zK-k(*yxohIF<m!8;ZpVfv7sSlse>KeJ=avL@`=LwnCCHeiK2=lsjcf<RldjRtAzH3
z*IuX8L}Y;US@*XC+Rp$&2d+r)4W78o@vRFl_3xA@5pEOXzGSg9V|BfnaRAH$YZXTg
z)zR5JcMtp_;(xVTZAXFh*#}Ei1aJF$=BzR0iKmUST3~m4&Y@kvAD{}l%b)<yU)t;;
z`THu7#SGu0LLH@Z@3a{Q7!%u~Zd%@{?oXcX_!2@@>54z@nFm~!SsFJLFE?0TXa52^
z>k9c#A9!o|e%s;eGt3B2D5VyYUv&vGaXl-q+(A(8dx|GM25d(b@ES4=2|^9;n00pP
z*5^@YRJ6#fZjX;czWly3Ck{M!Q@&4Re^Y)|zB9DRfnM$Bpoz(07*&+e2^-<GSl@nk
z&j<szNjmS|;O?%FK$XufS2e<BusSP+wYt9GumPU_xGSK;MNSh<xNi)no9-5Q)yK1$
zb;9%Ed(S=2J@q<da}H}fkWkKeG5Iqokh>44=D!&P{KDFmpeIPHi)Z`$mE{Uv)nazc
z-e7}D#b-e3M;fBBc$fS2xl+WIC`L8wrLxzfqD>tDoy23_AA5a;-Dhal1i9k(-#7%M
zD#>FD$?PKPDnf^?Nfn4Yv%sK{&>x9!*}d;7N|eD9+&92o$N&YocmJ(ln<J&mi1OC#
zZtl>qg+tm6c7R<FE2C-o_7!gy<ai7PAaS4p2pUXn`}a5|T~bnsN_vCIR<N7~Ym6%8
zO<a!E)~;eu{!hj-)9yAaqnG3hQj_g>!vatgXHx8Cha|E<_J|32F`quI8Gjf6L5#H3
zWA#ddolv72JPGeI3O5%8hFo&v$@W{(2R<SREuiLmYqvFnpyhi_b?VeCC-!4{9*$aJ
z%n7yX#$vc(^Tdn^N4AQkB{y?SV&9%cM4|F+%ou1|LGj}m@I28@M`Xg15v{IuyD!7(
zHZWGd^xmQVu9r3(pFdYi<;mYCxwbeuRZjFYB&z+Gs5tI<s8}nM>^Sg*#7DCD)KKmc
zBO{I19mhn^<RhQY9qQ~m;?)-tODr6^vO*mpH|jbTSKqB`9CXoL57Gt{rNO#QWh+#~
zcNUu6p=gh2K0GVgZz#nv&ey8t|6)=i4UH(v?B19a1ij2_)KkglXrDoUom|xOlGo?(
zB76_kxNtZry`!7GFa>#nK4i_h`uAO{srmDHi32P{@Oh=f=SbYcLUrwyE7xwr$4OZl
zd^ck&Vs@ezyly@$hjV4e+%K8$ISwJe58WAP+Y9;lnrF{jyk0(fHIL}3$g5V?LzW5s
zwnJa#<G+oG=Q}$l|5ZC@Fc<K$WrIn(Eo;&*4EyIaV<Jw4L7fC5S}B<6UtWBQYT9e-
z;(v^tRQ60#JHENFNifTnQu#!t<DqEJGmnN>7F$%%`K}*9GKwLKkeae^$8HqGz`I-X
zIWNk5yD9BhJbOy^(AyJD;CxHQ4#%Q43-1J{$X{h`LT1ahylP4ihCtRe$&!{Wp9ZDr
zVfpM0Nd6GF7KiGnWhQzjh*?hK0;}ZjIXmzXWZWXQ-8s7B0}>FJ(_LKNdp^;-<4quR
z7(W~e!iTlNVz@r&XVZSl_VuG{6`XYD+Dft%U8Xu(8yXgwfrXy4J}ZWHtb4u=2mtBe
zr}Ny|0*J#AXyd~Vj6~V~zNwPMjD{v3`FyVQpdTf<tvsN0Y8m#g>%#RLg#>BKJ48zv
zda$g^L19rhR`Qa1Fp3yoSEO@GS@(}$1~5wWrf6R#9?iEl)$ntHm`M3V9D!g(ez*MS
zY2Qsn7be*VSe<HT><1hoL#)S>Q<;#4@0AF-bXwYpzCs@06<Hy_j!Y|xe)fPeQgx&5
z!jN+}<y@HxEd*&jegDZg%toJMC?z=HjS8`dq`mcywuM+zN}F$zOw95qV;a*fFr_jK
zxgE-~yys?(YrPAv2mKKIA}g&)rpxD}og&k2wVX0Me1$X#r$w+r+T!viJ9j+OJcXoE
z-Y(ihXac+)iLRjr)Rf$NXcm4-VHx9R64F5u51Zb#ZeHa3YVH9f1;l2z?NWJ9l+Sg`
zUhBV6b()xo^-HDHf*yd^)dRy$%n!dFC$L%Ol4iy2gV+0r4YXP!%yUqo=Z+mIm&UMN
z2jSBL_AP8EX#BiGjxN8izXy;okq&YS`Y!{aU3i1vITA<fYW(J2Jo8|BTHiR`^g~1N
zjzh?yKwFfW6*kT<RQEI9GByfuJDf2>@cf2e<~oZ=LF89XRjYbTwheiavHyJG=vgeE
z(}i;l5EY5t9*>EKuRiAS*zRpK?+D1=K;@h7qto9tJ-4U?+4F9sQ`9snihVZ}?1KQL
zNt;5vEFnV1bn5+7Y+rns=d8ILo^0ZRa<e$;cyWSbZ}~Fc9`ApnY2EfJ#H49`s4E&k
z3k*)B<GnJSIY?-c!N5T~006nN>Z{_jf(>Wxq}jNvL{)4PcO?iLT+U2Db`~ofV5p#y
zH$ONbPsO=R6kL^I2dnPdlr*gT6PHBQ`n(K!{Deh1Cias#y*wqy@xuc}4^{uE0aV|+
z5;RoS0H*Uq6zCw~Tg$lE_t7dvTCRGQzwz+knei=)I^Q%OeMEow=~}t3*Q;uuBZX8Q
zYRgo(m>%aEmhx8DqZZMUR|-BZ(O$3H9c^gLKt2+}D+`I75ppFP_ONya4qWI1t~d<B
z>B^LrRW0rsgWtbUn@XGBYlkeXu-%CY<V5(OGeIP(C9DGZG`i=mT<BQfW@%10)T`>t
zgGvcD_|R_c`AH-jQ9E!ZFC{L_+Zv9M<ZGI%a{i$@-Av`AIu^H~URzXe7Zyg|b3#bR
zUTFPSxrezu!oz6?ey7%7A5w2~tukHjhJF!=gBxP6H&pLSb;O1z)IQ?Q=$!1(8Yhb!
zE70|hn9C^j8t91N;AOc-dnOfpF5XuV2A%L?O$!<2oO0Xx^I4)mIl?%LOj#aaj6bGL
zgMNUdQxSO<FvU^YwH@nqs~`Y`cB%^E;n{q#3D8=C-b6z-6?TyhF#wpiwa;3dmUU=c
z5Ts_>*fII#(OjGhkwf3Kb!TU6Y>0`gO$&>3D#v475#ow*m|pbfw?I(#ANk=lZpB4y
ziWF+xuG%~fvgC9ncNy^gPi{{HLFjg5lq7#?e@$IoK<*hhq~TyEjW!eup<}aB>sU6J
zzxCIa!Y;fO&hOlH>#Y%E!1@r&xS@;Ipq|~AfK||1urMX3!n^)C2yS!{B(d#%)M1c|
zwGGdzm7SA!lAoW@!S}DFqR#qk2>9ai6RoL;Z_pQ0ndex9FTR*ccb{B_sdV?rW%%z&
zcc1#F1LO}fwJoQ%<<t>9xd*0d;Zx+q)Dit@J52R&lj|_mzfCT~)I~YD4F4|<hl!;|
X2GhkK@8?C4@3ei}k6Q(sozMOo+{`&a

diff --git a/assets/images/social/resources/index.png b/assets/images/social/resources/index.png
deleted file mode 100644
index d210c0ee3732892d4f5ec36e49a43a634ef0a7bc..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 25921
zcmeFZ_g_<K)IF->C^I^WsDN}kA_5|vP{xs>A|N8YDG_M`(n1N%N+%W&q$*W<?@gtI
zj`U72ks1;VEkG!DAAH~M_x=y}{%}6jB<DP5KYOpe*4iiVj)v;tgPaHV?Adep<_)F0
zd-nX9w`b2En7<CdZ#4hK8t>U-@z+hIYxmq^DPykgCIcTtCN!;@+uB0%(M<DK#3YSx
z3B3G(@nn)sndP~Bq$sYWRL-vF;kWP7Gq0NW;`fd?wuu%BJ&&UDg|QC3wTnwSYpdo#
zn5G?%OWMk=7P8BB-zhpJ=(9l?hR@sM_oBs~a%lIvI+pu;;hWc1e_Td>KBn%sAHMvX
z_&1#1o;^3j_p%{h1225}1HPQ<`cohI@m%yC<kfyk$N&Eq|9@h^TJ0!@ZX|YitmjV`
z`VLHNeKXrU)sm6fZC|QwY8pZw7sR}eY{(c>ZZG@K?|n)w#L8PGKi6>MD=rU5J*ksj
zg&(h+Im2sMEvK;DB(J4qGS;Hkm=tNsH_goB(bTEe->anMVQ_h*_^j!0kpk5q|D5S)
z5%r?!X>OAZK?pnR+o$Dj`8fACxH3OyVPR+H;*nC1?e}C?dN*ldshaRD%<=BdSDI9h
zMhJV(hI^IQ3O}*v>2)JU_ebTKT!_<T(Lcx+FE%xYK8>poclW(l$}8kUeII>f{hHf<
zwNGiw5qzNw)vM-SODSndCB-5E^|tK^4fi_6qPJN0d|@(}uG%~~P;Gg8eh8(4p|I?e
zbqy2tSby^_f|Z5EfU(0E#~U!!vKzdK=v(t84^Vc>d}5d~v&ZN!wBb+1ELvQ}T1H%2
z+D4TNn!PHn>gv6{{VF<k>h}iVi@N$fxOztm<@w7Z!J+4|q@2lxdTP+(+3l@EPEMr7
zH)zuG)9Xp8C6bbnC-A9ntMhZ*HM52aQT^--fr*O+;xz?D?0;k>eax!3WI9xJT4P@7
zmmfW0EH5=8C*XEdP(W^{w16i&CZtng<%zA?k%up~5AK<miSA1C^>X^wTXuh@>10<i
z_95Sydp5x(;cWP^Rzf<~8(Ef5Z%D-1l}u8f5EmM2U_CYscbxcCM-A<utnB5wktOZg
z^17l^r@y!UeK%3xu;{Gmc-856>*V-VO}O`?SEjeueACR1ru}o08`auMtR;9#P|eDV
zibaC2m$^;8U0eUQ&cdSg`rYw;DAz#e1I#!<m9XHd`F)n-<Km8nmj`Rk`z-cX^_Sgi
zl7{>6Z!6bey7Ol1-)VSNyn5IX8JTQv86je)tzJWpXHsqsm;CANN5g@%zS%-^Z(6*&
z)7V^@-B6;t&Dh+<%$%U^j0|_Hl|^^=mBlj8<rixM$2Ef;$FRz#7|cI&z2^_O&K<Kn
z!pUZqsprcmP^SIFt`s@IvOesiCYC)}rDS_^h<6RkSCVMOnMd3g^ny)sf6IH~x7ba1
z(3Nz#31>o_$D>W_zHa?OOL|w;Z7UWCT)+1cg@li5r1Hpy8BERXx+GiOe(%_rI3D;U
zQ@ZD!G+|o4<2w?XbO9eTQc|Bw@R7GSD7b>r30JjK8ZGv6lq<G(-E0j^Yhb^i>F^!1
zwNYB)5NIakDQ|C5(Ij4nX*)xG{j331+F(E@aH5#!PM{_y8>Ak^j^5IPEMCOQzshy8
zP^3I{%wG>HC`epCY)dx9QTxwcSe+l6$=AlxLlfdLK2=Wb{G^`aY5nb<L%O=hd}(b-
zv>!6Qvhyxq(Vmn{-}O07?mL<c^FMWiQkUnrd{LBoY3J{GGlYEY`JBtR6lD~#hMpSB
zs;4VyNbl}Tu*yqqi@=R~4_eFMS9p%XR%Nq1%*zXRIc#`1z_p>0G`nI;<acNfcE!4>
zcB%Vf|7{mxujWng-FTz#UZ*aaZkces#AIW=HkYyXZK!nMJSkLYRnDzvLwYt|u|7m$
zi)4gPIL6O>lG|fQhUV`!9weejpFUt`hNPP-n7eIrQWp=nQjZN87~~fhof{u5InV3m
zX0Z7qZok0cg*F##dvT4s=H^mnX9G?{hVDmKRItD0HTja?T+^cAw5@YN0Wm|1L_&_T
zntkT~;yd2NMX-*v+%o^MnoV1)(4mc#5*{CY&2uZQs%ou%4Nd&^Aj$kzXH8dH9vU`x
zBkTuv*VaZP%FD3p#Lqc)Wo?^3<Gszl9+u+yH9qy0II~m9C*_&bNKJR<E6cV|Hbm1q
zddPbC4{#&nmKI5e-lgGL&*B>gsq#r`rv8KX3Z&u*Ws=B-aQ9exRT2Hkq@r<}Umd6R
z3Ks_7EBnXB4(eA)#gD*0tu+eL8cW*MH-^QhYd8o=dY89<O+(a%SvcTVoT<16CKU~4
z8Xs7u4|8zTRk(zPm3!nDXF<*_6ZR>%Zz`v^;M?uLQPJo2IiX?W!pi({Jsc;JsyVL9
zx`o!f<VmVZm6c>$2-TBx2pEa1=D}qdut+d@C-lg>$!_U5FHmm#wC~;XHpAgTTG`}i
zYm(bFe1A<i8-1!oDBrU)r((eJA5Kht`dipJA%s{DN3VzTKi66gY1Z2sNhvGU+qJSa
zpp-|5{mvq=$vBz69?{ceoceO>D{{^R#o4S1lT&BTcuu>7jBlYDZ*DQ+&3K%>jMsmS
zwQrwp4hq<jn~Yss6va#Fe{nFTn~LUObJyDHt!az~2MMyAdY@43b>pjEE~DOGb(mbF
zucO>h6J<~1Wbr)HW*m^LoSqyPO?DnQ*<Egn{F~QO**j7r-V(1(*5g~P`d}~eZoBN^
zgU$Q>25-z3$XZb`T+@enIOtjKX<gCH@{D>DcCU+#^qIa1XU4R1f}+dAO#(?X)YpCX
z!`ecrsr<ZzvAm7f=KS(f60FaG1g<v&@+vMA-hr_AqYiv-w~)N)Zp(OoV&{GPK+^RG
zZSztWsWrc@i_UzEqr7sRWrI5wOjgkhsr6dTU+YU8Ae}|?<3&2kPRUMB@;#Xk$YE?N
z@bREzwuv89Ns+;(ia%wH=4xhj?ws^>ZKKhizw5C1r8s^quA*KdiGTMPm{MRRBq)~N
zw3D2S-SJqIq0wmC#EBHSC1<BZHF~^g3AS@>rmUIPJ+(r6BjXzsQ5k&IiF)th#`t)y
zM9tKmJwmgvBS)#KrWE=#B*?++t<BSCV~nv=A0N<qp}IO$Z{FTqYxmy4czKhjq<5Z<
zkU9?KgnZaKkYcPkVrgu0aGUhAkom9NBa*Q6?wgCu_%iBYKH^>4l9+HvZM^5V2W|;X
z%`HKinz6%KOX7VWJ4}eUY2*Hhy#*B|sZ`Re_Xd8`R&mVA>Pg<|xXN8{0XV_C34L|U
zG?j8u&`$iQtjCuL6<n>$T9o^Gw5IrmpKl(NaT-axGt?}>qw6$oofu9cb{taZwQ_gO
z3zWy=o%uHOZ&SwT0r*G5P4;8xj!7x;zjEhV+dIOL#OZ}@yy>_k6Df)OuA?O=A<pO8
z?S-D&uFle*-p(6v?eO06M2FBC6uC{>ZsPleVh`!+g9k~?f(pl^B#)U&JbF}nZ5Mv*
z<v~d?M$?;?t4#=9+tK^>6eY8mRO0y?`Fe&U9q;uv*6gvZjo<%LG;`<2^|a@%&8;}T
zI4Aqf?RmANR&3{AwsdM(D_;c)a8pk6im&wamglhKUfox&3wMsz%4AwITZWcDu8&$9
zO-9Ff^EgXo<M{ilxitCAU78`T@yE&Ip~x>r!tz$EN;i*mRbRjMoStd3x?ewTago@u
zlpEs1gX2z}k4$)XTq?oYI_axQ>WHntp%MqXU#93f1Aojcr>`8nU?wUi@-8FcgS61L
z&qmvUg#_6rH#TQ_onube%nwM^ULW-tk9dO(pMK`n-0IN1b9u3#kTfFJY1RGytBipG
z%?%$vII;D<#vxi3ryxl5TQI6n46apJN|a93tNZSVZXS1s_!%^Dkc!-T<wE6Dl%CCc
zlu(&|)!TvZ@>s6So_~*-D45Sb@HH5T&l)cj93S1@?&ibOd0uzd_K+(bH^bL@8U}j%
z90Y{IGI`6>n$?26yhfj{6q%$RP5oF=BI&a{CFr;ibUr^j>s%vdfrB7N{du5{U6bR=
zISn}C2~isrmkA#{RFbB*nvHTB?OMmf##kpsYgBXB$m#stnEJ2kn)2K%p}A@&SRA|N
zQQf9e835i23Jd1?bvDMc#L&Ih>h5RS+LExj)hFF*O1Had-c0qi?Q&awA3s`Nd$75+
z{NZqaSBnc)$imX2j%j;*|I5SUjFk`Us&HeNs`T#aa1cBw4N=uL2I0DT4aln%6P_48
z|53l=zM1Yweyf}h)ol!`s4!V|;Ot&Kig1vx`}zlWi=|gHCf`MKc*IU`&qa}#rR}|N
zrn?}oV=}mBgOQq9RUum=<x3zGC#GHqql}5vh>=6Czf!3+T=qn2r`A0!w&U34u!T0c
zvyI$EWYWv)suG`3oOE>qR~;{UF+1s#TcoOotLtrQAOH6HiyqGTTOO+uKi)*f@kB^S
zSZ`fEvd}G*b5bVfYrd5H%9G7iid3TH>PrVj#jR&+y)X8unwz3L|J!U3!!^dY1hG+=
z&Rq3%kh&1Jdtc*Ztn_WozG*FuzA9$QV)h<?&C+hO&~~kk_%t{tP>{C<CHa0nRQ-H|
zBLz)wI3DRM4FMAEByaa_kKq0UPvX}ykLG6;18TvTdL-KQa@HT-R<Qc?6BiZ}>*R+3
zH5GQ_ZDJv=L4>U%7rWKbL7{!gu%I=i3`kX;waR##(Xxiuiw{LbiiEjh=}Pt(%!!{r
zRXU%2LyF7cu$@Zw_yE4@^;=_PWmHL{7*~INB9{W!%kl*RCL#8U#5VOM{~WKZ*qEu>
z@JQ3Mt+>S_+<{KFb8A9<a5-LU)F^F-8<c`X9vUQ2VzI5F>%UB+qEaIE(c(hevk}v0
z%n37@XvQ+?W43$*tK)`uY5j0@<=Hdl>p5{qUe2%165poO_b^MZ5`QG&JpEj^Vi`yD
zH?dz=g^*z8t@v4S0Kd&3i!=~w*B*|MOWhs^LmuD#s4tFVs1x-Q9VX^u<K92;U1bh7
zHnt=p(?SUUK(!Hl{2PxEsol=Vyvtt^`z4_4S?uV^zHHU1LTAS55mYRRarp6-Z`9)K
z7^0Lztroo^5#nfbG=UV|b^OT5$@h>l@T;?Yo%Z_g`paW3_0Tcsu&Dv=Js;0cKC;9I
z<cx)R-AB=8qFG(}rr{R`&;6w;+mCM?4yhE`ykora-6TILOZ+`6C4h@Bfrr_|X>9LK
ziGz*29ZukdfYtoh+M<k0+uqx1hsPD&nQ~L5(Rb=tbPl;amOoWBoC{lTO7g+DL#i=j
z#+$~MTgz>`Iv*B2JpB1{4zh6_e|*={dhLAQl17a;2^H?HvT@S_82_{~3Q4hOa<*mo
z?5g2iJMqz>h5LFT+#?g!GPZg=zx-+m{oQZZN<Box-FI3%&pLM4ox4)z+Wf8JS4K^O
zloKIjet7FfWUM1D$G$9cywHD8A}4=gX)`;<+~F(=wL1T6+p09lkpNvE>eP)P2U>?+
zety{x2S-ndtDL#%RKptS0-x2mecRk_(>vnQ_6`=xmxYGACbkq_3e{$+r!G($x!aL_
zq1MvbvHs;Y->8v+<Cptk`D56|`nq}UsGxTn%wdE$*PCOH3^lXOcy{O!mfbmNb}aWT
z{zae7?q1&;H(Y7<oc<`+@O{68#qjY^IVBaP*zXSiKBrG*8E{Axhx(&JL&KsB9pVyh
zmkzw;WboagT}vtmBai%ASZbPMJv=_L@bvk!hyZW04aKa|MkV1Dg~w)Z9gjtdD7D|L
z{>9Fg#aIGvYyIi<c!t%mkpatOU*F;JT-o}+K2t(BUnOrl7#K2Yh71k6n^savgzr^w
z9->EAVD32suF%l2MKI)D9TOwxCSP)iRIbAqw=KPD=g_Lyfg`O}_g#hpM48&e*MD&3
z*4O#3yUo0rvqs%M-R9S*Qu}lIrxJd&>SDT$bo=}rPA>U8_vw;HCPr#p!{tA&40dYB
zN-D&B`)_$=XZ(YG?s*AJ{PXAU8~Z&B`<ntjY)M9(P<6DJ+^fy9R8WY%F`bhSF#&v<
zr1;fi7PXBk(?#qCD;HiDr!X$)cppSH`a{=R$i$380E1sxT#}lPf6}qLJQ}GBc6<C*
zvmmKLVzSFCvBfSU*eEK~Y5V&d4n;gc10}jkcbJr)%Yb^&+SwlXVM~EUK4#5fV`HU=
zM+I(`g}QpuyXGUN%(FK*Q9f?UbzQ7C-_8;8MNP;;f5ai7iAL4)$Q4XaSlh9L;-b=X
ziz*(>l-I^-goa$PetfQnN!_TzA^H+ZP;h(pg*Isnw_~wM3^|1CP4l~*3c$?d_0?qt
zv=K)3?4gW(df#QGiR^uv>w<_tSLVknk5)CkJ>t$b1H9Q$pj1_uWe5|B#cH;OgRKX8
zB#XAS@1R~s#*N+oIvMb)r#UP+U->KQoR_`*rL%2E&R33Wc)$v$EDO(^)aLv<??`+{
zX=Y;8SJC~d`uFql(*r9Bww9V__g?E>cysTe#Kt?9hjx=SHyhfgjX9BG)<rwoL%fuc
znN(F#@wZ@pamel8r@27z$n5gHUd&Gprq@I3+*_?sv*0&lG?=d3A@Nx|at-P%*>uP2
zhb__vSr5GP@>z-73%rf}FH>027UsSYPJ^EFv)6BziaWJy=3u3^N1OiZ@V^Q@CYx<;
z3NRz0hgH6Y>*+xc;i+cr_<Wef-{6M#lWF0@D#^W#4DI8k5fYml;+P%p??n-e)O2B9
zNm+%fn8m#debE2a)^6V&EqM4KYt-c4K&_njq$-d&ho$_itUuJ0?%gw7$y$kNWRLd|
z_wk-m=J;^!dlb7=cJRsqrPqY8ZRXkEUsKDfW7pfbeI8A(H8SGz-`a1jtMt%<!f069
z-g#t6VY~zKDfjXClP}J{CeL!(Z@#<9$BPnx#^hR?LFJ`enHj_cGjCyP<*&J-xtj`m
zbq}=7DVBZ3E+pq;`nX0U@&0%X*@^1bSGYh2sRFFt-Kr7`^r*Pw@ZJU2w$|W<_Jo*#
zRl{%Jg-u9&VW{%2j8Y+^6UvhoOjY#7sl$h5DZ#HoZCosy0|J&_iO2G7_m>E1>6!o?
zmTNb30>Ry1rZwlKt^k{ncg+MSmQg3_<Qr{=hh0G?%Cx?6O%)|2W%asr|1nvYfGp|F
zouap&g+`^)%Y54E4=ilq$s%~@N%{`z^_1=2alSv1&u_(00z@=qgf-?AFM6_`=x_h?
zVp}_;^B{*#?CF&K?MB1%Zjs9Psw!!RrluK!=+fDIfL%nwqj;9i$NI-1`-o!u3fv!%
zDx^LBt+QNC?S1zcVBf@C7m2G10k&o`m`Bg)X24=iu5yhCZ@=)_#}!f^Fc|5TFzE1|
zWh6^p>BO7#{h55G)rns<9K;xhgK{+zT$`eSjG~2d@Jq<XUF@M)4A;k3lbTx<yYE*g
zFV4-WJa25oSX4e-i;_lv&pWW-*1B+%@c7(G?8A13ow#J;OcI)3wN_=@^2ty@z9VJk
zZ^ypRG*{oo6?b1HGxS-rgHBH9M?0_ReQUhc=I)Wy!{ePrE|#?OTQz|<D3*@y1FwR+
zYfD_w&*=qc60ttlR657*?S`4c#VNa?lL_wTnA_DPDN$O9Swk{?d$j7|wZf5(R*n9}
zGt9ZBEK&*zsMIl9%v$F3RQ;j}O3WvW#5fXQtD+eY5HL49yp}6vs!<vLQ0x!E{k16a
z+o-`Lx6x{1+@Ps0C%S?j;?N;2@Mw9KFfq7eQgLx|)oi3fV0^GdCUu4CHsR4(a}LNR
z9ycK~ZeXCy5yUy5tr<{wfLYNzrXeCi%Rsy5e#MAyoRh}p<FB?_I@-sLZUy&HZ}d~g
zcuFsuoaEz^n)IXBN<jmK{q+ms4D*w%u;KS~8~rrm5NedP1XM|$@ECFP(^=BDAvf+T
z_2NC06x;i09gZ!2r&;nHOcK6Av+HqPwZ1Ruf_R1Bs$$LJ<0P{>sS>-ewEo;MF|vHG
zrE>jzaBiS)9NkN9jk<U-Ju8F*f#tDJ3`69s4(bA`-TaxYM>bWgb+oIhadqY%ncl)C
zWBs4GueRVCq|7{Jk;OJyLe=lDQ)w&>L#2FO>D{qwTP^4wyi+B0fLDA!?L810xmCZE
zs*1hUT$(#^NY!v?lP+&~C1d&DU206-%}LAr{FPtOI%T=rkyG_)<KCFZ2|hGUd;*&`
zR?0XyTV~om<M);jPtnoQGF;iVT9&7{duO$uZ=k&^oodKdV{g#I#j*OzQ(lDF-(D^S
zQoQoLNEienaGyc$SbRy;V4<7g%DG6u#pOdov=t8ih5^f1mq8N3AIF>4%4R!zc~i9!
z<jeQV6m~Dt=h8yY#?tSw*%LhfonT?v4O0qMV5!v9=fZY2N6(4cRid^dfc?XmC(>?B
z0myN^KTh(AmE04WgyYxwk)({&)P`X-Jdh6JGB0Z_n!l}WKS<5+UN2X~x9a(xIY<_I
zGA1LUSffbJTHDSlJTkJXSiSi8@x^iM7p(8nHxg}al275j%>+<lq?|(vE`ueyRN<f)
zg3PZ{S>`N5&V&SLq3A%+^U{so`yPzkN<23zrP|$_(7@lH9dzi(u)VuV!gl^<l34&i
z6s^}W*rtZDvqV3vP@i+!nI5_%LiKk`vfBKOYPm(qbWRAdl*$Su#JV~*rm|{~$3!~#
zWUun-7hgtb@Tv2M?izlq_K|P4IQZZdB|9r1Cf-w;BJqOPr0}ZG=A%cd=Ql<7UDsl^
zgr2o*?JLS$`(~YT9PVeJ>w@H8hk=w(OAig;t69G_x>i45$6I=z@xF`}IHdK)Jlc2Z
z?f%dMXw6(R9$&^clE4@mq0hVhsgLu<zx!6voZh*$%5m0)-f(087Et0y5MQyRO&^-(
za}vJ?-ALUlJr<BCB#j4a&u={4jTNseaz&mV#>*2FgnkPt_UNfclND+#8&CqBd7sTR
zul}7EZPhWX<A^UPWyZFpz9p93U!~CcSB3oLsW-Ma))n#esm{>3;p?g=THPp*U4Bp-
zH(kC~xmUe(({Xnmc`v;hMyQ{6i+QhKTWP6hyfjly8yhf{y9Buq5HE35am!(|eF-O}
zk4+avQi0{ptS{Q2E9@+<k+A`XSq$Ue=-S%+^;h>4eU|#lw(}XBV}Dcci`bd+rHx{p
ztE!WJH2xuop@fj9N8JXGW=fvfUJ8xuiDttVK^C;0>oj+?u!!ACGa{{I`x6eVh1$iC
z6uCZ-6szA@w+r<#1D-svXX5#fmFyT&hAP$CC2hqe7TU?N0#>-3+a4x!8!PAD3A|7*
zDzd_Q%_5xg`9nmp<7o|9+s_k$y&Tlm;)VYVQOq{vR5bc!IN$Q6YI1l`D&iMHsZR52
z;t=@)#3dz=buJH;%TrBh8jvqMXgGYr@W+y@j2~g9&;mRDc<xq@u(n){8X-638A@q@
zQZp_FpGUdX!$L)Sx3e(*sA}b{5QOZ>j#P9FK56k+ZWK0o*%OW9EkOtm40+~6A;E;L
zkia$UAwHs}2O81|o$!W&#5mgG)QaOm%Xu2~$O5HHn~lYyKYV>T214SGMuwg|4syT=
z??WgRAB@IhLBUWrjD0XPGYt!DwSCF==YRzued=o^H9F$!mFrX+M5{Mc7M_J^=@=d7
z3ZmDy#z@u2wX)&Q+Hwj%F(o`-5XRjs-MX~h*-Ii-oj!}!kF<aDE{-+kRuJg}(EHPe
z%z`7O90GQv*XP4`I<ij-(ACj**A0vdE!|?>=?la<G=IYi`a;99!d9ZC|F=PH0~TPD
z0!Q9g^VE7XLZiAf9X2UN$C;%&_g`042BLl6v*!2nOu+Q)+w<$|ui<`m+RHS)(2>sC
zMZfcRySoHLM1;8|FZq;A6bB5J&VK(8`uIw3ujgBSP`&MH|8hv0GR9ngUhG{XOK)EL
zx*2IW8w3*e4Lq}^3_o1N@#wxrR%QZ^uVJzHbv>8m&DE@6lJ@ab$;vo?T@jobZ<W}Y
zGa55eSEfu|(YI`a`*Qg`ZlAvWF)IL}xQWTz&zU{i1opkEmkGUmdyCk(BIIrX@Bi9h
zXLHUO8rY&C3Q&WJo-P-mte!`erd27}Z+X5|^^5q|EKWfXu%nY4;}fo-Q?vFI@-d6f
zPG`;}n&CBQlj(STU8L#2{c^GeNG&fz(>3k(fvDME@TikoW?|ja@2(KL&4a>6QRRUT
z&{OufJmUJ()sR_7b5Vbv;Dbjid?$81iL)#$h++v@QeHvP!&6D=-aWm6{RT{#IoY8i
z@>2M3O>nwJGNqRdPWp;^sQi4Crr2>o@XUqf8P?pYQa?s_B9G(7mrnquFRR=?f7{Nk
z9^z3&(e3lEOJ|5Xa`b8U$L%feD-aifm8gRq;TV!BFsP);YQ<-BV;~J@@EiQ8|MwDb
z6{2L2agx;kNzw&wYKgB*$fx4I=^--?<OD*HLWLfgdQ>X*5j|ajlS<3qhk=D^IPvXI
zPs{05M2vIvBJ4##5>jsvs(!}c&PmAGXlHB3HbR8})u{X&uTkOEmds2e##?YVd^ET!
z`bQ?#|A;H!LXMReMq8VFlWni=v+4>9bQK)7W{3-;sEoof7?`)+jf#*+XI_;a?UpYR
z*8U4#?}zyW#fwUc&FVdigH#c`>wd6ul|OVadaN<tGbYisqt#YdzWL0qOTuvMbB;Xx
zA(cpHw_ng6%s2QyFVXQB8WJsbBRncCbfPm3ePt$hXaB$cdfan4Omxf>Vh%*T0q<B1
z><V(Ghy~+&Mh=Jkry<lH>P6VO<A*-VPE9ooQq%YA!@uzU{udi0y14L~))<t7J>i&<
z8a?}gM1>LV<Y>9=@X9&d@6(n*WB}1~4SDIJxEuqP;stLnz)3*T8UEC&jsN-E50Y(e
zvrt1T1v+*f1M7%h&6sq}72#CKfV2JmKGJg)ZWjXx@vb*rfXc-fb=v74Uzi_dV_`v5
zBJBhJ+yu~gY}X&6ssr8lTHR1&BWQPG-QytknM!Rfw7elD8u|Dak#DAs_Se8QLXJ+-
z0|t~juSV?tfxg;3{)}Qo{OU$m-)Ze^4%F0;zCiJOtG4S<;bsL^_h_v&>04C%r#DdY
z6y3K{5TQ39;LxkE5bJ72iixJvu8YNwtq*iLuh}RPF*hy#Xq;HyRG$w*fg@C2KtOC(
z)>=!xSWgcB(5}1X`;mKny+y0%xlbX{KhHA|5`8ow_Q~yk$lXFo6!0q4>rE?gu=e!<
zw4`L-V{=d}i+{Llg!vbBrND?D)mx}JM$US!kPzWIfnxIYA&7>SRu@)X?w=nrp?d-@
zMPx!HrQUvOCi(R{E=cY5uRBc8w{jI6&1<hY0wt&wHFCA9u9Lln4OW$lg#}Rr6EvlT
z;OaGZub%P+(w3BsEv_nZ{Oh&;2RQGATC+ID!%b+N2C8>r#6-fDUWLg`l+B+Qw#z|O
z;~mCgp=<6Ab?`XaymK6BiFXY@R!mL>1xMsxWN;u|f3s^Q*_6I8DDY^NuV}$5`{U=T
z%L?oD&+{`A<<6W5Bco2G6z3iR7OClf>_cyDt-HeXi_o@XWP>dxRos#N*-k<_5)!nb
zG`_%fM9ou*tlC_g<X~5U5GVqQW_O9doR+WlaSb0Zn%Ug+)Mmn!)cVqzfhNm&swlfM
z8a1BgI}H5C?g>u3<~6D;ppu})a%}wgDcgyM;7w^*`w^4dTfNPg6+?1#s)^>v@2$sK
z3{>Hiy`dT16UYtG3Zu>>AD&u$X~mlL?jF}%MOk|%FUzS9KwYfr*YiNcS@mWbNj8EY
z3!)@5uTL+#L#_AF2u%;TnBl?FkslUk8yiJB%kr8BU~iPP{)MEsk6O<CIkFQg9@ka4
z`<5Io4{@1+6!$qRJuo0(bbfw~7|x+?TC_FcIV}8pU;YafTCSWrRxz+o786F=I3k@f
z@I5zAdvm^MDaqN?2XZk)6`t4kRJ<Xe@Bj0<FOYL-s~vW(xt5T_fuiN^vuy$*hTM2N
z1S?W?Y2ySYBp?7NZ`vnSYM|;smfU}?q?ID|-G%%3G)*ciENE`7Vu1Z0u0ERqC+ce!
z+C;-ZBLv&oGl_6(bFlL@2ei3k3^hm2?q)7d_pI^1(tzHT_MZ5zTNNFEu(19j)xs*S
zWEK{dO2HP=D;YW-pg^+D|1SBFJYb$phnIb>h?nanDE+DU4!au2BwTR;5j9y@5G;+n
zCR)C-CnJq=bT=U|A?o<xT|;B~#{Ad1v;2aYthqDZ$FZwnSmClu8*CWZ#X7)EYilZ;
zoLosorQX#XIkkI+NACD;+}Bky9t<LzNlXnYY!Tfo&5o_h$gr@`>MPtxBTJ??D&v15
zekCNKL_28TbUdM_tE5}~<}O2Vc*k^%Ojj88wb~j$qSU>*p^I?>6Xf$U4)8f`uN}8>
z0@TQt<sMp5SeL|Cz;Xon%5L|rHL7W<D%CTaCU7A#I5-btA=~eI;`}fZBJm#L0Q=9J
z8D~z0;{#`vS#F8X7acAJ+YN$)s)u!~*Fw9Nk<o~ibV==4?0nWtY$P8N2?%3|$k*xn
z{Og<8j2-3#@f{(Sl39WH{w$;puEntP;w*DEtxo(D7oq}CFWAjzA9?=A&=OK=1pP9s
zaE#0R)WtA_R9fO1Xv}4+<~3PdB=tVMPCQP+1*)lrSUctQ-b0!_MC|<FwsShDrIi@b
z&P8+!CIpGxj*o}Su{gY2yP4kR*Ka&sy{B7Wm#J4@j2mN58+CRbEhNT;B%nb~r$wMG
z`>VINH_P+IUS64-@O*o7HzgI74V2giW%5-^Az`Io>E@;~vJG27G{XoN5TIXesW-aW
z@eGpvh22f@q<6I3%Q4o6AVh0>CBb1^XzSyTC}^;&8xq$A)YIh3{<jvX_JOm^arU`e
zqqkt>!>o2(NZg6%C^y(`fM5|FGX^8y{5ycdDnJ~ebtx(y#XYiO`a<P7NZb%T4piVm
z_x}J82#S9*FQ#XNAYua4tN1soU>y>5Dx@p(Xy*8qHdpdX>S`9O<sjjc{Rp@}uhm(9
zgn%5fQwL29@DL9RON?3&VvEww;UiS*73Mx~`)!2Go-03WODYW}SYc35=@GoNP+I9|
z*RleRhyHo;siocY_irWx04VIhtRYG)2&7~9T>J6wS)OmN|6a+8J}jnTEAu_zfSdAI
z)p0CYUkFIoTN#(2NXdAq!kPIgm7#}5+U?O`BI>IA2<7ClfKZ@aO1jWbQz+uUw^<;9
zl0p1QHn4MPUpTrYi|i{RbP>_!2(UP^dm~=|HF8VMydfv?Q8D6j0eKpdgX9@Zc#7m7
znb6;!-raY{K1rSd#~C0Clf@;n!nlz^7o6|4-Sa)y7$4NTFYWoH<#eyNv4QqGCvVg0
z|MN!`dyH=3$mjIzY=$&SaAkFF;N3sF3F?%nr^S7yFQBVc;0`%EYv+h$>uFy73-O)$
zDK$a82b&74fC=lQD<5!XubsTLz;wq<{QMhK1YSW*8sjP0!r_a#Ibn7w3=D5uYe!f-
z&)pHNJYd~RA|k}eoK157bCqe#+|m8vwHpxm=49;Nd!?JtW=x_C{feP7m%Kli_g3Zi
z#e8!`Uy!T}Ee2~6coLPAmZ2O@vgm`ru5kb0ndaYV$Z!mCA%#4>9y8Vf;usmj!ab0r
z2bh`7`|@Z_pYV&n&+RUo;h0nyN(Qie^jJqQ*Fc}QmoZ_lz(D6%5w(fQvG+GT(RE!1
z;;$hfzui6!q%)B4Yp5&Gc}DAKI{jV_T`{=UHCp<#3Pu+e(-S*g0)9LBGiMH9=D4-7
zE9&V!U14_lKVj9Ce}_;II2#aaLL)F^fTIv%6o_vnrC4BOTo&%YV)kMG7nK5%n{*4<
zkzWWx2+EKmJuMR;?0nOxD>_MyY4^-bksr-s-`JjBax!8dK43rQ_o5&)?Ep6td-eW}
z#$hkdx@i3}Z#5+)#7x)0AtzV7v66}I3d`oG<h}YEv1Mn0wQ}NOGnglEp)uTqcn_6-
zW(H-F>~@y3JzUN3P}OdGY)ojfw=uqW@eQBZy>HwWu#XT{u$biyE6Y&V=Ki)!+jm^G
zfH`qX{$U}tvQul)uJ@-@Oel23odPN%cnZOj0~Q2{l#TM3emvS%_t9oW6Zh};JD(7J
zMZ%t2@jNidDh95uh!@jd7xNEwG-b$+dA?WX72gBVWym5Rs1{LObDw>ic^gTXcedmy
zdVU|cu;oh^LlBXz8CpGq=dT(*+sj9L$2az>)YsN*c#RP$h*t`5yhgSUi1z2+?PBh*
zXSGpsXMHdm>q7n8JE*N^pL1lEFJ@(B1&GL___r--F$`1Hdc=POoN`OkI@wZR#$c%H
zG(Z1Y3U70Qu5hTT?gE#0ALzjdHyA#*U<NIYcW(U8WA`NxQZ;|AF2T0T8F7?)xaxpz
zf$vx>7&N}i9dm275l}=v2w;eFLO;(tc)b+vAmv}gx>kwSeB9-X$k^N$#4-TDz<Lc-
z^Y*70fn0DAI*j5O*W%>3Nedd?IUx&+*<P+s7cI9;xG=B)T}W<+cT1rg*QqZy=fS(t
z1t$luPzDSrT3|~*fJY3iX#=@oSl!EkOu9m$u%@az|3N!tRf4#6eyPMW!czB-l-74A
zQe1O2d8Cuo{Q<|DB{1$?790k+f%Fl;F3S{eM8@Z2BIx|@{-o>IjAfjRkt6(`P9q3G
zf?(Om^eKaD8jgC$VD9*GmD0WhP=Hx~W(z1`BbrV0LVwC35?D4t)d%-ekPi<^qI~=P
z`9q|EmARWG^U!-lr=smmHyeI(&{hv8geJsdOqVZTd`wY;VE-5hrpJ-t$fE%IG8kn5
z*J7`pTB_X3E0k+LbkfWVqcPT73r$xb8Grk+)0QC6B$4qk=(+n`XTI2=oeB#{!P;TL
zFQrCLO#j2tH5>`8`@hGFR!_YEvoCu5eW+`08gM<=ae3$mce6)LP7Ekw%uYl^D%aOM
z`Bkf-kk-6{Fkf6#qh@*t2(n2!;4;tcEL;h0SHo7}KmLNZTcX%Z<~^jQt}y*6Iemnq
zYfhW9Cm$gP7JpQtC#i`60f_O#UWQ(9f$0UJe+%-Jr{%<#T=(mHWuaW}8}EfdT&BgV
zDX@x9PC7gu8O@mXby*3jz!idkGAb#ZWC?6t+43h8DVt&hR)o7K#Ox!T8rUNi3BtS@
zZ-p3J6`UVjGE<G~r~qx~Ccb19AwZt|h2tyo+vvIn@(`#n+H_AKiqwyIza=)PlZl()
z?tH1o<K#s2?Wm9zwj%zw%pkwivy0r58MoG)K3!aX1TJvmIT5Hkb84z<wi6Z16%9cq
zD6(mS?EM=qEv>c@wm0z(1RpWsXm8alPlsVMi0rcU*j8f21>xcCm{LN(A#z`j<llM2
zft#_hYg<E+kVTDR8~%Z&x<+T9zp-?>`unBIaryk!FI{Hr|JV+HPU$bnf9T+~7|28t
z)096^d8q|zB5*N|o%{6~ih;mR-#)I{7KTv1m|D2(h>>CT@A32LSpk5zFYv^GmIMGy
z%ySzI8@pb;k@rF^R+X?E;sh`OH;S-#;5s$qeeQLlEGba_Dt}Jmo45R-n@G#ZNWB2=
z-izS*uq2JiSI&(mKs$uA#9`8mnL8^*c7J63v#~~EuHO=jlw4nf?iHawz{?x_Ve3F6
z=z2k5OqL>Z)+nIgBgyB~r|ng6wmzB8acut8r8?;aWL_f}E&Hk!N;G#)cBhcFWZW{4
z?ypNiki@h!&71c~PpRJWf<`c3tc&jQ%$+BL8>;<T0eo$~0`c;n<4ZLC`hq~PM%!B7
zl&it$Acq%r{E%Z;UKcGG?0R40DwF%B!cD!=o(bEcwWdtqMgI3HvR%P^8qAmAWa{Nf
z>}69V1jqC%Lya9HJNt(OBn!zELh}Yg0%v@-R>=s3$>e44Qp!t<`(Rlw;s4=k8S-c2
zYB`_knNW8h((rX&)sYKdZoM83K%CtO2i^EQ(wGZa&L~|JAE%54QVL(+0hNjNA&oZ(
zsLn?4Mnk<U9erht%l3dy0?KJD>Y-9_oFJ=_ni?@eh|7ExJU_qYSo1Lp)O`vB@WFZc
zbmt?W7qR*rSOIkkL4KsCI<3SvDs$Gpkd=zSUz6j$mJ{VhNi)Bb)~jkBr(k7u$e0yw
z_y?Ei#RgHvn1v&#{!ru{9sjG{E1IVrITIekE;GbfHMZ@rN{6u7mr4u;Yj!Gqme7`I
zUy%_VeK9*H$YgRdKmDOY)?l&N_;Ag6)3E|k<SWbqNPV6~HuXuAXpQt_*~yV=OJs$?
z6NHAACu<b`f3)U2qDeW}j~p|)#ns>A^LO4c8~CHwN<$hEv?#T5j7q}ZH>_QWl}5-6
z2SOC~FqUz^oha9a#U%n^)+O&t@cK#2Xc^Se;#~l_g|#vWStVd0$>vbqh1_*iB>~_A
zaQGh8UukxGrVE8w=@F>;ZFID$vm-DldhTL&Mo@Oj`Fz+@mqms-z?%~qDVdG)Fp@&%
zA2LmMd<<A%S)Pg}b^1jOS32CD?UV9kKcQ0UNqGL2Uc;10pGPdG#9|>v3B}ucWa@Le
zU1+tYLfJuQXA%%a2w7x~#M<Yj8sG5woQt^jlm^=Hdv)5<%Oz67KX#dNS!$)yt`o1N
z^9f&0j%8bh%nS=503dC2a|Q+w5Gl=AhlNb1h9b~AW<&~)<nbQzfYMDJ3zeKt<-<07
z$GdzsIAC-Fxf+I^a42#BD}j(XE}bF)kXw-6d_F6yDd;nu##peBSR@3{ujdxbW$5SI
zT8@=t!Xp||n8!GZ7v!0_H}B=`tb9#SB$7Ra`ueF@6TmnSsri)!a)40Ln#vyU;<W%4
z1BSArrStQJAd!%1PDn_F8)?y?Sxe!SZbB4cn!jSC(-`>e<GRmKRo?=HZ&loQiOh7g
z6hHUfd8cny#g861#v)qg9Jw}FCg4~X6(~CSSET}X3#h#$M8FVXYsa}_#jxJ~R}q}q
z`y!pz<@gQ_d(XPGFs<MWc!bzWg-uT4vP`=!#ZCVWc}BHSBPdf<Jpg>uX?=}|V&ni5
z9V;Wbc(Rd{<?==juY>}%V&b|$-)R0krOc;e%Q|5x2?ibbI&TWiRD<;7xRONYU5x_5
z<n!jYfx9;JXG5h@Clj|`HusQrcztgz3(dO>4(E1yUjk2}{jKTDT(C>8{d|EYz7l=c
z&HKz03W{@oR*;!+G#~Jo9=*>yN`~=DMY%pe=DuzEE9=jZ+UMWQZpXiIqJXpQD%<_T
zfHrFsNXcvS$>^l(8XASeoMYLlyZ&yZ@s5eS9N<v1d^`9sgBzJNAqS@6@r~+%RrFT`
zNmYc#`Zaiy_9OqDIdER!{OZIDsj=}!Fts60D_?~lz0&;qmiicO^C!%r<m79vczDVc
zK2S%LR8g>%{9}B6j7$mWhF)#dahuh#f8vLFMs|j}L$5lBEHq|(9Ct#T%i|MMlDTRk
zFsan45)z0U$aDwd&jy9FKT9$uF?&^%g_4=DcaPsW+wIyCYpqU)8xFU$A~%n;E4b+@
zZT5-c@j<vPWrXgG-nwsK=A)tE^@v#HK7BSJ7-3M+6e=Co7~QO@z=vSrv&<1pT#!9R
zy*eytixLSTz)DzFZEeB!Xp93yDq_4s3wfc(gaS&)otD8x0$aY~Jf=uoolf_mZn(~$
z&@@|ra{+;FIuhxsC-}IeWY~Ov79zTZ6sk&g@C9!*Nt4~=INj7;2aG^bT_tqeR`1(N
zj9E)SS3*bcpC5&>ChI;{@uh2daF5+*-ja#<wD=er6KMlsw0C64Z`b-huq*o<;59{t
zqQbzAyyLd9zYFBzeR}Th2ot=Nvwjb(yx}3G-oSI^PrQmbQfcxy)ysW8*`2%*Lk!=0
z-Eh;GVn9E#AHmhzE?pAHoJqKiwgLU3B0s;6^Hc-UFcs^U6%iuN;v2XId}T=}Qc<76
zg+%WaF#rp?f8`y^`J8w;yP`T`R-_)uDN)#!P{$v6TGpj+GGd@&0xOqcz#IjhY4Z*X
zsrq8o)4$SluSiL4Kj}!J70(u4?Vkcm_i>!Dr}sZIQRA|Dv%t-($@#4N<2D9z<!8q~
zo!Z_?E+p0a?9<N4wkMwWwnbl0<JVAM=bq*4O;?lK`Gmta?>k_bT>XE8efZd3-EXd~
znhu5oIpWWAwZ=T_3-x?1tEA>X@p3kid+ajmI38hbcRU8DEw~A;v9ft9Do4HD`af7_
z>tXV0W3Qgwo}O1b!=EX`HI<qMJ7d&mI|4}oxQ+6W=SXp`jeR>V|2>>Vf4@w*D1&H=
z7%zHcRh?ZrT5<lu<-%b%ogG)Uc9UccB*{Hiwon!aYDqubgi+y%i;Lm5NQ<c|Qmya`
zGaKD6BlaT*2HO%eq=hCcd}V(WN$2kG54hEb)0CIW?vi4dh&nyq{8_Zr<MXBCMOMJt
zm_a0WUzaGQ0lMz9sP>6`f#9;8#kNBvu>W@3C>}@N94lOPsUo$!(bR~FJ~OPT2sqpB
z%^txY8fxfdWosQBn3)rttRTdB-z+Tg?F@I|@x67+R#bg%h#$!bY*mS=h^?QH;BEag
zHUHxhh-oCcrP*-Ck3JuSIIEpD<*lo9v8AZ3f06F~D+?jb0wi9mxRF^DVcw+3X5@b>
z#2%|mL;FeNXdx*S3bBPvRzQ=Z<Z5Swir$(G=Wv{Caui6&JpWL+KDVRl3RrJOz>BIt
zq(MXMY1l(S+y$C~kqDF50M$IHEaNJ2d7ogYK>&Ed^K~j|#ikvQ`H4NpQvpd<kN=E@
zqEoh2C75V*0E24_M_8|trQCpb3*|C4cdHU^jQzlz<{nP5-JD1+3?ue&kMr~24n@Yu
zU|{c4vxHqaF3^f^3-EA}#UELJGL~PYTdNm;C<UDpPrrOI#8;lS9Nwu-K+MT4?+@pf
zCrd+Hlcf0oFI}_nrAXBXsrm{M4{SEge{9zAN)@RMl);ci_(&}><+s^`s|TyBisDY4
zlvyA$XOr7mB`tgleQ7K*Oh!0`sZ~=miW6{$=DOU9&~Uy4+rlU>d6gPgH6MEt@-WO_
z<Qmu>Zig`#`)KL*>x)`X$^>2@=JrPvOevtWT`n0$pFpNcg!B<L<a=jWF~K0;;Y81Q
z=JBCq(umXl)b2f2tq_(HsW8p5+9uYW0cGfIc-Rh}q#4M|(`|Hl8<D@s&Iw^~!^Ah%
zkv1QUJm(dz+B>yqlWHWrb$2c6i&wNWb54p1PfGYx^;a>-z>aixRN~<VED1~+Aqa&H
zCU?mc=i3lm$oNz+=CM36AG|^0<R9Cm4z(PLo=Xw>?g7s2&}G-idg~f1oGGrY^Fb()
z(Fzx>`RuG43{IJX>*}ZFau)o;7izbF6cVo4AZpXTH5P}CFW_Mg56r!f41Y8$*Qp@N
z?{7QB$a_Xqz-m_~0B$48y`g_{4pi&OdCsmNPR_|;WV{pxI%B*x!KX?(WIb=CqiwV+
zUX=a(ieg^B&%u&kWTomgPh%o(;Hklj7c}~Y9H3uwY-UlBk9|+HzmJR&io|=*2QWu4
z5T|2Wg6BnyUUJRF?IEyj&z5zn%Svvf<m>O`1T7-A7b5geE=?d2L-)4g*ih$&=Z}vX
z`#F1eWd(>7WD_~@FlA(<2TlTcJ*rMd<|~Oqhi!@ACI>URJVO2S`Ja5c0tGU*f4zn=
z9PBt(?He-9%wnp%Yos#XoZz9gN5*TEZ-Ex?vs{0cccB0OwF-agK67bn501H@9*hhw
z07a3~2ivA5zS~n7nNwNp*8gj*wR1}baSmMI^98t$P#HdMtLFvcrW;`pswTppS4;Af
z>O%N%Od&>R{-U6I`Xf~XYs5+C<=EmV(5F7zHywa~*if@aPzP)tyK)RT=SO}<D^?Yr
zg64{Zn>KyFcq2kYQ(gh_u4KQANCfvejRCWZSiQ@EVE;t@ypaI=SVeUWSh4b(dt1Ny
zEUj|ULQnjczEHJl4t>~3U$^-{IHv*@G|_BY-ggi^><N**%0Ln>a|qBd9t+t&uEL3~
zH4Qe?mU=`2TocyrZq9@|_Z-PZW_x{Wz&wQOggGi$4z+bT#O#1*?=7yizSG%A7Zq+J
z%q@FKc9Lg<+*Ns{Sj#4}XE09m3^CnRov*Ki@cqL4gxmP{H=>t9CA?}DiN^(A>M_PD
zTpn!d9i%t;JeP$*-jL-R&BzGfXT@!~-7$a<hi#9b)U#7dO1cDI@Np^1Ouno`rcw~@
zYm&URp{CjJHjyIGcbh!6kf)eH`2^{Rv73&Vzykf<o85FQV|vFwGXAD@T%y>4!@;NH
zw2jWyz_iZxb_2h5b&)I#uSuoEvBJ0-GWSh-(<jKe<>epSYyU%GKaaMoPpu9%2q^A2
zfxh`mA}FHhfW(7?{a?qysN=JtJI73CY_(=~;zLPkN((1y*`z>U0J7&6ql)hwAx2TE
zMuDFGsMLArSMNa02IwB(bd7K_fzHKip}1Ti^nMG}4FP#Zqgu>>)W-VicL1SV2nZeC
zw^tYCI0Dne<Wj<o^eJGYv=ut51;+zZ)b)$j@5GPfNg`(RofG|DvgnDt>k7tHFp}A?
z^F)vKH`J*jm~-$Q@!3zr`<~>m?r}>(-4Vczz`*8AyIx`ihxR%~FC5Q2ReJ)Ng9@MP
z;Cj2UwRmm$``jcg^q&`cV~eQzz^wzR_q2h+EfvC|D9+=xHrAUk6p^B3mQ=AK{m`$E
zcOxpGgn(oW?EQleP`@_%+Z}tfnbV9TJL)ERTG`W#o%5z8vu@6=S$l8rEIMam*i(9S
zf#sw5I}3+G*AqTx_zfJdXfQ_$^dUlK9LE~(Xvt%(ckEH)4j^|6<nCX-rj2A8A8Mz7
zuN{|I=FZ0^bw|o)<b7>V|Js6%=Sby!Pc+ckUQM0F{s6h`=m_L8{VQ*{j9oG(xNzIW
z7IeJSdjs$&0U+dJ?y4)hy2@2deNQ?OZDSF{{2b3cC2Ix-#>pi!AP1{{0Z;;MEzLOQ
z=4|XviaHr>c_8(l?2$@-kcXjRa`a}vz#YW^v4d-WIWjq@knWqE0OMWs<@->5;Btl6
z*F$RvrpWS)?Jm!QgAcec1B(r`Kz`nkw;8?PG6Mnv<vr7?j*lhsjNCoa!dVEVF@=P*
z06fl1oLg9hJR5_}_M%>lMsR>MWODZ(8Mxifl5gDLD05Y%_#_j3D*AhpUW<fCGK(xv
zi!)b$>gE&g+qph0`B%^bUp}Q2RvKp{rExBmipcRIGn&o#+>y%4F8YWXZ2gkmtuOMY
zzTJ1ow`<)nyu=ro%y%wC^Q@eQGh?c#Q_swr^U!VPncniQH$sRD8fsDKP5GXYTZp@v
zgdCP>34F+Jr=@a&+2M$k%ysCOl~Wg02%U9zuy1XnpE_gyBP?5BAcWi{hMu1O^$Mfm
z?N)wIl~>{sv_c`H3`z=Y*^%8X3(q2uOa>Lhr*f@*w@G?MtZuileN69t9-tYbctJsQ
zJL*xKl*v9>-i;rNNU>!Su1Ou5MqCp}y;P8z9SjH<)Y9ebbTDQ|Jdm&zgOsiRRPYxA
zD@(ZTRS9_^IG@$t9fjwzDJ75CXVqN2ivj{x8k#xAdg77WHL`oVPJgjE`<{&wu*6#?
zq`NQ_@n&^{P14&x=N!ndZcUx-K5hoP860UE;tOH&&REj?HgYH_A)|v-7|XCXTg4dK
z61lUm{;3N#C1w}W`0NDK?V@$+YqTzL^Hd*_O*PgIf4b6jHAQ|!l*O(T>C0BXouS&*
zH|30pRV4Mj;q8B$dW!zbfIJ=V3FCuhCCa%EprY=&pd)j)mD(y-wQ2AafU_bECd4^%
z?7$jvz`ro5N}RI9^Vm&UxkVz*X{6t~=RFV1zUxD@!VW9?-j|$HjeKC??+>gE8rgLo
zL>|{@)yJAFYV&RNM9co<-u_VlkA)D9^;U(cfVt1corr2R<t!Y$ALwZI!(0(g-oSvl
z+!p-@DZ!vPhj+SOY=~ghiZO40Q^Wiav^&hthbbk0dRnMYQA2NAIY8ewLPq*Fc^D-6
z4pVwy10POSOh3TH!ZHy0;be~|y|t;Btt9_cq5y6YK?{jPrFb_}tZ0U9&-%eMdqhG0
zetrNM@nCx?5E6CMQb{>gbpQrj?_6dDBKYpOL0E4JClq(?6r-BvVKfrvyDf$0rkeC~
zh3&O{jyo+W>awdy7ig=hc_SU_K7!|nFt2ulG<U=%GcNULUvV)43c?t=!ht&qD^*c_
zzTdTE7NDOGLwl}-LQG`ev{lnd7JYju?hfh3-NW5B1jhB&Tl`tKhdW)mbNJs4-$Ggl
zN+64V_Rj=U4`G|`HOdx%tp+gpi8D4o#0I@rS}J)Q@{YQG-FWr835}TQsyZ2qJX8Vc
zb1Ebr%-yp~-j)X?vw23=Dy~~U>2p!WRoFk@fo#=2lJ8XbwlA)fu5jVZ`tHu*Z}udv
z?=h%yHbRo8VKLx4mBLOlL!G{P$>C>13&Oz&px?FXHybUPgRhuPo{;ao(Exb*^G!T8
z`?fdBiVK^MVt72yLG7INkE2pI@4PkFj{-Kj{BOf~#&eh4bLGDS=EOJM<<49Mz5(2a
z@WtLdaBBr3UI%}@+#8Hhpu6wp41sv0Y~5?|4W32vsIRu%PHnT#*%^#}JJYb1ci_n`
z_hQ8!y0^`Uog$&UOvF6@GcIv?AeUz|^Z+-aUm)eln#^`)MfhR}kHv?fz$YM63k*CK
z7PXtT8oGNocJX2ib$ve~O~1^!D8W|*i}2xp(}!+RmX+$JWAiiQ$qILKwmRCxkc!@I
zinF4O%R}+&BubIEMC9Y9INp7NQf4|>CX5_4D~n=?@&|0d$+RQf$N1@d+-c05(Th~S
z(Di=DG;Z2gr>${$M866jj{BbEh78ojs%45L+S0>qVcsC_jkEJZWTFV*v~~u^_jG6T
zKeCvit$UNTTh0&d)fHq!>LuWCVR5mGy$R{nj7AWP8!4^h8ssXZE*d+7GtoLuuo)S^
zK~O9lpq2<@LH-9=@!<rBg9-hzS}ZKcgE0`=0yHG|CiMG-VUFpvL25D#j%a2^muP)?
z18tAgWV8#FtGm!sbMC<p7?U)IQBI*J66rnos$7ZRng4C!{T8NPut(4;-NtWau9|7e
z$x|d8z@{JV)D9A|Sj7SDV-X++f(Y6O$eU-M?+$^6%aw~+G*n{5NxA%dptu7gQUawO
z=Cy4UjHFm-Tu*oTqwaSaM<eC}YThT~WQvl8ewV*Lb^q8LshS3Zu=d^Y2fNh#?BCkR
zBL+0rW0y+pgIc1a!}~2}!z0;|hZ*b?uC<4E4zN*xkM;FfSucZbYi(&#svepT?F_~A
zoryXhpY48i0ka;M%}@f>=3>s{aeF^xh9XP+Ti!s}lXjirbV@8cOP6SS7eB>B_Q8*=
zv!l-Hw2?yLuwegC`$gK$%2X@u`MQXNyBS}PxX|xHefrBSKM5=b@4#NmfpBq?!#h}*
zj0Ri1z`~ji@P@GJuNUh&%`{P`?M({+px<S_bafV)B_{q*_iY;2H9Up@zieluA62+I
ztx5aI%6Bu}-YPQ3e`^z&pMtTDa5g7|s8jRD-Neq#_zZ;bCOF-%05^fD;(vY-9UacI
z^RL#f{epQZ0j7T;062j=(bA3EKH`UTZ@`e-EYeu}Lh1YMs{c>_4b}6-+G-U$@!j#T
zz-O_&HRqA1rXWL4+gmHI&YlYUSregl*QYFYv{2K_y2X(OJ@w6XFaM=n{&=KmwqLX=
zaFq9KfZ4+QW=f>4P6K_qQytsIK;~TFK`rKw4+h)t2}EV2XNMws$YJz_6c-^vl;d5*
zjnmtkN-u>6Xu$Ip{%di?WgBqxsY+XFdCZ}jpu^!WIMcm7{!rDX(!GQg8Rh{!&T;t5
zC-t0J@H6R!akImaR(QV*7KlSgOKJBC(;qIJRvh@hEh+ZF;j9-3AMF#-c<)O<K(2ZM
zD`3=QV>kMuTes);4anl=x}0Qwo)-2rZuXrgqs_EJ=we`rt?#yjNiVzu+2HT6DK%Ce
z-s!@(;@-Lbygx~uTuAof(T23Hsd2-5x@8OTH{ZU6&Q7k><6bwEI>9H~CLNx$&eI*g
z@t&0hp;--!?XJn9+Pv)=vo4HbL(8p+Md7y0QmiFHbf8z$c9Z14|4(~o{?+82g>id&
z+8$-5G)mFR=HP-+L^;T?1W8*~S!BcoWtS9a5+Vha#Q>SQ6vRM|f`W)r7l=w(3kX7p
ztw5#)iGUCqAQ=-DB|>Bgi!o&G&CEIVFPNYB0|+PY`(5sR?&o>(&np{{HJmL8hi@b`
zA=!*PN`y&-$KeXkhH?<~Oq&+O_H};zT)LtiS}N==)8fU+rz&E}+Dx1@Z0zgwrijY$
zxQO>n1+Qqy$rNB%2%Kx0$?AUp0<lZHYYWHEVP~1i0D}H$NxwG`MGPxq_9q3E>KAR7
zc@UL#BVNt2*`XpFBM`9TFLe4*Q~tq8MfZ6RV^u;WUS^;@*W?OqF{Gm{&H|o0%*mke
zu^%3LPx;UX<)ixkUHc{JucGb;8u9@Sr}?~Z*uyBk_OyJYrW5Px(5CUWdUzBy<I%I=
z*G_#YM{|(Ln>1iI^HZm4fv4m=>8luOB#m5J#j;h^Z>(c(#W)fw?*KF3dGM?z4ZGh`
zx7fQWdq4w~{o-BjOKfsL;}*m&xTYJ3nlm#NdIu^zBG>e7!kPo*ZSLR_a3%uo79Ym+
z6zq|yo}Nw)`0B1qH;6AI-1w}q{Xn^TG|obh$2FA>%LS*DpL0SITu$zd`{c3u`e(E{
z)Mz!c*f5xaMmwsW87rxM5)83j3-DJai;vGbRZR{p%!m&WMQ*S42x+HA-K@1@KLLz#
zU5`z^5Glv=udhXignn>}Z`0`s?xzlJ_dwrDn(bC_>{q|ITC8`VS>j>EbN)DS^0GfV
z8sCj~Tr?-O-gn#?8!EjkUs7b{Q3Bk??`%bSF}mX2k#}!$PeiziCexjCC#7~Df5TGB
zVtP*jE%0Edp;qPIBicwCm#V}04hq@Ad=8LH=|_9G07PR*2L-J5Ml6R&_rNhK9o)8h
z)Lsqr@$y^V<rgWR+7y=|E(iE4MN(VDei8DhI3-)kpXnoTsDDc9W$l?oX`~@l)Iix3
zoCz|0met5382ytb!;*&yD?O%%jz+hMy4M}`2jGVit8v4!xA+nGQd$(ERLA0>&h^+h
zq7BCzK)VSrO$8tN0$AibEWtiZyvUa{vb;!AUUjldVY0StzkhGik9II-I-;uLvj+_-
zm>`m*jI>(FIo^iGaR<AgCYA?8hZ+EBd$ZfY+`L4xbRDB^wwS0v8<#cy-08Dutiq48
z6j$xQI0vy<yzY5}x6kAs7TMmE2gg#wlBX^#a75RgGe^fEo(X(lxpRwiQjd#}W^g-m
z8i#qQs~p=<9tAkmrg~Jk2l{QG66Y%g!%@*5BWs(l`Zt0VbpM-+O1rV{^|q*HUp7d1
zLh1(*0t_^Nt*T0jg;o>By=TybQuv(phTw9`<=VqYiZM&1EI1hxGyw{8fKFk)wxX0!
zW)iLfnKY5Slt=U%yU=fEF3a(A%8wrk;0iO9wl-f<SL!!6I^l%arToL$B8wsuR?e?h
z$5aeRAptVxBIYRBG7|;m)6@TI|1I0pWL3o197!C6=b*!ZNUnExZK{k5DU4S>^>uaz
zSviz9nnUz6qfxN{1)S5l_*A|lM1PI?Efu}Y%@dso=yPK1c)T8lfR;@!N+6V_u;LX)
zOF=(1G%SBls&4OA_mXzd;6<UPAPW-QxEw!$Q!kwMgA#kye@Gv!U#PkOR`0V|xPuy{
z{l4pA<$)MWYD!`w>-0!NeZp)@E?43D`udsqYZrQCHq`Q}6ZX>6i`R0qD`1Z!X?dce
z+1mPVtza2Jmm6`Xc_<ja60O1pf4Z^S;TaY%Sx~K;6<4ibdDjDh4Z0GvQ*bYmb!A~>
z-(#<Pa8O;@x(&wGRu<r9XN<lgihA9FP?Z=}FotsD8Q%BdpV7^D%1ZsK%x&9c1s=+*
z>D>v<bRs`lot3n$HC>&N0WADp`fRZGy{rt*o~19FcpGasoa8HoMMk#7kHd^59BGOz
zs=D+rcW`eT6fxgk%2m8K*eHc_^bl-da>~!I^rA)c7?O8x%kec~QfP+IoT77_->}O8
z)lb%D5oP!4gNfp&3V8|F)XOz|8rIiTarD^T5Y!o`psBy~%XY62hAX(v1O>Jx346Qd
zY7(ChKXX<MyMWevsw`m%@hjlFvxlfLj-PcUptRYG1zFIh$6l2XI6^}~vUHAQBlIji
z4orrQsRaP4=YjAX%%1DVyO=Uoo)s<rsac*SoAYkb&m-8fVKZ*C;9crDV2NpmNm^A~
zyN-JAOY$j);$Wwf#`9gwS2Itzu^p+7R}C1#$A?TL$gaGV?b(rba}y%8dQnnS=+c?b
zg*-3_bTa>4mvka%#_%t(r8wRj$2PHy5Wcw|T8IUXT|u)tC>6JUU-n_OkO`Jhxpb8G
z-E$8k%fTw!ef5fY%v&LfB+aiU?C1ToMv6I8%`Q2zTWmGFG;uTq<Ihm4j)?w2OwWV^
z35}&#fC@dC_{OKxC$j-G_<~wtjao+l`LtgQk=k%#(^FV@@R<)=0T@%<yD>9iG9YVd
zOf!T1)8WZv)WSjw(=D{kP=Ki+rpuSK!ZXp}a7*(mTU^NYDhatw5fqg6$Pcq_VwVQ(
zmpY}bXQE<OY5`x4>zLqYldX;>9dzG?n;K{>Gc(Q1hx-Gs{6Qd~%UU3r8bE!OT{n=A
zTb`m^V7yD7c)+e}1UqwKoK}~N#;!A}irw9@s6S|kECBEI*)`#Auhq$m!)x?)<@-R7
zaq%Apw$R+RyHyBQCTgwZcV4}>I=92>41k?QPD(u<SZgtBv<~Vr(N8n{dTNMqqDb3<
zJphP3jKe`$L@>)pn>A7FhLN!;RfAvTH-Q~M4K5&C#3r$faN2LKpFhy<CCC2PT{|@v
z$JDd>i3c81d<pXDbS3RlE1W3R)>f(ChN%IO?MzY=)b2_j{tQc27kS@T<e2NbS#3H>
zhPM6GMcTt}GIG9QB}IS5=Bx6i<aS|MK>xDqGz;QG*78p61tD4EX%G-qH}O^+0e$~}
zM~QmXGOqNv=5y+rsQ;0U-VKw#drThh`&E?g5B1=7@?2gQpTf<h7lD1E^O3fX9n$XL
z;@*-j@X5p(dgw>zskQq<f{gIE1QZKQ!$+UVdWO-}fFl6Rjs&;D%>)u$44ChSMpz8u
ztoeQYZj3Gj6Z&Qx>A)b)vos4*H-UEO#yp{<w_BAF2^c;KfKc0J&}@$<&=wcbw^0f&
zNVv8$_Om|BdXw+mBK$T!2vXuK%F|{gPfT+l2J%YSLZFxE2;8wB@fXs(Y_B05kV2DL
z1EaCmx-5}jBkm6jTs>bNyqcU!54DW>e%F2CpHIdU5LqhXv;ge1cBGxf8xJcEYZy$w
z?7Fo9X-p7s5DS9k-w#a<Bq*?vnHRxxfR4cV0iD!q2kkG$IU;z&o{(%u1N9K;WJYK5
zA{5(eufSCa9n%2V>kj-TInqpzZsJjbn&9wgs!2|bC{aS#iY}572JEtYV7?$+Rp-gO
zTm%7SGvHx_0p{GngP2xC0SO*m#ZzcZjcso`9CFUl{5C3YyJHT*J^LMiKNdeEOd0}&
zeg_KdZFJi0`fB9PFGRw4sQtP~u!b&WTq1ls(Tk3M{Fg8(r^G-+9ej(IA^%usGBa&X
zCUGYv{h&b@D*Fu)Hp1p7Iq2_OBJy}34uU*iq+>)}kq?8Y<D(xghZ*aL{N?oL<-}{)
z5z8sx%gN@j43?wdm*el34+Gc;%Rh6ld>FtoSpF@H|4(J0VQ~{(xffO%Q{kbn*z2~>
KwfyVwGyehh_zX}0

diff --git a/benchmarks/index.html b/benchmarks/index.html
index 6db7768b..4a909278 100644
--- a/benchmarks/index.html
+++ b/benchmarks/index.html
@@ -289,7 +289,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../demo/" class="md-tabs__link">
+        <a href="../demo/tree/" class="md-tabs__link">
           
   
     
@@ -898,10 +898,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -926,24 +922,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -953,8 +941,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1056,10 +1042,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1076,24 +1058,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1103,8 +1077,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/bigtree/binarytree/construct/index.html b/bigtree/binarytree/construct/index.html
index dff5dc03..9be2fd37 100644
--- a/bigtree/binarytree/construct/index.html
+++ b/bigtree/binarytree/construct/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../../demo/" class="md-tabs__link">
+        <a href="../../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/bigtree/binarytree/index.html b/bigtree/binarytree/index.html
index ac7ccd7e..8fa47f09 100644
--- a/bigtree/binarytree/index.html
+++ b/bigtree/binarytree/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../demo/" class="md-tabs__link">
+        <a href="../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/bigtree/dag/construct/index.html b/bigtree/dag/construct/index.html
index 4da8ef32..72f8c118 100644
--- a/bigtree/dag/construct/index.html
+++ b/bigtree/dag/construct/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../../demo/" class="md-tabs__link">
+        <a href="../../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/bigtree/dag/export/index.html b/bigtree/dag/export/index.html
index 97f9a47a..6ed126c1 100644
--- a/bigtree/dag/export/index.html
+++ b/bigtree/dag/export/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../../demo/" class="md-tabs__link">
+        <a href="../../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/bigtree/dag/index.html b/bigtree/dag/index.html
index 07ca4843..42186f22 100644
--- a/bigtree/dag/index.html
+++ b/bigtree/dag/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../demo/" class="md-tabs__link">
+        <a href="../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/bigtree/node/basenode/index.html b/bigtree/node/basenode/index.html
index fd9e95d6..a9b52711 100644
--- a/bigtree/node/basenode/index.html
+++ b/bigtree/node/basenode/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../../demo/" class="md-tabs__link">
+        <a href="../../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/bigtree/node/binarynode/index.html b/bigtree/node/binarynode/index.html
index 3a674ef2..8c2130f3 100644
--- a/bigtree/node/binarynode/index.html
+++ b/bigtree/node/binarynode/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../../demo/" class="md-tabs__link">
+        <a href="../../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/bigtree/node/dagnode/index.html b/bigtree/node/dagnode/index.html
index a6be805c..cbee3a60 100644
--- a/bigtree/node/dagnode/index.html
+++ b/bigtree/node/dagnode/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../../demo/" class="md-tabs__link">
+        <a href="../../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/bigtree/node/index.html b/bigtree/node/index.html
index 2cfdfb57..0308eac9 100644
--- a/bigtree/node/index.html
+++ b/bigtree/node/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../demo/" class="md-tabs__link">
+        <a href="../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/bigtree/node/node/index.html b/bigtree/node/node/index.html
index 7d837a09..4a52f517 100644
--- a/bigtree/node/node/index.html
+++ b/bigtree/node/node/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../../demo/" class="md-tabs__link">
+        <a href="../../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/bigtree/tree/construct/index.html b/bigtree/tree/construct/index.html
index 18fb3453..1dc9c83a 100644
--- a/bigtree/tree/construct/index.html
+++ b/bigtree/tree/construct/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../../demo/" class="md-tabs__link">
+        <a href="../../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1729,6 +1701,24 @@
     </span>
   </a>
   
+</li>
+        
+          <li class="md-nav__item">
+  <a href="#bigtree.tree.construct.add_polars_to_tree_by_path" class="md-nav__link">
+    <span class="md-ellipsis">
+      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;add_polars_to_tree_by_path
+    </span>
+  </a>
+  
+</li>
+        
+          <li class="md-nav__item">
+  <a href="#bigtree.tree.construct.add_polars_to_tree_by_name" class="md-nav__link">
+    <span class="md-ellipsis">
+      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;add_polars_to_tree_by_name
+    </span>
+  </a>
+  
 </li>
         
           <li class="md-nav__item">
@@ -1792,6 +1782,24 @@
     </span>
   </a>
   
+</li>
+        
+          <li class="md-nav__item">
+  <a href="#bigtree.tree.construct.polars_to_tree" class="md-nav__link">
+    <span class="md-ellipsis">
+      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;polars_to_tree
+    </span>
+  </a>
+  
+</li>
+        
+          <li class="md-nav__item">
+  <a href="#bigtree.tree.construct.polars_to_tree_by_relation" class="md-nav__link">
+    <span class="md-ellipsis">
+      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;polars_to_tree_by_relation
+    </span>
+  </a>
+  
 </li>
         
           <li class="md-nav__item">
@@ -2469,6 +2477,24 @@
     </span>
   </a>
   
+</li>
+        
+          <li class="md-nav__item">
+  <a href="#bigtree.tree.construct.add_polars_to_tree_by_path" class="md-nav__link">
+    <span class="md-ellipsis">
+      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;add_polars_to_tree_by_path
+    </span>
+  </a>
+  
+</li>
+        
+          <li class="md-nav__item">
+  <a href="#bigtree.tree.construct.add_polars_to_tree_by_name" class="md-nav__link">
+    <span class="md-ellipsis">
+      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;add_polars_to_tree_by_name
+    </span>
+  </a>
+  
 </li>
         
           <li class="md-nav__item">
@@ -2532,6 +2558,24 @@
     </span>
   </a>
   
+</li>
+        
+          <li class="md-nav__item">
+  <a href="#bigtree.tree.construct.polars_to_tree" class="md-nav__link">
+    <span class="md-ellipsis">
+      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;polars_to_tree
+    </span>
+  </a>
+  
+</li>
+        
+          <li class="md-nav__item">
+  <a href="#bigtree.tree.construct.polars_to_tree_by_relation" class="md-nav__link">
+    <span class="md-ellipsis">
+      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;polars_to_tree_by_relation
+    </span>
+  </a>
+  
 </li>
         
           <li class="md-nav__item">
@@ -2603,12 +2647,19 @@ <h2 id="tree-construct-methods">Tree Construct Methods</h2>
 <td>Yes</td>
 </tr>
 <tr>
-<td>DataFrame</td>
+<td>pandas DataFrame</td>
 <td><code>dataframe_to_tree</code></td>
 <td><code>dataframe_to_tree_by_relation</code></td>
 <td>NA</td>
 <td>Yes</td>
 </tr>
+<tr>
+<td>polars DataFrame</td>
+<td><code>polars_to_tree</code></td>
+<td><code>polars_to_tree_by_relation</code></td>
+<td>NA</td>
+<td>Yes</td>
+</tr>
 </tbody>
 </table>
 <h2 id="tree-add-attributes-methods">Tree Add Attributes Methods</h2>
@@ -2633,10 +2684,15 @@ <h2 id="tree-add-attributes-methods">Tree Add Attributes Methods</h2>
 <td><code>add_dict_to_tree_by_name</code></td>
 </tr>
 <tr>
-<td>DataFrame</td>
+<td>pandas DataFrame</td>
 <td><code>add_dataframe_to_tree_by_path</code></td>
 <td><code>add_dataframe_to_tree_by_name</code></td>
 </tr>
+<tr>
+<td>polars DataFrame</td>
+<td><code>add_polars_to_tree_by_path</code></td>
+<td><code>add_polars_to_tree_by_name</code></td>
+</tr>
 </tbody>
 </table>
 <div class="admonition note">
@@ -3463,35 +3519,70 @@ <h3 id="bigtree.tree.construct.add_dataframe_to_tree_by_name" class="doc doc-hea
 
 
 
-<h3 id="bigtree.tree.construct.str_to_tree" class="doc doc-heading">
-<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">str_to_tree</span>
+<h3 id="bigtree.tree.construct.add_polars_to_tree_by_path" class="doc doc-heading">
+<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">add_polars_to_tree_by_path</span>
 
 
 </h3>
-<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">str_to_tree</span><span class="p">(</span>
-</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a>    <span class="n">tree_string</span><span class="p">,</span> <span class="n">tree_prefix_list</span><span class="o">=</span><span class="p">[],</span> <span class="n">node_type</span><span class="o">=</span><span class="n">Node</span>
-</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="p">)</span>
+<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">add_polars_to_tree_by_path</span><span class="p">(</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a>    <span class="n">tree</span><span class="p">,</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a>    <span class="n">data</span><span class="p">,</span>
+</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a>    <span class="n">path_col</span><span class="o">=</span><span class="s2">&quot;&quot;</span><span class="p">,</span>
+</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a>    <span class="n">attribute_cols</span><span class="o">=</span><span class="p">[],</span>
+</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a>    <span class="n">sep</span><span class="o">=</span><span class="s2">&quot;/&quot;</span><span class="p">,</span>
+</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a>    <span class="n">duplicate_name_allowed</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span>
+</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="p">)</span>
 </span></code></pre></div>
 
   <div class="doc doc-contents ">
   
-      <p>Construct tree from tree string</p>
+      <p>Add nodes and attributes to tree <em>in-place</em>, return root of tree.
+Adds to existing tree from polars DataFrame.</p>
+<p>Only attributes in <code>attribute_cols</code> with non-null values will be added to the tree.</p>
+<p><code>path_col</code> and <code>attribute_cols</code> specify columns for node path and attributes to add to existing tree.
+If columns are not specified, <code>path_col</code> takes first column and all other columns are <code>attribute_cols</code></p>
+<p>Path in path column should contain <code>Node</code> name, separated by <code>sep</code>.</p>
+<ul>
+<li>For example: Path string "a/b" refers to Node("b") with parent Node("a").</li>
+<li>Path separator <code>sep</code> is for the input <code>path</code> and can differ from existing tree.</li>
+</ul>
+<p>Path in path column can start from root node <code>name</code>, or start with <code>sep</code>.</p>
+<ul>
+<li>For example: Path string can be "/a/b" or "a/b", if sep is "/".</li>
+</ul>
+<p>All paths should start from the same root node.</p>
+<ul>
+<li>For example: Path strings should be "a/b", "a/c", "a/b/d" etc. and should not start with another root node.</li>
+</ul>
 
 
 
 <p><strong>Examples:</strong></p>
-    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">str_to_tree</span>
-</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">tree_str</span> <span class="o">=</span> <span class="s1">&#39;a</span><span class="se">\n</span><span class="s1">├── b</span><span class="se">\n</span><span class="s1">│   ├── d</span><span class="se">\n</span><span class="s1">│   └── e</span><span class="se">\n</span><span class="s1">│       ├── g</span><span class="se">\n</span><span class="s1">│       └── h</span><span class="se">\n</span><span class="s1">└── c</span><span class="se">\n</span><span class="s1">    └── f&#39;</span>
-</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">str_to_tree</span><span class="p">(</span><span class="n">tree_str</span><span class="p">,</span> <span class="n">tree_prefix_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;├──&quot;</span><span class="p">,</span> <span class="s2">&quot;└──&quot;</span><span class="p">])</span>
-</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
-</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="go">a</span>
-</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="go">├── b</span>
-</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a><span class="go">│   ├── d</span>
-</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="go">│   └── e</span>
-</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a><span class="go">│       ├── g</span>
-</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a><span class="go">│       └── h</span>
-</span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="go">└── c</span>
-</span><span id="__span-0-12"><a id="__codelineno-0-12" name="__codelineno-0-12" href="#__codelineno-0-12"></a><span class="go">    └── f</span>
+    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">import</span> <span class="nn">polars</span> <span class="k">as</span> <span class="nn">pl</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">add_polars_to_tree_by_path</span><span class="p">,</span> <span class="n">Node</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">)</span>
+</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">path_data</span> <span class="o">=</span> <span class="n">pl</span><span class="o">.</span><span class="n">DataFrame</span><span class="p">([</span>
+</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="mi">90</span><span class="p">],</span>
+</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a/b&quot;</span><span class="p">,</span> <span class="mi">65</span><span class="p">],</span>
+</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a/c&quot;</span><span class="p">,</span> <span class="mi">60</span><span class="p">],</span>
+</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a/b/d&quot;</span><span class="p">,</span> <span class="mi">40</span><span class="p">],</span>
+</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a/b/e&quot;</span><span class="p">,</span> <span class="mi">35</span><span class="p">],</span>
+</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a/c/f&quot;</span><span class="p">,</span> <span class="mi">38</span><span class="p">],</span>
+</span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a/b/e/g&quot;</span><span class="p">,</span> <span class="mi">10</span><span class="p">],</span>
+</span><span id="__span-0-12"><a id="__codelineno-0-12" name="__codelineno-0-12" href="#__codelineno-0-12"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a/b/e/h&quot;</span><span class="p">,</span> <span class="mi">6</span><span class="p">],</span>
+</span><span id="__span-0-13"><a id="__codelineno-0-13" name="__codelineno-0-13" href="#__codelineno-0-13"></a><span class="gp">... </span><span class="p">],</span>
+</span><span id="__span-0-14"><a id="__codelineno-0-14" name="__codelineno-0-14" href="#__codelineno-0-14"></a><span class="gp">... </span>    <span class="n">schema</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;PATH&quot;</span><span class="p">,</span> <span class="s2">&quot;age&quot;</span><span class="p">]</span>
+</span><span id="__span-0-15"><a id="__codelineno-0-15" name="__codelineno-0-15" href="#__codelineno-0-15"></a><span class="gp">... </span><span class="p">)</span>
+</span><span id="__span-0-16"><a id="__codelineno-0-16" name="__codelineno-0-16" href="#__codelineno-0-16"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">add_polars_to_tree_by_path</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">path_data</span><span class="p">)</span>
+</span><span id="__span-0-17"><a id="__codelineno-0-17" name="__codelineno-0-17" href="#__codelineno-0-17"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">(</span><span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;age&quot;</span><span class="p">])</span>
+</span><span id="__span-0-18"><a id="__codelineno-0-18" name="__codelineno-0-18" href="#__codelineno-0-18"></a><span class="go">a [age=90]</span>
+</span><span id="__span-0-19"><a id="__codelineno-0-19" name="__codelineno-0-19" href="#__codelineno-0-19"></a><span class="go">├── b [age=65]</span>
+</span><span id="__span-0-20"><a id="__codelineno-0-20" name="__codelineno-0-20" href="#__codelineno-0-20"></a><span class="go">│   ├── d [age=40]</span>
+</span><span id="__span-0-21"><a id="__codelineno-0-21" name="__codelineno-0-21" href="#__codelineno-0-21"></a><span class="go">│   └── e [age=35]</span>
+</span><span id="__span-0-22"><a id="__codelineno-0-22" name="__codelineno-0-22" href="#__codelineno-0-22"></a><span class="go">│       ├── g [age=10]</span>
+</span><span id="__span-0-23"><a id="__codelineno-0-23" name="__codelineno-0-23" href="#__codelineno-0-23"></a><span class="go">│       └── h [age=6]</span>
+</span><span id="__span-0-24"><a id="__codelineno-0-24" name="__codelineno-0-24" href="#__codelineno-0-24"></a><span class="go">└── c [age=60]</span>
+</span><span id="__span-0-25"><a id="__codelineno-0-25" name="__codelineno-0-25" href="#__codelineno-0-25"></a><span class="go">    └── f [age=38]</span>
 </span></code></pre></div>
 
 
@@ -3508,13 +3599,13 @@ <h3 id="bigtree.tree.construct.str_to_tree" class="doc doc-heading">
     </thead>
     <tbody>
         <tr>
-          <td><code>tree_string</code></td>
+          <td><code>tree</code></td>
           <td>
-                <code>str</code>
+                <code><a class="autorefs autorefs-internal" title="bigtree.node.node.Node" href="../../node/node/#bigtree.node.node.Node">Node</a></code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>String to construct tree</p>
+              <p>existing tree</p>
             </div>
           </td>
           <td>
@@ -3522,14 +3613,43 @@ <h3 id="bigtree.tree.construct.str_to_tree" class="doc doc-heading">
           </td>
         </tr>
         <tr>
-          <td><code>tree_prefix_list</code></td>
+          <td><code>data</code></td>
+          <td>
+                <code><span title="polars.DataFrame">DataFrame</span></code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>data containing node path and attribute information</p>
+            </div>
+          </td>
+          <td>
+              <em>required</em>
+          </td>
+        </tr>
+        <tr>
+          <td><code>path_col</code></td>
+          <td>
+                <code>str</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>column of data containing <code>path_name</code> information,
+if not set, it will take the first column of data</p>
+            </div>
+          </td>
+          <td>
+                <code>&#39;&#39;</code>
+          </td>
+        </tr>
+        <tr>
+          <td><code>attribute_cols</code></td>
           <td>
                 <code><span title="typing.List">List</span>[str]</code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>List of prefix to mark the end of tree branch/stem and start of node name, optional.
-If not specified, it will infer unicode characters and whitespace as prefix.</p>
+              <p>columns of data containing node attribute information,
+if not set, it will take all columns of data except <code>path_col</code></p>
             </div>
           </td>
           <td>
@@ -3537,17 +3657,31 @@ <h3 id="bigtree.tree.construct.str_to_tree" class="doc doc-heading">
           </td>
         </tr>
         <tr>
-          <td><code>node_type</code></td>
+          <td><code>sep</code></td>
           <td>
-                <code><span title="typing.Type">Type</span>[<a class="autorefs autorefs-internal" title="bigtree.node.node.Node" href="../../node/node/#bigtree.node.node.Node">Node</a>]</code>
+                <code>str</code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>node type of tree to be created, defaults to <code>Node</code></p>
+              <p>path separator for input <code>path_col</code></p>
             </div>
           </td>
           <td>
-                <code><a class="autorefs autorefs-internal" title="bigtree.node.node.Node" href="../../node/node/#bigtree.node.node.Node">Node</a></code>
+                <code>&#39;/&#39;</code>
+          </td>
+        </tr>
+        <tr>
+          <td><code>duplicate_name_allowed</code></td>
+          <td>
+                <code>bool</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>indicator if nodes with duplicate <code>Node</code> name is allowed, defaults to True</p>
+            </div>
+          </td>
+          <td>
+                <code>True</code>
           </td>
         </tr>
     </tbody>
@@ -3586,50 +3720,43 @@ <h3 id="bigtree.tree.construct.str_to_tree" class="doc doc-heading">
 
 
 
-<h3 id="bigtree.tree.construct.list_to_tree" class="doc doc-heading">
-<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">list_to_tree</span>
+<h3 id="bigtree.tree.construct.add_polars_to_tree_by_name" class="doc doc-heading">
+<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">add_polars_to_tree_by_name</span>
 
 
 </h3>
-<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">list_to_tree</span><span class="p">(</span>
-</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a>    <span class="n">paths</span><span class="p">,</span>
-</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a>    <span class="n">sep</span><span class="o">=</span><span class="s2">&quot;/&quot;</span><span class="p">,</span>
-</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a>    <span class="n">duplicate_name_allowed</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span>
-</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a>    <span class="n">node_type</span><span class="o">=</span><span class="n">Node</span><span class="p">,</span>
-</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="p">)</span>
+<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">add_polars_to_tree_by_name</span><span class="p">(</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a>    <span class="n">tree</span><span class="p">,</span> <span class="n">data</span><span class="p">,</span> <span class="n">name_col</span><span class="o">=</span><span class="s2">&quot;&quot;</span><span class="p">,</span> <span class="n">attribute_cols</span><span class="o">=</span><span class="p">[]</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="p">)</span>
 </span></code></pre></div>
 
   <div class="doc doc-contents ">
   
-      <p>Construct tree from list of path strings.</p>
-<p>Path should contain <code>Node</code> name, separated by <code>sep</code>.</p>
-<ul>
-<li>For example: Path string "a/b" refers to Node("b") with parent Node("a").</li>
-</ul>
-<p>Path can start from root node <code>name</code>, or start with <code>sep</code>.</p>
-<ul>
-<li>For example: Path string can be "/a/b" or "a/b", if sep is "/".</li>
-</ul>
-<p>All paths should start from the same root node.</p>
-<ul>
-<li>For example: Path strings should be "a/b", "a/c", "a/b/d" etc. and should not start with another root node.</li>
-</ul>
+      <p>Add attributes to existing tree <em>in-place</em>.
+Adds to existing tree from polars DataFrame.</p>
+<p>Only attributes in <code>attribute_cols</code> with non-null values will be added to the tree.</p>
+<p><code>name_col</code> and <code>attribute_cols</code> specify columns for node name and attributes to add to existing tree.
+If columns are not specified, the first column will be taken as name column and all other columns as attributes.</p>
+<p>Input data node names that are not existing node names will be ignored.
+Note that if multiple nodes have the same name, attributes will be added to all nodes sharing same name.</p>
 
 
 
 <p><strong>Examples:</strong></p>
-    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">list_to_tree</span>
-</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">path_list</span> <span class="o">=</span> <span class="p">[</span><span class="s2">&quot;a/b&quot;</span><span class="p">,</span> <span class="s2">&quot;a/c&quot;</span><span class="p">,</span> <span class="s2">&quot;a/b/d&quot;</span><span class="p">,</span> <span class="s2">&quot;a/b/e&quot;</span><span class="p">,</span> <span class="s2">&quot;a/c/f&quot;</span><span class="p">,</span> <span class="s2">&quot;a/b/e/g&quot;</span><span class="p">,</span> <span class="s2">&quot;a/b/e/h&quot;</span><span class="p">]</span>
-</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">list_to_tree</span><span class="p">(</span><span class="n">path_list</span><span class="p">)</span>
-</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
-</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="go">a</span>
-</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="go">├── b</span>
-</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a><span class="go">│   ├── d</span>
-</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="go">│   └── e</span>
-</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a><span class="go">│       ├── g</span>
-</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a><span class="go">│       └── h</span>
-</span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="go">└── c</span>
-</span><span id="__span-0-12"><a id="__codelineno-0-12" name="__codelineno-0-12" href="#__codelineno-0-12"></a><span class="go">    └── f</span>
+    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">import</span> <span class="nn">polars</span> <span class="k">as</span> <span class="nn">pl</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">add_polars_to_tree_by_name</span><span class="p">,</span> <span class="n">Node</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">)</span>
+</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">b</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
+</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">name_data</span> <span class="o">=</span> <span class="n">pl</span><span class="o">.</span><span class="n">DataFrame</span><span class="p">([</span>
+</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="mi">90</span><span class="p">],</span>
+</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="mi">65</span><span class="p">],</span>
+</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="gp">... </span><span class="p">],</span>
+</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a><span class="gp">... </span>    <span class="n">schema</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;NAME&quot;</span><span class="p">,</span> <span class="s2">&quot;age&quot;</span><span class="p">]</span>
+</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a><span class="gp">... </span><span class="p">)</span>
+</span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">add_polars_to_tree_by_name</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">name_data</span><span class="p">)</span>
+</span><span id="__span-0-12"><a id="__codelineno-0-12" name="__codelineno-0-12" href="#__codelineno-0-12"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">(</span><span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;age&quot;</span><span class="p">])</span>
+</span><span id="__span-0-13"><a id="__codelineno-0-13" name="__codelineno-0-13" href="#__codelineno-0-13"></a><span class="go">a [age=90]</span>
+</span><span id="__span-0-14"><a id="__codelineno-0-14" name="__codelineno-0-14" href="#__codelineno-0-14"></a><span class="go">└── b [age=65]</span>
 </span></code></pre></div>
 
 
@@ -3646,13 +3773,13 @@ <h3 id="bigtree.tree.construct.list_to_tree" class="doc doc-heading">
     </thead>
     <tbody>
         <tr>
-          <td><code>paths</code></td>
+          <td><code>tree</code></td>
           <td>
-                <code><span title="typing.List">List</span>[str]</code>
+                <code><a class="autorefs autorefs-internal" title="bigtree.node.node.Node" href="../../node/node/#bigtree.node.node.Node">Node</a></code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>list containing path strings</p>
+              <p>existing tree</p>
             </div>
           </td>
           <td>
@@ -3660,31 +3787,156 @@ <h3 id="bigtree.tree.construct.list_to_tree" class="doc doc-heading">
           </td>
         </tr>
         <tr>
-          <td><code>sep</code></td>
+          <td><code>data</code></td>
+          <td>
+                <code><span title="polars.DataFrame">DataFrame</span></code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>data containing node name and attribute information</p>
+            </div>
+          </td>
+          <td>
+              <em>required</em>
+          </td>
+        </tr>
+        <tr>
+          <td><code>name_col</code></td>
           <td>
                 <code>str</code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>path separator for input <code>paths</code> and created tree, defaults to <code>/</code></p>
+              <p>column of data containing <code>name</code> information,
+if not set, it will take the first column of data</p>
             </div>
           </td>
           <td>
-                <code>&#39;/&#39;</code>
+                <code>&#39;&#39;</code>
           </td>
         </tr>
         <tr>
-          <td><code>duplicate_name_allowed</code></td>
+          <td><code>attribute_cols</code></td>
           <td>
-                <code>bool</code>
+                <code><span title="typing.List">List</span>[str]</code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>indicator if nodes with duplicate <code>Node</code> name is allowed, defaults to True</p>
+              <p>column(s) of data containing node attribute information,
+if not set, it will take all columns of data except <code>path_col</code></p>
             </div>
           </td>
           <td>
-                <code>True</code>
+                <code>[]</code>
+          </td>
+        </tr>
+    </tbody>
+  </table>
+
+
+
+  <p><strong>Returns:</strong></p>
+  <table>
+    <thead>
+      <tr>
+        <th>Type</th>
+        <th>Description</th>
+      </tr>
+    </thead>
+    <tbody>
+        <tr>
+          <td>
+                <code><a class="autorefs autorefs-internal" title="bigtree.node.node.Node" href="../../node/node/#bigtree.node.node.Node">Node</a></code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>(Node)</p>
+            </div>
+          </td>
+        </tr>
+    </tbody>
+  </table>
+
+  </div>
+
+</div>
+
+
+<div class="doc doc-object doc-function">
+
+
+
+<h3 id="bigtree.tree.construct.str_to_tree" class="doc doc-heading">
+<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">str_to_tree</span>
+
+
+</h3>
+<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">str_to_tree</span><span class="p">(</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a>    <span class="n">tree_string</span><span class="p">,</span> <span class="n">tree_prefix_list</span><span class="o">=</span><span class="p">[],</span> <span class="n">node_type</span><span class="o">=</span><span class="n">Node</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="p">)</span>
+</span></code></pre></div>
+
+  <div class="doc doc-contents ">
+  
+      <p>Construct tree from tree string</p>
+
+
+
+<p><strong>Examples:</strong></p>
+    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">str_to_tree</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">tree_str</span> <span class="o">=</span> <span class="s1">&#39;a</span><span class="se">\n</span><span class="s1">├── b</span><span class="se">\n</span><span class="s1">│   ├── d</span><span class="se">\n</span><span class="s1">│   └── e</span><span class="se">\n</span><span class="s1">│       ├── g</span><span class="se">\n</span><span class="s1">│       └── h</span><span class="se">\n</span><span class="s1">└── c</span><span class="se">\n</span><span class="s1">    └── f&#39;</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">str_to_tree</span><span class="p">(</span><span class="n">tree_str</span><span class="p">,</span> <span class="n">tree_prefix_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;├──&quot;</span><span class="p">,</span> <span class="s2">&quot;└──&quot;</span><span class="p">])</span>
+</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
+</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="go">a</span>
+</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="go">├── b</span>
+</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a><span class="go">│   ├── d</span>
+</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="go">│   └── e</span>
+</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a><span class="go">│       ├── g</span>
+</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a><span class="go">│       └── h</span>
+</span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="go">└── c</span>
+</span><span id="__span-0-12"><a id="__codelineno-0-12" name="__codelineno-0-12" href="#__codelineno-0-12"></a><span class="go">    └── f</span>
+</span></code></pre></div>
+
+
+
+  <p><strong>Parameters:</strong></p>
+  <table>
+    <thead>
+      <tr>
+        <th>Name</th>
+        <th>Type</th>
+        <th>Description</th>
+        <th>Default</th>
+      </tr>
+    </thead>
+    <tbody>
+        <tr>
+          <td><code>tree_string</code></td>
+          <td>
+                <code>str</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>String to construct tree</p>
+            </div>
+          </td>
+          <td>
+              <em>required</em>
+          </td>
+        </tr>
+        <tr>
+          <td><code>tree_prefix_list</code></td>
+          <td>
+                <code><span title="typing.List">List</span>[str]</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>List of prefix to mark the end of tree branch/stem and start of node name, optional.
+If not specified, it will infer unicode characters and whitespace as prefix.</p>
+            </div>
+          </td>
+          <td>
+                <code>[]</code>
           </td>
         </tr>
         <tr>
@@ -3737,30 +3989,41 @@ <h3 id="bigtree.tree.construct.list_to_tree" class="doc doc-heading">
 
 
 
-<h3 id="bigtree.tree.construct.list_to_tree_by_relation" class="doc doc-heading">
-<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">list_to_tree_by_relation</span>
+<h3 id="bigtree.tree.construct.list_to_tree" class="doc doc-heading">
+<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">list_to_tree</span>
 
 
 </h3>
-<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">list_to_tree_by_relation</span><span class="p">(</span>
-</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a>    <span class="n">relations</span><span class="p">,</span> <span class="n">allow_duplicates</span><span class="o">=</span><span class="kc">False</span><span class="p">,</span> <span class="n">node_type</span><span class="o">=</span><span class="n">Node</span>
-</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="p">)</span>
+<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">list_to_tree</span><span class="p">(</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a>    <span class="n">paths</span><span class="p">,</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a>    <span class="n">sep</span><span class="o">=</span><span class="s2">&quot;/&quot;</span><span class="p">,</span>
+</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a>    <span class="n">duplicate_name_allowed</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span>
+</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a>    <span class="n">node_type</span><span class="o">=</span><span class="n">Node</span><span class="p">,</span>
+</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="p">)</span>
 </span></code></pre></div>
 
   <div class="doc doc-contents ">
   
-      <p>Construct tree from list of tuple containing parent-child names.</p>
-<p>Root node is inferred when parent is empty, or when name appears as parent but not as child.</p>
-<p>Since tree is created from parent-child names, only names of leaf nodes may be repeated.
-Error will be thrown if names of intermediate nodes are repeated as there will be confusion.
-This error can be ignored by setting <code>allow_duplicates</code> to be True.</p>
+      <p>Construct tree from list of path strings.</p>
+<p>Path should contain <code>Node</code> name, separated by <code>sep</code>.</p>
+<ul>
+<li>For example: Path string "a/b" refers to Node("b") with parent Node("a").</li>
+</ul>
+<p>Path can start from root node <code>name</code>, or start with <code>sep</code>.</p>
+<ul>
+<li>For example: Path string can be "/a/b" or "a/b", if sep is "/".</li>
+</ul>
+<p>All paths should start from the same root node.</p>
+<ul>
+<li>For example: Path strings should be "a/b", "a/c", "a/b/d" etc. and should not start with another root node.</li>
+</ul>
 
 
 
 <p><strong>Examples:</strong></p>
-    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">list_to_tree_by_relation</span>
-</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">relations_list</span> <span class="o">=</span> <span class="p">[(</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="s2">&quot;b&quot;</span><span class="p">),</span> <span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="s2">&quot;c&quot;</span><span class="p">),</span> <span class="p">(</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="s2">&quot;d&quot;</span><span class="p">),</span> <span class="p">(</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="s2">&quot;e&quot;</span><span class="p">),</span> <span class="p">(</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="s2">&quot;f&quot;</span><span class="p">),</span> <span class="p">(</span><span class="s2">&quot;e&quot;</span><span class="p">,</span> <span class="s2">&quot;g&quot;</span><span class="p">),</span> <span class="p">(</span><span class="s2">&quot;e&quot;</span><span class="p">,</span> <span class="s2">&quot;h&quot;</span><span class="p">)]</span>
-</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">list_to_tree_by_relation</span><span class="p">(</span><span class="n">relations_list</span><span class="p">)</span>
+    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">list_to_tree</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">path_list</span> <span class="o">=</span> <span class="p">[</span><span class="s2">&quot;a/b&quot;</span><span class="p">,</span> <span class="s2">&quot;a/c&quot;</span><span class="p">,</span> <span class="s2">&quot;a/b/d&quot;</span><span class="p">,</span> <span class="s2">&quot;a/b/e&quot;</span><span class="p">,</span> <span class="s2">&quot;a/c/f&quot;</span><span class="p">,</span> <span class="s2">&quot;a/b/e/g&quot;</span><span class="p">,</span> <span class="s2">&quot;a/b/e/h&quot;</span><span class="p">]</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">list_to_tree</span><span class="p">(</span><span class="n">path_list</span><span class="p">)</span>
 </span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
 </span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="go">a</span>
 </span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="go">├── b</span>
@@ -3786,13 +4049,13 @@ <h3 id="bigtree.tree.construct.list_to_tree_by_relation" class="doc doc-heading"
     </thead>
     <tbody>
         <tr>
-          <td><code>relations</code></td>
+          <td><code>paths</code></td>
           <td>
-                <code><span title="typing.List">List</span>[<span title="typing.Tuple">Tuple</span>[str, str]]</code>
+                <code><span title="typing.List">List</span>[str]</code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>list containing tuple containing parent-child names</p>
+              <p>list containing path strings</p>
             </div>
           </td>
           <td>
@@ -3800,18 +4063,31 @@ <h3 id="bigtree.tree.construct.list_to_tree_by_relation" class="doc doc-heading"
           </td>
         </tr>
         <tr>
-          <td><code>allow_duplicates</code></td>
+          <td><code>sep</code></td>
+          <td>
+                <code>str</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>path separator for input <code>paths</code> and created tree, defaults to <code>/</code></p>
+            </div>
+          </td>
+          <td>
+                <code>&#39;/&#39;</code>
+          </td>
+        </tr>
+        <tr>
+          <td><code>duplicate_name_allowed</code></td>
           <td>
                 <code>bool</code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>allow duplicate intermediate nodes such that child node will
-be tagged to multiple parent nodes, defaults to False</p>
+              <p>indicator if nodes with duplicate <code>Node</code> name is allowed, defaults to True</p>
             </div>
           </td>
           <td>
-                <code>False</code>
+                <code>True</code>
           </td>
         </tr>
         <tr>
@@ -3864,61 +4140,514 @@ <h3 id="bigtree.tree.construct.list_to_tree_by_relation" class="doc doc-heading"
 
 
 
-<h3 id="bigtree.tree.construct.dict_to_tree" class="doc doc-heading">
-<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">dict_to_tree</span>
+<h3 id="bigtree.tree.construct.list_to_tree_by_relation" class="doc doc-heading">
+<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">list_to_tree_by_relation</span>
 
 
 </h3>
-<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">dict_to_tree</span><span class="p">(</span>
-</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a>    <span class="n">path_attrs</span><span class="p">,</span>
-</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a>    <span class="n">sep</span><span class="o">=</span><span class="s2">&quot;/&quot;</span><span class="p">,</span>
-</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a>    <span class="n">duplicate_name_allowed</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span>
-</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a>    <span class="n">node_type</span><span class="o">=</span><span class="n">Node</span><span class="p">,</span>
-</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="p">)</span>
+<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">list_to_tree_by_relation</span><span class="p">(</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a>    <span class="n">relations</span><span class="p">,</span> <span class="n">allow_duplicates</span><span class="o">=</span><span class="kc">False</span><span class="p">,</span> <span class="n">node_type</span><span class="o">=</span><span class="n">Node</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="p">)</span>
+</span></code></pre></div>
+
+  <div class="doc doc-contents ">
+  
+      <p>Construct tree from list of tuple containing parent-child names.</p>
+<p>Root node is inferred when parent is empty, or when name appears as parent but not as child.</p>
+<p>Since tree is created from parent-child names, only names of leaf nodes may be repeated.
+Error will be thrown if names of intermediate nodes are repeated as there will be confusion.
+This error can be ignored by setting <code>allow_duplicates</code> to be True.</p>
+
+
+
+<p><strong>Examples:</strong></p>
+    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">list_to_tree_by_relation</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">relations_list</span> <span class="o">=</span> <span class="p">[(</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="s2">&quot;b&quot;</span><span class="p">),</span> <span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="s2">&quot;c&quot;</span><span class="p">),</span> <span class="p">(</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="s2">&quot;d&quot;</span><span class="p">),</span> <span class="p">(</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="s2">&quot;e&quot;</span><span class="p">),</span> <span class="p">(</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="s2">&quot;f&quot;</span><span class="p">),</span> <span class="p">(</span><span class="s2">&quot;e&quot;</span><span class="p">,</span> <span class="s2">&quot;g&quot;</span><span class="p">),</span> <span class="p">(</span><span class="s2">&quot;e&quot;</span><span class="p">,</span> <span class="s2">&quot;h&quot;</span><span class="p">)]</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">list_to_tree_by_relation</span><span class="p">(</span><span class="n">relations_list</span><span class="p">)</span>
+</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
+</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="go">a</span>
+</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="go">├── b</span>
+</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a><span class="go">│   ├── d</span>
+</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="go">│   └── e</span>
+</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a><span class="go">│       ├── g</span>
+</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a><span class="go">│       └── h</span>
+</span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="go">└── c</span>
+</span><span id="__span-0-12"><a id="__codelineno-0-12" name="__codelineno-0-12" href="#__codelineno-0-12"></a><span class="go">    └── f</span>
+</span></code></pre></div>
+
+
+
+  <p><strong>Parameters:</strong></p>
+  <table>
+    <thead>
+      <tr>
+        <th>Name</th>
+        <th>Type</th>
+        <th>Description</th>
+        <th>Default</th>
+      </tr>
+    </thead>
+    <tbody>
+        <tr>
+          <td><code>relations</code></td>
+          <td>
+                <code><span title="typing.List">List</span>[<span title="typing.Tuple">Tuple</span>[str, str]]</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>list containing tuple containing parent-child names</p>
+            </div>
+          </td>
+          <td>
+              <em>required</em>
+          </td>
+        </tr>
+        <tr>
+          <td><code>allow_duplicates</code></td>
+          <td>
+                <code>bool</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>allow duplicate intermediate nodes such that child node will
+be tagged to multiple parent nodes, defaults to False</p>
+            </div>
+          </td>
+          <td>
+                <code>False</code>
+          </td>
+        </tr>
+        <tr>
+          <td><code>node_type</code></td>
+          <td>
+                <code><span title="typing.Type">Type</span>[<a class="autorefs autorefs-internal" title="bigtree.node.node.Node" href="../../node/node/#bigtree.node.node.Node">Node</a>]</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>node type of tree to be created, defaults to <code>Node</code></p>
+            </div>
+          </td>
+          <td>
+                <code><a class="autorefs autorefs-internal" title="bigtree.node.node.Node" href="../../node/node/#bigtree.node.node.Node">Node</a></code>
+          </td>
+        </tr>
+    </tbody>
+  </table>
+
+
+
+  <p><strong>Returns:</strong></p>
+  <table>
+    <thead>
+      <tr>
+        <th>Type</th>
+        <th>Description</th>
+      </tr>
+    </thead>
+    <tbody>
+        <tr>
+          <td>
+                <code><a class="autorefs autorefs-internal" title="bigtree.node.node.Node" href="../../node/node/#bigtree.node.node.Node">Node</a></code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>(Node)</p>
+            </div>
+          </td>
+        </tr>
+    </tbody>
+  </table>
+
+  </div>
+
+</div>
+
+
+<div class="doc doc-object doc-function">
+
+
+
+<h3 id="bigtree.tree.construct.dict_to_tree" class="doc doc-heading">
+<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">dict_to_tree</span>
+
+
+</h3>
+<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">dict_to_tree</span><span class="p">(</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a>    <span class="n">path_attrs</span><span class="p">,</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a>    <span class="n">sep</span><span class="o">=</span><span class="s2">&quot;/&quot;</span><span class="p">,</span>
+</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a>    <span class="n">duplicate_name_allowed</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span>
+</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a>    <span class="n">node_type</span><span class="o">=</span><span class="n">Node</span><span class="p">,</span>
+</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="p">)</span>
+</span></code></pre></div>
+
+  <div class="doc doc-contents ">
+  
+      <p>Construct tree from nested dictionary using path,
+<code>key</code>: path, <code>value</code>: dict of attribute name and attribute value.</p>
+<p>Path should contain <code>Node</code> name, separated by <code>sep</code>.</p>
+<ul>
+<li>For example: Path string "a/b" refers to Node("b") with parent Node("a").</li>
+</ul>
+<p>Path can start from root node <code>name</code>, or start with <code>sep</code>.</p>
+<ul>
+<li>For example: Path string can be "/a/b" or "a/b", if sep is "/".</li>
+</ul>
+<p>All paths should start from the same root node.</p>
+<ul>
+<li>For example: Path strings should be "a/b", "a/c", "a/b/d" etc. and should not start with another root node.</li>
+</ul>
+<p>All attributes in <code>path_attrs</code> will be added to the tree, including attributes with null values.</p>
+
+
+
+<p><strong>Examples:</strong></p>
+    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">dict_to_tree</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">path_dict</span> <span class="o">=</span> <span class="p">{</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">... </span>    <span class="s2">&quot;a&quot;</span><span class="p">:</span> <span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">90</span><span class="p">},</span>
+</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="gp">... </span>    <span class="s2">&quot;a/b&quot;</span><span class="p">:</span> <span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">65</span><span class="p">},</span>
+</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="gp">... </span>    <span class="s2">&quot;a/c&quot;</span><span class="p">:</span> <span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">60</span><span class="p">},</span>
+</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="gp">... </span>    <span class="s2">&quot;a/b/d&quot;</span><span class="p">:</span> <span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">40</span><span class="p">},</span>
+</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a><span class="gp">... </span>    <span class="s2">&quot;a/b/e&quot;</span><span class="p">:</span> <span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">35</span><span class="p">},</span>
+</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="gp">... </span>    <span class="s2">&quot;a/c/f&quot;</span><span class="p">:</span> <span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">38</span><span class="p">},</span>
+</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a><span class="gp">... </span>    <span class="s2">&quot;a/b/e/g&quot;</span><span class="p">:</span> <span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">10</span><span class="p">},</span>
+</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a><span class="gp">... </span>    <span class="s2">&quot;a/b/e/h&quot;</span><span class="p">:</span> <span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">6</span><span class="p">},</span>
+</span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="gp">... </span><span class="p">}</span>
+</span><span id="__span-0-12"><a id="__codelineno-0-12" name="__codelineno-0-12" href="#__codelineno-0-12"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">dict_to_tree</span><span class="p">(</span><span class="n">path_dict</span><span class="p">)</span>
+</span><span id="__span-0-13"><a id="__codelineno-0-13" name="__codelineno-0-13" href="#__codelineno-0-13"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">(</span><span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;age&quot;</span><span class="p">])</span>
+</span><span id="__span-0-14"><a id="__codelineno-0-14" name="__codelineno-0-14" href="#__codelineno-0-14"></a><span class="go">a [age=90]</span>
+</span><span id="__span-0-15"><a id="__codelineno-0-15" name="__codelineno-0-15" href="#__codelineno-0-15"></a><span class="go">├── b [age=65]</span>
+</span><span id="__span-0-16"><a id="__codelineno-0-16" name="__codelineno-0-16" href="#__codelineno-0-16"></a><span class="go">│   ├── d [age=40]</span>
+</span><span id="__span-0-17"><a id="__codelineno-0-17" name="__codelineno-0-17" href="#__codelineno-0-17"></a><span class="go">│   └── e [age=35]</span>
+</span><span id="__span-0-18"><a id="__codelineno-0-18" name="__codelineno-0-18" href="#__codelineno-0-18"></a><span class="go">│       ├── g [age=10]</span>
+</span><span id="__span-0-19"><a id="__codelineno-0-19" name="__codelineno-0-19" href="#__codelineno-0-19"></a><span class="go">│       └── h [age=6]</span>
+</span><span id="__span-0-20"><a id="__codelineno-0-20" name="__codelineno-0-20" href="#__codelineno-0-20"></a><span class="go">└── c [age=60]</span>
+</span><span id="__span-0-21"><a id="__codelineno-0-21" name="__codelineno-0-21" href="#__codelineno-0-21"></a><span class="go">    └── f [age=38]</span>
+</span></code></pre></div>
+
+
+
+  <p><strong>Parameters:</strong></p>
+  <table>
+    <thead>
+      <tr>
+        <th>Name</th>
+        <th>Type</th>
+        <th>Description</th>
+        <th>Default</th>
+      </tr>
+    </thead>
+    <tbody>
+        <tr>
+          <td><code>path_attrs</code></td>
+          <td>
+                <code><span title="typing.Dict">Dict</span>[str, <span title="typing.Any">Any</span>]</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>dictionary containing path and node attribute information,
+key: path, value: dict of tree attribute and attribute value</p>
+            </div>
+          </td>
+          <td>
+              <em>required</em>
+          </td>
+        </tr>
+        <tr>
+          <td><code>sep</code></td>
+          <td>
+                <code>str</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>path separator of input <code>path_attrs</code> and created tree, defaults to <code>/</code></p>
+            </div>
+          </td>
+          <td>
+                <code>&#39;/&#39;</code>
+          </td>
+        </tr>
+        <tr>
+          <td><code>duplicate_name_allowed</code></td>
+          <td>
+                <code>bool</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>indicator if nodes with duplicate <code>Node</code> name is allowed, defaults to True</p>
+            </div>
+          </td>
+          <td>
+                <code>True</code>
+          </td>
+        </tr>
+        <tr>
+          <td><code>node_type</code></td>
+          <td>
+                <code><span title="typing.Type">Type</span>[<a class="autorefs autorefs-internal" title="bigtree.node.node.Node" href="../../node/node/#bigtree.node.node.Node">Node</a>]</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>node type of tree to be created, defaults to <code>Node</code></p>
+            </div>
+          </td>
+          <td>
+                <code><a class="autorefs autorefs-internal" title="bigtree.node.node.Node" href="../../node/node/#bigtree.node.node.Node">Node</a></code>
+          </td>
+        </tr>
+    </tbody>
+  </table>
+
+
+
+  <p><strong>Returns:</strong></p>
+  <table>
+    <thead>
+      <tr>
+        <th>Type</th>
+        <th>Description</th>
+      </tr>
+    </thead>
+    <tbody>
+        <tr>
+          <td>
+                <code><a class="autorefs autorefs-internal" title="bigtree.node.node.Node" href="../../node/node/#bigtree.node.node.Node">Node</a></code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>(Node)</p>
+            </div>
+          </td>
+        </tr>
+    </tbody>
+  </table>
+
+  </div>
+
+</div>
+
+
+<div class="doc doc-object doc-function">
+
+
+
+<h3 id="bigtree.tree.construct.nested_dict_to_tree" class="doc doc-heading">
+<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">nested_dict_to_tree</span>
+
+
+</h3>
+<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">nested_dict_to_tree</span><span class="p">(</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a>    <span class="n">node_attrs</span><span class="p">,</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a>    <span class="n">name_key</span><span class="o">=</span><span class="s2">&quot;name&quot;</span><span class="p">,</span>
+</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a>    <span class="n">child_key</span><span class="o">=</span><span class="s2">&quot;children&quot;</span><span class="p">,</span>
+</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a>    <span class="n">node_type</span><span class="o">=</span><span class="n">Node</span><span class="p">,</span>
+</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="p">)</span>
+</span></code></pre></div>
+
+  <div class="doc doc-contents ">
+  
+      <p>Construct tree from nested recursive dictionary.</p>
+<ul>
+<li><code>key</code>: <code>name_key</code>, <code>child_key</code>, or any attributes key.</li>
+<li><code>value</code> of <code>name_key</code> (str): node name.</li>
+<li><code>value</code> of <code>child_key</code> (List[Dict[str, Any]]): list of dict containing <code>name_key</code> and <code>child_key</code> (recursive).</li>
+</ul>
+
+
+
+<p><strong>Examples:</strong></p>
+    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">nested_dict_to_tree</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">path_dict</span> <span class="o">=</span> <span class="p">{</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">... </span>    <span class="s2">&quot;name&quot;</span><span class="p">:</span> <span class="s2">&quot;a&quot;</span><span class="p">,</span>
+</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="gp">... </span>    <span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">90</span><span class="p">,</span>
+</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="gp">... </span>    <span class="s2">&quot;children&quot;</span><span class="p">:</span> <span class="p">[</span>
+</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="gp">... </span>        <span class="p">{</span><span class="s2">&quot;name&quot;</span><span class="p">:</span> <span class="s2">&quot;b&quot;</span><span class="p">,</span>
+</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a><span class="gp">... </span>         <span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">65</span><span class="p">,</span>
+</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="gp">... </span>         <span class="s2">&quot;children&quot;</span><span class="p">:</span> <span class="p">[</span>
+</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a><span class="gp">... </span>             <span class="p">{</span><span class="s2">&quot;name&quot;</span><span class="p">:</span> <span class="s2">&quot;d&quot;</span><span class="p">,</span> <span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">40</span><span class="p">},</span>
+</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a><span class="gp">... </span>             <span class="p">{</span><span class="s2">&quot;name&quot;</span><span class="p">:</span> <span class="s2">&quot;e&quot;</span><span class="p">,</span> <span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">35</span><span class="p">,</span> <span class="s2">&quot;children&quot;</span><span class="p">:</span> <span class="p">[</span>
+</span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="gp">... </span>                 <span class="p">{</span><span class="s2">&quot;name&quot;</span><span class="p">:</span> <span class="s2">&quot;g&quot;</span><span class="p">,</span> <span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">10</span><span class="p">},</span>
+</span><span id="__span-0-12"><a id="__codelineno-0-12" name="__codelineno-0-12" href="#__codelineno-0-12"></a><span class="gp">... </span>             <span class="p">]},</span>
+</span><span id="__span-0-13"><a id="__codelineno-0-13" name="__codelineno-0-13" href="#__codelineno-0-13"></a><span class="gp">... </span>         <span class="p">]},</span>
+</span><span id="__span-0-14"><a id="__codelineno-0-14" name="__codelineno-0-14" href="#__codelineno-0-14"></a><span class="gp">... </span>    <span class="p">],</span>
+</span><span id="__span-0-15"><a id="__codelineno-0-15" name="__codelineno-0-15" href="#__codelineno-0-15"></a><span class="gp">... </span><span class="p">}</span>
+</span><span id="__span-0-16"><a id="__codelineno-0-16" name="__codelineno-0-16" href="#__codelineno-0-16"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">nested_dict_to_tree</span><span class="p">(</span><span class="n">path_dict</span><span class="p">)</span>
+</span><span id="__span-0-17"><a id="__codelineno-0-17" name="__codelineno-0-17" href="#__codelineno-0-17"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">(</span><span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;age&quot;</span><span class="p">])</span>
+</span><span id="__span-0-18"><a id="__codelineno-0-18" name="__codelineno-0-18" href="#__codelineno-0-18"></a><span class="go">a [age=90]</span>
+</span><span id="__span-0-19"><a id="__codelineno-0-19" name="__codelineno-0-19" href="#__codelineno-0-19"></a><span class="go">└── b [age=65]</span>
+</span><span id="__span-0-20"><a id="__codelineno-0-20" name="__codelineno-0-20" href="#__codelineno-0-20"></a><span class="go">    ├── d [age=40]</span>
+</span><span id="__span-0-21"><a id="__codelineno-0-21" name="__codelineno-0-21" href="#__codelineno-0-21"></a><span class="go">    └── e [age=35]</span>
+</span><span id="__span-0-22"><a id="__codelineno-0-22" name="__codelineno-0-22" href="#__codelineno-0-22"></a><span class="go">        └── g [age=10]</span>
+</span></code></pre></div>
+
+
+
+  <p><strong>Parameters:</strong></p>
+  <table>
+    <thead>
+      <tr>
+        <th>Name</th>
+        <th>Type</th>
+        <th>Description</th>
+        <th>Default</th>
+      </tr>
+    </thead>
+    <tbody>
+        <tr>
+          <td><code>node_attrs</code></td>
+          <td>
+                <code><span title="typing.Dict">Dict</span>[str, <span title="typing.Any">Any</span>]</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>dictionary containing node, children, and node attribute information,
+key: <code>name_key</code> and <code>child_key</code>
+value of <code>name_key</code> (str): node name
+value of <code>child_key</code> (List[Dict[str, Any]]): list of dict containing <code>name_key</code> and <code>child_key</code> (recursive)</p>
+            </div>
+          </td>
+          <td>
+              <em>required</em>
+          </td>
+        </tr>
+        <tr>
+          <td><code>name_key</code></td>
+          <td>
+                <code>str</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>key of node name, value is type str</p>
+            </div>
+          </td>
+          <td>
+                <code>&#39;name&#39;</code>
+          </td>
+        </tr>
+        <tr>
+          <td><code>child_key</code></td>
+          <td>
+                <code>str</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>key of child list, value is type list</p>
+            </div>
+          </td>
+          <td>
+                <code>&#39;children&#39;</code>
+          </td>
+        </tr>
+        <tr>
+          <td><code>node_type</code></td>
+          <td>
+                <code><span title="typing.Type">Type</span>[<a class="autorefs autorefs-internal" title="bigtree.node.node.Node" href="../../node/node/#bigtree.node.node.Node">Node</a>]</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>node type of tree to be created, defaults to <code>Node</code></p>
+            </div>
+          </td>
+          <td>
+                <code><a class="autorefs autorefs-internal" title="bigtree.node.node.Node" href="../../node/node/#bigtree.node.node.Node">Node</a></code>
+          </td>
+        </tr>
+    </tbody>
+  </table>
+
+
+
+  <p><strong>Returns:</strong></p>
+  <table>
+    <thead>
+      <tr>
+        <th>Type</th>
+        <th>Description</th>
+      </tr>
+    </thead>
+    <tbody>
+        <tr>
+          <td>
+                <code><a class="autorefs autorefs-internal" title="bigtree.node.node.Node" href="../../node/node/#bigtree.node.node.Node">Node</a></code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>(Node)</p>
+            </div>
+          </td>
+        </tr>
+    </tbody>
+  </table>
+
+  </div>
+
+</div>
+
+
+<div class="doc doc-object doc-function">
+
+
+
+<h3 id="bigtree.tree.construct.dataframe_to_tree" class="doc doc-heading">
+<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">dataframe_to_tree</span>
+
+
+</h3>
+<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">dataframe_to_tree</span><span class="p">(</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a>    <span class="n">data</span><span class="p">,</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a>    <span class="n">path_col</span><span class="o">=</span><span class="s2">&quot;&quot;</span><span class="p">,</span>
+</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a>    <span class="n">attribute_cols</span><span class="o">=</span><span class="p">[],</span>
+</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a>    <span class="n">sep</span><span class="o">=</span><span class="s2">&quot;/&quot;</span><span class="p">,</span>
+</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a>    <span class="n">duplicate_name_allowed</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span>
+</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a>    <span class="n">node_type</span><span class="o">=</span><span class="n">Node</span><span class="p">,</span>
+</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="p">)</span>
 </span></code></pre></div>
 
   <div class="doc doc-contents ">
   
-      <p>Construct tree from nested dictionary using path,
-<code>key</code>: path, <code>value</code>: dict of attribute name and attribute value.</p>
-<p>Path should contain <code>Node</code> name, separated by <code>sep</code>.</p>
+      <p>Construct tree from pandas DataFrame using path, return root of tree.</p>
+<p><code>path_col</code> and <code>attribute_cols</code> specify columns for node path and attributes to construct tree.
+If columns are not specified, <code>path_col</code> takes first column and all other columns are <code>attribute_cols</code>.</p>
+<p>Only attributes in <code>attribute_cols</code> with non-null values will be added to the tree.</p>
+<p>Path in path column can start from root node <code>name</code>, or start with <code>sep</code>.</p>
 <ul>
-<li>For example: Path string "a/b" refers to Node("b") with parent Node("a").</li>
+<li>For example: Path string can be "/a/b" or "a/b", if sep is "/".</li>
 </ul>
-<p>Path can start from root node <code>name</code>, or start with <code>sep</code>.</p>
+<p>Path in path column should contain <code>Node</code> name, separated by <code>sep</code>.</p>
 <ul>
-<li>For example: Path string can be "/a/b" or "a/b", if sep is "/".</li>
+<li>For example: Path string "a/b" refers to Node("b") with parent Node("a").</li>
 </ul>
 <p>All paths should start from the same root node.</p>
 <ul>
 <li>For example: Path strings should be "a/b", "a/c", "a/b/d" etc. and should not start with another root node.</li>
 </ul>
-<p>All attributes in <code>path_attrs</code> will be added to the tree, including attributes with null values.</p>
 
 
 
 <p><strong>Examples:</strong></p>
-    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">dict_to_tree</span>
-</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">path_dict</span> <span class="o">=</span> <span class="p">{</span>
-</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">... </span>    <span class="s2">&quot;a&quot;</span><span class="p">:</span> <span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">90</span><span class="p">},</span>
-</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="gp">... </span>    <span class="s2">&quot;a/b&quot;</span><span class="p">:</span> <span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">65</span><span class="p">},</span>
-</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="gp">... </span>    <span class="s2">&quot;a/c&quot;</span><span class="p">:</span> <span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">60</span><span class="p">},</span>
-</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="gp">... </span>    <span class="s2">&quot;a/b/d&quot;</span><span class="p">:</span> <span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">40</span><span class="p">},</span>
-</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a><span class="gp">... </span>    <span class="s2">&quot;a/b/e&quot;</span><span class="p">:</span> <span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">35</span><span class="p">},</span>
-</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="gp">... </span>    <span class="s2">&quot;a/c/f&quot;</span><span class="p">:</span> <span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">38</span><span class="p">},</span>
-</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a><span class="gp">... </span>    <span class="s2">&quot;a/b/e/g&quot;</span><span class="p">:</span> <span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">10</span><span class="p">},</span>
-</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a><span class="gp">... </span>    <span class="s2">&quot;a/b/e/h&quot;</span><span class="p">:</span> <span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">6</span><span class="p">},</span>
-</span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="gp">... </span><span class="p">}</span>
-</span><span id="__span-0-12"><a id="__codelineno-0-12" name="__codelineno-0-12" href="#__codelineno-0-12"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">dict_to_tree</span><span class="p">(</span><span class="n">path_dict</span><span class="p">)</span>
-</span><span id="__span-0-13"><a id="__codelineno-0-13" name="__codelineno-0-13" href="#__codelineno-0-13"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">(</span><span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;age&quot;</span><span class="p">])</span>
-</span><span id="__span-0-14"><a id="__codelineno-0-14" name="__codelineno-0-14" href="#__codelineno-0-14"></a><span class="go">a [age=90]</span>
-</span><span id="__span-0-15"><a id="__codelineno-0-15" name="__codelineno-0-15" href="#__codelineno-0-15"></a><span class="go">├── b [age=65]</span>
-</span><span id="__span-0-16"><a id="__codelineno-0-16" name="__codelineno-0-16" href="#__codelineno-0-16"></a><span class="go">│   ├── d [age=40]</span>
-</span><span id="__span-0-17"><a id="__codelineno-0-17" name="__codelineno-0-17" href="#__codelineno-0-17"></a><span class="go">│   └── e [age=35]</span>
-</span><span id="__span-0-18"><a id="__codelineno-0-18" name="__codelineno-0-18" href="#__codelineno-0-18"></a><span class="go">│       ├── g [age=10]</span>
-</span><span id="__span-0-19"><a id="__codelineno-0-19" name="__codelineno-0-19" href="#__codelineno-0-19"></a><span class="go">│       └── h [age=6]</span>
-</span><span id="__span-0-20"><a id="__codelineno-0-20" name="__codelineno-0-20" href="#__codelineno-0-20"></a><span class="go">└── c [age=60]</span>
-</span><span id="__span-0-21"><a id="__codelineno-0-21" name="__codelineno-0-21" href="#__codelineno-0-21"></a><span class="go">    └── f [age=38]</span>
+    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">import</span> <span class="nn">pandas</span> <span class="k">as</span> <span class="nn">pd</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">dataframe_to_tree</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">path_data</span> <span class="o">=</span> <span class="n">pd</span><span class="o">.</span><span class="n">DataFrame</span><span class="p">([</span>
+</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="mi">90</span><span class="p">],</span>
+</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a/b&quot;</span><span class="p">,</span> <span class="mi">65</span><span class="p">],</span>
+</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a/c&quot;</span><span class="p">,</span> <span class="mi">60</span><span class="p">],</span>
+</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a/b/d&quot;</span><span class="p">,</span> <span class="mi">40</span><span class="p">],</span>
+</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a/b/e&quot;</span><span class="p">,</span> <span class="mi">35</span><span class="p">],</span>
+</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a/c/f&quot;</span><span class="p">,</span> <span class="mi">38</span><span class="p">],</span>
+</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a/b/e/g&quot;</span><span class="p">,</span> <span class="mi">10</span><span class="p">],</span>
+</span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a/b/e/h&quot;</span><span class="p">,</span> <span class="mi">6</span><span class="p">],</span>
+</span><span id="__span-0-12"><a id="__codelineno-0-12" name="__codelineno-0-12" href="#__codelineno-0-12"></a><span class="gp">... </span><span class="p">],</span>
+</span><span id="__span-0-13"><a id="__codelineno-0-13" name="__codelineno-0-13" href="#__codelineno-0-13"></a><span class="gp">... </span>    <span class="n">columns</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;PATH&quot;</span><span class="p">,</span> <span class="s2">&quot;age&quot;</span><span class="p">]</span>
+</span><span id="__span-0-14"><a id="__codelineno-0-14" name="__codelineno-0-14" href="#__codelineno-0-14"></a><span class="gp">... </span><span class="p">)</span>
+</span><span id="__span-0-15"><a id="__codelineno-0-15" name="__codelineno-0-15" href="#__codelineno-0-15"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">dataframe_to_tree</span><span class="p">(</span><span class="n">path_data</span><span class="p">)</span>
+</span><span id="__span-0-16"><a id="__codelineno-0-16" name="__codelineno-0-16" href="#__codelineno-0-16"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">(</span><span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;age&quot;</span><span class="p">])</span>
+</span><span id="__span-0-17"><a id="__codelineno-0-17" name="__codelineno-0-17" href="#__codelineno-0-17"></a><span class="go">a [age=90]</span>
+</span><span id="__span-0-18"><a id="__codelineno-0-18" name="__codelineno-0-18" href="#__codelineno-0-18"></a><span class="go">├── b [age=65]</span>
+</span><span id="__span-0-19"><a id="__codelineno-0-19" name="__codelineno-0-19" href="#__codelineno-0-19"></a><span class="go">│   ├── d [age=40]</span>
+</span><span id="__span-0-20"><a id="__codelineno-0-20" name="__codelineno-0-20" href="#__codelineno-0-20"></a><span class="go">│   └── e [age=35]</span>
+</span><span id="__span-0-21"><a id="__codelineno-0-21" name="__codelineno-0-21" href="#__codelineno-0-21"></a><span class="go">│       ├── g [age=10]</span>
+</span><span id="__span-0-22"><a id="__codelineno-0-22" name="__codelineno-0-22" href="#__codelineno-0-22"></a><span class="go">│       └── h [age=6]</span>
+</span><span id="__span-0-23"><a id="__codelineno-0-23" name="__codelineno-0-23" href="#__codelineno-0-23"></a><span class="go">└── c [age=60]</span>
+</span><span id="__span-0-24"><a id="__codelineno-0-24" name="__codelineno-0-24" href="#__codelineno-0-24"></a><span class="go">    └── f [age=38]</span>
 </span></code></pre></div>
 
 
@@ -3935,20 +4664,49 @@ <h3 id="bigtree.tree.construct.dict_to_tree" class="doc doc-heading">
     </thead>
     <tbody>
         <tr>
-          <td><code>path_attrs</code></td>
+          <td><code>data</code></td>
           <td>
-                <code><span title="typing.Dict">Dict</span>[str, <span title="typing.Any">Any</span>]</code>
+                <code><span title="pandas.DataFrame">DataFrame</span></code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>dictionary containing path and node attribute information,
-key: path, value: dict of tree attribute and attribute value</p>
+              <p>data containing path and node attribute information</p>
             </div>
           </td>
           <td>
               <em>required</em>
           </td>
         </tr>
+        <tr>
+          <td><code>path_col</code></td>
+          <td>
+                <code>str</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>column of data containing <code>path_name</code> information,
+if not set, it will take the first column of data</p>
+            </div>
+          </td>
+          <td>
+                <code>&#39;&#39;</code>
+          </td>
+        </tr>
+        <tr>
+          <td><code>attribute_cols</code></td>
+          <td>
+                <code><span title="typing.List">List</span>[str]</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>columns of data containing node attribute information,
+if not set, it will take all columns of data except <code>path_col</code></p>
+            </div>
+          </td>
+          <td>
+                <code>[]</code>
+          </td>
+        </tr>
         <tr>
           <td><code>sep</code></td>
           <td>
@@ -3956,7 +4714,7 @@ <h3 id="bigtree.tree.construct.dict_to_tree" class="doc doc-heading">
           </td>
           <td>
             <div class="doc-md-description">
-              <p>path separator of input <code>path_attrs</code> and created tree, defaults to <code>/</code></p>
+              <p>path separator of input <code>path_col</code> and created tree, defaults to <code>/</code></p>
             </div>
           </td>
           <td>
@@ -4027,53 +4785,61 @@ <h3 id="bigtree.tree.construct.dict_to_tree" class="doc doc-heading">
 
 
 
-<h3 id="bigtree.tree.construct.nested_dict_to_tree" class="doc doc-heading">
-<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">nested_dict_to_tree</span>
+<h3 id="bigtree.tree.construct.dataframe_to_tree_by_relation" class="doc doc-heading">
+<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">dataframe_to_tree_by_relation</span>
 
 
 </h3>
-<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">nested_dict_to_tree</span><span class="p">(</span>
-</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a>    <span class="n">node_attrs</span><span class="p">,</span>
-</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a>    <span class="n">name_key</span><span class="o">=</span><span class="s2">&quot;name&quot;</span><span class="p">,</span>
-</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a>    <span class="n">child_key</span><span class="o">=</span><span class="s2">&quot;children&quot;</span><span class="p">,</span>
-</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a>    <span class="n">node_type</span><span class="o">=</span><span class="n">Node</span><span class="p">,</span>
-</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="p">)</span>
+<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">dataframe_to_tree_by_relation</span><span class="p">(</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a>    <span class="n">data</span><span class="p">,</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a>    <span class="n">child_col</span><span class="o">=</span><span class="s2">&quot;&quot;</span><span class="p">,</span>
+</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a>    <span class="n">parent_col</span><span class="o">=</span><span class="s2">&quot;&quot;</span><span class="p">,</span>
+</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a>    <span class="n">attribute_cols</span><span class="o">=</span><span class="p">[],</span>
+</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a>    <span class="n">allow_duplicates</span><span class="o">=</span><span class="kc">False</span><span class="p">,</span>
+</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a>    <span class="n">node_type</span><span class="o">=</span><span class="n">Node</span><span class="p">,</span>
+</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="p">)</span>
 </span></code></pre></div>
 
   <div class="doc doc-contents ">
   
-      <p>Construct tree from nested recursive dictionary.</p>
-<ul>
-<li><code>key</code>: <code>name_key</code>, <code>child_key</code>, or any attributes key.</li>
-<li><code>value</code> of <code>name_key</code> (str): node name.</li>
-<li><code>value</code> of <code>child_key</code> (List[Dict[str, Any]]): list of dict containing <code>name_key</code> and <code>child_key</code> (recursive).</li>
-</ul>
+      <p>Construct tree from pandas DataFrame using parent and child names, return root of tree.</p>
+<p>Root node is inferred when parent name is empty, or when name appears in parent column but not in child column.</p>
+<p>Since tree is created from parent-child names, only names of leaf nodes may be repeated.
+Error will be thrown if names of intermediate nodes are repeated as there will be confusion.
+This error can be ignored by setting <code>allow_duplicates</code> to be True.</p>
+<p><code>child_col</code> and <code>parent_col</code> specify columns for child name and parent name to construct tree.
+<code>attribute_cols</code> specify columns for node attribute for child name.
+If columns are not specified, <code>child_col</code> takes first column, <code>parent_col</code> takes second column, and all other
+columns are <code>attribute_cols</code>.</p>
+<p>Only attributes in <code>attribute_cols</code> with non-null values will be added to the tree.</p>
 
 
 
 <p><strong>Examples:</strong></p>
-    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">nested_dict_to_tree</span>
-</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">path_dict</span> <span class="o">=</span> <span class="p">{</span>
-</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">... </span>    <span class="s2">&quot;name&quot;</span><span class="p">:</span> <span class="s2">&quot;a&quot;</span><span class="p">,</span>
-</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="gp">... </span>    <span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">90</span><span class="p">,</span>
-</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="gp">... </span>    <span class="s2">&quot;children&quot;</span><span class="p">:</span> <span class="p">[</span>
-</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="gp">... </span>        <span class="p">{</span><span class="s2">&quot;name&quot;</span><span class="p">:</span> <span class="s2">&quot;b&quot;</span><span class="p">,</span>
-</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a><span class="gp">... </span>         <span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">65</span><span class="p">,</span>
-</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="gp">... </span>         <span class="s2">&quot;children&quot;</span><span class="p">:</span> <span class="p">[</span>
-</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a><span class="gp">... </span>             <span class="p">{</span><span class="s2">&quot;name&quot;</span><span class="p">:</span> <span class="s2">&quot;d&quot;</span><span class="p">,</span> <span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">40</span><span class="p">},</span>
-</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a><span class="gp">... </span>             <span class="p">{</span><span class="s2">&quot;name&quot;</span><span class="p">:</span> <span class="s2">&quot;e&quot;</span><span class="p">,</span> <span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">35</span><span class="p">,</span> <span class="s2">&quot;children&quot;</span><span class="p">:</span> <span class="p">[</span>
-</span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="gp">... </span>                 <span class="p">{</span><span class="s2">&quot;name&quot;</span><span class="p">:</span> <span class="s2">&quot;g&quot;</span><span class="p">,</span> <span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="mi">10</span><span class="p">},</span>
-</span><span id="__span-0-12"><a id="__codelineno-0-12" name="__codelineno-0-12" href="#__codelineno-0-12"></a><span class="gp">... </span>             <span class="p">]},</span>
-</span><span id="__span-0-13"><a id="__codelineno-0-13" name="__codelineno-0-13" href="#__codelineno-0-13"></a><span class="gp">... </span>         <span class="p">]},</span>
-</span><span id="__span-0-14"><a id="__codelineno-0-14" name="__codelineno-0-14" href="#__codelineno-0-14"></a><span class="gp">... </span>    <span class="p">],</span>
-</span><span id="__span-0-15"><a id="__codelineno-0-15" name="__codelineno-0-15" href="#__codelineno-0-15"></a><span class="gp">... </span><span class="p">}</span>
-</span><span id="__span-0-16"><a id="__codelineno-0-16" name="__codelineno-0-16" href="#__codelineno-0-16"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">nested_dict_to_tree</span><span class="p">(</span><span class="n">path_dict</span><span class="p">)</span>
-</span><span id="__span-0-17"><a id="__codelineno-0-17" name="__codelineno-0-17" href="#__codelineno-0-17"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">(</span><span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;age&quot;</span><span class="p">])</span>
-</span><span id="__span-0-18"><a id="__codelineno-0-18" name="__codelineno-0-18" href="#__codelineno-0-18"></a><span class="go">a [age=90]</span>
-</span><span id="__span-0-19"><a id="__codelineno-0-19" name="__codelineno-0-19" href="#__codelineno-0-19"></a><span class="go">└── b [age=65]</span>
-</span><span id="__span-0-20"><a id="__codelineno-0-20" name="__codelineno-0-20" href="#__codelineno-0-20"></a><span class="go">    ├── d [age=40]</span>
-</span><span id="__span-0-21"><a id="__codelineno-0-21" name="__codelineno-0-21" href="#__codelineno-0-21"></a><span class="go">    └── e [age=35]</span>
-</span><span id="__span-0-22"><a id="__codelineno-0-22" name="__codelineno-0-22" href="#__codelineno-0-22"></a><span class="go">        └── g [age=10]</span>
+    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">import</span> <span class="nn">pandas</span> <span class="k">as</span> <span class="nn">pd</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">dataframe_to_tree_by_relation</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">relation_data</span> <span class="o">=</span> <span class="n">pd</span><span class="o">.</span><span class="n">DataFrame</span><span class="p">([</span>
+</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="kc">None</span><span class="p">,</span> <span class="mi">90</span><span class="p">],</span>
+</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="mi">65</span><span class="p">],</span>
+</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="mi">60</span><span class="p">],</span>
+</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;d&quot;</span><span class="p">,</span> <span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="mi">40</span><span class="p">],</span>
+</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;e&quot;</span><span class="p">,</span> <span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="mi">35</span><span class="p">],</span>
+</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;f&quot;</span><span class="p">,</span> <span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="mi">38</span><span class="p">],</span>
+</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;g&quot;</span><span class="p">,</span> <span class="s2">&quot;e&quot;</span><span class="p">,</span> <span class="mi">10</span><span class="p">],</span>
+</span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;h&quot;</span><span class="p">,</span> <span class="s2">&quot;e&quot;</span><span class="p">,</span> <span class="mi">6</span><span class="p">],</span>
+</span><span id="__span-0-12"><a id="__codelineno-0-12" name="__codelineno-0-12" href="#__codelineno-0-12"></a><span class="gp">... </span><span class="p">],</span>
+</span><span id="__span-0-13"><a id="__codelineno-0-13" name="__codelineno-0-13" href="#__codelineno-0-13"></a><span class="gp">... </span>    <span class="n">columns</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;child&quot;</span><span class="p">,</span> <span class="s2">&quot;parent&quot;</span><span class="p">,</span> <span class="s2">&quot;age&quot;</span><span class="p">]</span>
+</span><span id="__span-0-14"><a id="__codelineno-0-14" name="__codelineno-0-14" href="#__codelineno-0-14"></a><span class="gp">... </span><span class="p">)</span>
+</span><span id="__span-0-15"><a id="__codelineno-0-15" name="__codelineno-0-15" href="#__codelineno-0-15"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">dataframe_to_tree_by_relation</span><span class="p">(</span><span class="n">relation_data</span><span class="p">)</span>
+</span><span id="__span-0-16"><a id="__codelineno-0-16" name="__codelineno-0-16" href="#__codelineno-0-16"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">(</span><span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;age&quot;</span><span class="p">])</span>
+</span><span id="__span-0-17"><a id="__codelineno-0-17" name="__codelineno-0-17" href="#__codelineno-0-17"></a><span class="go">a [age=90]</span>
+</span><span id="__span-0-18"><a id="__codelineno-0-18" name="__codelineno-0-18" href="#__codelineno-0-18"></a><span class="go">├── b [age=65]</span>
+</span><span id="__span-0-19"><a id="__codelineno-0-19" name="__codelineno-0-19" href="#__codelineno-0-19"></a><span class="go">│   ├── d [age=40]</span>
+</span><span id="__span-0-20"><a id="__codelineno-0-20" name="__codelineno-0-20" href="#__codelineno-0-20"></a><span class="go">│   └── e [age=35]</span>
+</span><span id="__span-0-21"><a id="__codelineno-0-21" name="__codelineno-0-21" href="#__codelineno-0-21"></a><span class="go">│       ├── g [age=10]</span>
+</span><span id="__span-0-22"><a id="__codelineno-0-22" name="__codelineno-0-22" href="#__codelineno-0-22"></a><span class="go">│       └── h [age=6]</span>
+</span><span id="__span-0-23"><a id="__codelineno-0-23" name="__codelineno-0-23" href="#__codelineno-0-23"></a><span class="go">└── c [age=60]</span>
+</span><span id="__span-0-24"><a id="__codelineno-0-24" name="__codelineno-0-24" href="#__codelineno-0-24"></a><span class="go">    └── f [age=38]</span>
 </span></code></pre></div>
 
 
@@ -4090,16 +4856,13 @@ <h3 id="bigtree.tree.construct.nested_dict_to_tree" class="doc doc-heading">
     </thead>
     <tbody>
         <tr>
-          <td><code>node_attrs</code></td>
+          <td><code>data</code></td>
           <td>
-                <code><span title="typing.Dict">Dict</span>[str, <span title="typing.Any">Any</span>]</code>
+                <code><span title="pandas.DataFrame">DataFrame</span></code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>dictionary containing node, children, and node attribute information,
-key: <code>name_key</code> and <code>child_key</code>
-value of <code>name_key</code> (str): node name
-value of <code>child_key</code> (List[Dict[str, Any]]): list of dict containing <code>name_key</code> and <code>child_key</code> (recursive)</p>
+              <p>data containing path and node attribute information</p>
             </div>
           </td>
           <td>
@@ -4107,31 +4870,63 @@ <h3 id="bigtree.tree.construct.nested_dict_to_tree" class="doc doc-heading">
           </td>
         </tr>
         <tr>
-          <td><code>name_key</code></td>
+          <td><code>child_col</code></td>
           <td>
                 <code>str</code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>key of node name, value is type str</p>
+              <p>column of data containing child name information, defaults to None
+if not set, it will take the first column of data</p>
             </div>
           </td>
           <td>
-                <code>&#39;name&#39;</code>
+                <code>&#39;&#39;</code>
           </td>
         </tr>
         <tr>
-          <td><code>child_key</code></td>
+          <td><code>parent_col</code></td>
           <td>
                 <code>str</code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>key of child list, value is type list</p>
+              <p>column of data containing parent name information, defaults to None
+if not set, it will take the second column of data</p>
             </div>
           </td>
           <td>
-                <code>&#39;children&#39;</code>
+                <code>&#39;&#39;</code>
+          </td>
+        </tr>
+        <tr>
+          <td><code>attribute_cols</code></td>
+          <td>
+                <code><span title="typing.List">List</span>[str]</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>columns of data containing node attribute information,
+if not set, it will take all columns of data except <code>child_col</code> and <code>parent_col</code></p>
+            </div>
+          </td>
+          <td>
+                <code>[]</code>
+          </td>
+        </tr>
+        <tr>
+          <td><code>allow_duplicates</code></td>
+          <td>
+                <code>bool</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>allow duplicate intermediate nodes such that child node will
+be tagged to multiple parent nodes, defaults to False</p>
+            </div>
+          </td>
+          <td>
+                <code>False</code>
           </td>
         </tr>
         <tr>
@@ -4184,12 +4979,12 @@ <h3 id="bigtree.tree.construct.nested_dict_to_tree" class="doc doc-heading">
 
 
 
-<h3 id="bigtree.tree.construct.dataframe_to_tree" class="doc doc-heading">
-<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">dataframe_to_tree</span>
+<h3 id="bigtree.tree.construct.polars_to_tree" class="doc doc-heading">
+<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">polars_to_tree</span>
 
 
 </h3>
-<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">dataframe_to_tree</span><span class="p">(</span>
+<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">polars_to_tree</span><span class="p">(</span>
 </span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a>    <span class="n">data</span><span class="p">,</span>
 </span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a>    <span class="n">path_col</span><span class="o">=</span><span class="s2">&quot;&quot;</span><span class="p">,</span>
 </span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a>    <span class="n">attribute_cols</span><span class="o">=</span><span class="p">[],</span>
@@ -4201,7 +4996,7 @@ <h3 id="bigtree.tree.construct.dataframe_to_tree" class="doc doc-heading">
 
   <div class="doc doc-contents ">
   
-      <p>Construct tree from pandas DataFrame using path, return root of tree.</p>
+      <p>Construct tree from polars DataFrame using path, return root of tree.</p>
 <p><code>path_col</code> and <code>attribute_cols</code> specify columns for node path and attributes to construct tree.
 If columns are not specified, <code>path_col</code> takes first column and all other columns are <code>attribute_cols</code>.</p>
 <p>Only attributes in <code>attribute_cols</code> with non-null values will be added to the tree.</p>
@@ -4221,9 +5016,9 @@ <h3 id="bigtree.tree.construct.dataframe_to_tree" class="doc doc-heading">
 
 
 <p><strong>Examples:</strong></p>
-    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">import</span> <span class="nn">pandas</span> <span class="k">as</span> <span class="nn">pd</span>
-</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">dataframe_to_tree</span>
-</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">path_data</span> <span class="o">=</span> <span class="n">pd</span><span class="o">.</span><span class="n">DataFrame</span><span class="p">([</span>
+    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">import</span> <span class="nn">polars</span> <span class="k">as</span> <span class="nn">pl</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">polars_to_tree</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">path_data</span> <span class="o">=</span> <span class="n">pl</span><span class="o">.</span><span class="n">DataFrame</span><span class="p">([</span>
 </span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="mi">90</span><span class="p">],</span>
 </span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a/b&quot;</span><span class="p">,</span> <span class="mi">65</span><span class="p">],</span>
 </span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a/c&quot;</span><span class="p">,</span> <span class="mi">60</span><span class="p">],</span>
@@ -4233,9 +5028,9 @@ <h3 id="bigtree.tree.construct.dataframe_to_tree" class="doc doc-heading">
 </span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a/b/e/g&quot;</span><span class="p">,</span> <span class="mi">10</span><span class="p">],</span>
 </span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a/b/e/h&quot;</span><span class="p">,</span> <span class="mi">6</span><span class="p">],</span>
 </span><span id="__span-0-12"><a id="__codelineno-0-12" name="__codelineno-0-12" href="#__codelineno-0-12"></a><span class="gp">... </span><span class="p">],</span>
-</span><span id="__span-0-13"><a id="__codelineno-0-13" name="__codelineno-0-13" href="#__codelineno-0-13"></a><span class="gp">... </span>    <span class="n">columns</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;PATH&quot;</span><span class="p">,</span> <span class="s2">&quot;age&quot;</span><span class="p">]</span>
+</span><span id="__span-0-13"><a id="__codelineno-0-13" name="__codelineno-0-13" href="#__codelineno-0-13"></a><span class="gp">... </span>    <span class="n">schema</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;PATH&quot;</span><span class="p">,</span> <span class="s2">&quot;age&quot;</span><span class="p">]</span>
 </span><span id="__span-0-14"><a id="__codelineno-0-14" name="__codelineno-0-14" href="#__codelineno-0-14"></a><span class="gp">... </span><span class="p">)</span>
-</span><span id="__span-0-15"><a id="__codelineno-0-15" name="__codelineno-0-15" href="#__codelineno-0-15"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">dataframe_to_tree</span><span class="p">(</span><span class="n">path_data</span><span class="p">)</span>
+</span><span id="__span-0-15"><a id="__codelineno-0-15" name="__codelineno-0-15" href="#__codelineno-0-15"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">polars_to_tree</span><span class="p">(</span><span class="n">path_data</span><span class="p">)</span>
 </span><span id="__span-0-16"><a id="__codelineno-0-16" name="__codelineno-0-16" href="#__codelineno-0-16"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">(</span><span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;age&quot;</span><span class="p">])</span>
 </span><span id="__span-0-17"><a id="__codelineno-0-17" name="__codelineno-0-17" href="#__codelineno-0-17"></a><span class="go">a [age=90]</span>
 </span><span id="__span-0-18"><a id="__codelineno-0-18" name="__codelineno-0-18" href="#__codelineno-0-18"></a><span class="go">├── b [age=65]</span>
@@ -4263,7 +5058,7 @@ <h3 id="bigtree.tree.construct.dataframe_to_tree" class="doc doc-heading">
         <tr>
           <td><code>data</code></td>
           <td>
-                <code><span title="pandas.DataFrame">DataFrame</span></code>
+                <code><span title="polars.DataFrame">DataFrame</span></code>
           </td>
           <td>
             <div class="doc-md-description">
@@ -4382,12 +5177,12 @@ <h3 id="bigtree.tree.construct.dataframe_to_tree" class="doc doc-heading">
 
 
 
-<h3 id="bigtree.tree.construct.dataframe_to_tree_by_relation" class="doc doc-heading">
-<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">dataframe_to_tree_by_relation</span>
+<h3 id="bigtree.tree.construct.polars_to_tree_by_relation" class="doc doc-heading">
+<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">polars_to_tree_by_relation</span>
 
 
 </h3>
-<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">dataframe_to_tree_by_relation</span><span class="p">(</span>
+<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">polars_to_tree_by_relation</span><span class="p">(</span>
 </span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a>    <span class="n">data</span><span class="p">,</span>
 </span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a>    <span class="n">child_col</span><span class="o">=</span><span class="s2">&quot;&quot;</span><span class="p">,</span>
 </span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a>    <span class="n">parent_col</span><span class="o">=</span><span class="s2">&quot;&quot;</span><span class="p">,</span>
@@ -4399,7 +5194,7 @@ <h3 id="bigtree.tree.construct.dataframe_to_tree_by_relation" class="doc doc-hea
 
   <div class="doc doc-contents ">
   
-      <p>Construct tree from pandas DataFrame using parent and child names, return root of tree.</p>
+      <p>Construct tree from polars DataFrame using parent and child names, return root of tree.</p>
 <p>Root node is inferred when parent name is empty, or when name appears in parent column but not in child column.</p>
 <p>Since tree is created from parent-child names, only names of leaf nodes may be repeated.
 Error will be thrown if names of intermediate nodes are repeated as there will be confusion.
@@ -4413,9 +5208,9 @@ <h3 id="bigtree.tree.construct.dataframe_to_tree_by_relation" class="doc doc-hea
 
 
 <p><strong>Examples:</strong></p>
-    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">import</span> <span class="nn">pandas</span> <span class="k">as</span> <span class="nn">pd</span>
-</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">dataframe_to_tree_by_relation</span>
-</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">relation_data</span> <span class="o">=</span> <span class="n">pd</span><span class="o">.</span><span class="n">DataFrame</span><span class="p">([</span>
+    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">import</span> <span class="nn">polars</span> <span class="k">as</span> <span class="nn">pl</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">polars_to_tree_by_relation</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">relation_data</span> <span class="o">=</span> <span class="n">pl</span><span class="o">.</span><span class="n">DataFrame</span><span class="p">([</span>
 </span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="kc">None</span><span class="p">,</span> <span class="mi">90</span><span class="p">],</span>
 </span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="mi">65</span><span class="p">],</span>
 </span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="mi">60</span><span class="p">],</span>
@@ -4425,9 +5220,9 @@ <h3 id="bigtree.tree.construct.dataframe_to_tree_by_relation" class="doc doc-hea
 </span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;g&quot;</span><span class="p">,</span> <span class="s2">&quot;e&quot;</span><span class="p">,</span> <span class="mi">10</span><span class="p">],</span>
 </span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="gp">... </span>    <span class="p">[</span><span class="s2">&quot;h&quot;</span><span class="p">,</span> <span class="s2">&quot;e&quot;</span><span class="p">,</span> <span class="mi">6</span><span class="p">],</span>
 </span><span id="__span-0-12"><a id="__codelineno-0-12" name="__codelineno-0-12" href="#__codelineno-0-12"></a><span class="gp">... </span><span class="p">],</span>
-</span><span id="__span-0-13"><a id="__codelineno-0-13" name="__codelineno-0-13" href="#__codelineno-0-13"></a><span class="gp">... </span>    <span class="n">columns</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;child&quot;</span><span class="p">,</span> <span class="s2">&quot;parent&quot;</span><span class="p">,</span> <span class="s2">&quot;age&quot;</span><span class="p">]</span>
+</span><span id="__span-0-13"><a id="__codelineno-0-13" name="__codelineno-0-13" href="#__codelineno-0-13"></a><span class="gp">... </span>    <span class="n">schema</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;child&quot;</span><span class="p">,</span> <span class="s2">&quot;parent&quot;</span><span class="p">,</span> <span class="s2">&quot;age&quot;</span><span class="p">]</span>
 </span><span id="__span-0-14"><a id="__codelineno-0-14" name="__codelineno-0-14" href="#__codelineno-0-14"></a><span class="gp">... </span><span class="p">)</span>
-</span><span id="__span-0-15"><a id="__codelineno-0-15" name="__codelineno-0-15" href="#__codelineno-0-15"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">dataframe_to_tree_by_relation</span><span class="p">(</span><span class="n">relation_data</span><span class="p">)</span>
+</span><span id="__span-0-15"><a id="__codelineno-0-15" name="__codelineno-0-15" href="#__codelineno-0-15"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">polars_to_tree_by_relation</span><span class="p">(</span><span class="n">relation_data</span><span class="p">)</span>
 </span><span id="__span-0-16"><a id="__codelineno-0-16" name="__codelineno-0-16" href="#__codelineno-0-16"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">(</span><span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;age&quot;</span><span class="p">])</span>
 </span><span id="__span-0-17"><a id="__codelineno-0-17" name="__codelineno-0-17" href="#__codelineno-0-17"></a><span class="go">a [age=90]</span>
 </span><span id="__span-0-18"><a id="__codelineno-0-18" name="__codelineno-0-18" href="#__codelineno-0-18"></a><span class="go">├── b [age=65]</span>
@@ -4455,7 +5250,7 @@ <h3 id="bigtree.tree.construct.dataframe_to_tree_by_relation" class="doc doc-hea
         <tr>
           <td><code>data</code></td>
           <td>
-                <code><span title="pandas.DataFrame">DataFrame</span></code>
+                <code><span title="polars.DataFrame">DataFrame</span></code>
           </td>
           <td>
             <div class="doc-md-description">
diff --git a/bigtree/tree/export/index.html b/bigtree/tree/export/index.html
index 018eef7c..1b883f50 100644
--- a/bigtree/tree/export/index.html
+++ b/bigtree/tree/export/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../../demo/" class="md-tabs__link">
+        <a href="../../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1744,36 +1716,36 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#bigtree.tree.export.tree_to_newick" class="md-nav__link">
+  <a href="#bigtree.tree.export.tree_to_dataframe" class="md-nav__link">
     <span class="md-ellipsis">
-      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;tree_to_newick
+      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;tree_to_dataframe
     </span>
   </a>
   
 </li>
         
           <li class="md-nav__item">
-  <a href="#bigtree.tree.export.tree_to_dict" class="md-nav__link">
+  <a href="#bigtree.tree.export.tree_to_polars" class="md-nav__link">
     <span class="md-ellipsis">
-      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;tree_to_dict
+      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;tree_to_polars
     </span>
   </a>
   
 </li>
         
           <li class="md-nav__item">
-  <a href="#bigtree.tree.export.tree_to_nested_dict" class="md-nav__link">
+  <a href="#bigtree.tree.export.tree_to_dict" class="md-nav__link">
     <span class="md-ellipsis">
-      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;tree_to_nested_dict
+      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;tree_to_dict
     </span>
   </a>
   
 </li>
         
           <li class="md-nav__item">
-  <a href="#bigtree.tree.export.tree_to_dataframe" class="md-nav__link">
+  <a href="#bigtree.tree.export.tree_to_nested_dict" class="md-nav__link">
     <span class="md-ellipsis">
-      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;tree_to_dataframe
+      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;tree_to_nested_dict
     </span>
   </a>
   
@@ -1804,6 +1776,15 @@
     </span>
   </a>
   
+</li>
+        
+          <li class="md-nav__item">
+  <a href="#bigtree.tree.export.tree_to_newick" class="md-nav__link">
+    <span class="md-ellipsis">
+      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;tree_to_newick
+    </span>
+  </a>
+  
 </li>
         
       </ul>
@@ -2445,36 +2426,36 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#bigtree.tree.export.tree_to_newick" class="md-nav__link">
+  <a href="#bigtree.tree.export.tree_to_dataframe" class="md-nav__link">
     <span class="md-ellipsis">
-      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;tree_to_newick
+      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;tree_to_dataframe
     </span>
   </a>
   
 </li>
         
           <li class="md-nav__item">
-  <a href="#bigtree.tree.export.tree_to_dict" class="md-nav__link">
+  <a href="#bigtree.tree.export.tree_to_polars" class="md-nav__link">
     <span class="md-ellipsis">
-      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;tree_to_dict
+      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;tree_to_polars
     </span>
   </a>
   
 </li>
         
           <li class="md-nav__item">
-  <a href="#bigtree.tree.export.tree_to_nested_dict" class="md-nav__link">
+  <a href="#bigtree.tree.export.tree_to_dict" class="md-nav__link">
     <span class="md-ellipsis">
-      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;tree_to_nested_dict
+      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;tree_to_dict
     </span>
   </a>
   
 </li>
         
           <li class="md-nav__item">
-  <a href="#bigtree.tree.export.tree_to_dataframe" class="md-nav__link">
+  <a href="#bigtree.tree.export.tree_to_nested_dict" class="md-nav__link">
     <span class="md-ellipsis">
-      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;tree_to_dataframe
+      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;tree_to_nested_dict
     </span>
   </a>
   
@@ -2505,6 +2486,15 @@
     </span>
   </a>
   
+</li>
+        
+          <li class="md-nav__item">
+  <a href="#bigtree.tree.export.tree_to_newick" class="md-nav__link">
+    <span class="md-ellipsis">
+      <code class="doc-symbol doc-symbol-toc doc-symbol-function"></code>&nbsp;tree_to_newick
+    </span>
+  </a>
+  
 </li>
         
       </ul>
@@ -2554,8 +2544,8 @@ <h2 id="tree-export-methods">Tree Export Methods</h2>
 <td><code>tree_to_dict</code>, <code>tree_to_nested_dict</code></td>
 </tr>
 <tr>
-<td>DataFrame</td>
-<td><code>tree_to_dataframe</code></td>
+<td>DataFrame (pandas, polars)</td>
+<td><code>tree_to_dataframe</code>, <code>tree_to_polars</code></td>
 </tr>
 <tr>
 <td>Dot (for .dot, .png, .svg, .jpeg, etc.)</td>
@@ -2634,6 +2624,14 @@ <h2 id="tree-export-customizations">Tree Export Customizations</h2>
 <td>Column name for path, node name, node parent</td>
 </tr>
 <tr>
+<td><code>tree_to_polars</code></td>
+<td>Yes with <code>attr_dict</code> or <code>all_attrs</code></td>
+<td>Yes with <code>max_depth</code></td>
+<td>Yes with <code>skip_depth</code></td>
+<td>Yes with <code>leaf_only</code></td>
+<td>Column name for path, node name, node parent</td>
+</tr>
+<tr>
 <td><code>tree_to_dot</code></td>
 <td>No</td>
 <td>No</td>
@@ -3600,64 +3598,52 @@ <h3 id="bigtree.tree.export.hyield_tree" class="doc doc-heading">
 
 
 
-<h3 id="bigtree.tree.export.tree_to_newick" class="doc doc-heading">
-<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">tree_to_newick</span>
+<h3 id="bigtree.tree.export.tree_to_dataframe" class="doc doc-heading">
+<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">tree_to_dataframe</span>
 
 
 </h3>
-<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">tree_to_newick</span><span class="p">(</span>
+<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">tree_to_dataframe</span><span class="p">(</span>
 </span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a>    <span class="n">tree</span><span class="p">,</span>
-</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a>    <span class="n">intermediate_node_name</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span>
-</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a>    <span class="n">length_attr</span><span class="o">=</span><span class="s2">&quot;&quot;</span><span class="p">,</span>
-</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a>    <span class="n">length_sep</span><span class="o">=</span><span class="n">NewickCharacter</span><span class="o">.</span><span class="n">SEP</span><span class="p">,</span>
-</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a>    <span class="n">attr_list</span><span class="o">=</span><span class="p">[],</span>
-</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a>    <span class="n">attr_prefix</span><span class="o">=</span><span class="s2">&quot;&amp;&amp;NHX:&quot;</span><span class="p">,</span>
-</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a>    <span class="n">attr_sep</span><span class="o">=</span><span class="n">NewickCharacter</span><span class="o">.</span><span class="n">SEP</span><span class="p">,</span>
-</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a><span class="p">)</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a>    <span class="n">path_col</span><span class="o">=</span><span class="s2">&quot;path&quot;</span><span class="p">,</span>
+</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a>    <span class="n">name_col</span><span class="o">=</span><span class="s2">&quot;name&quot;</span><span class="p">,</span>
+</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a>    <span class="n">parent_col</span><span class="o">=</span><span class="s2">&quot;&quot;</span><span class="p">,</span>
+</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a>    <span class="n">attr_dict</span><span class="o">=</span><span class="p">{},</span>
+</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a>    <span class="n">all_attrs</span><span class="o">=</span><span class="kc">False</span><span class="p">,</span>
+</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a>    <span class="n">max_depth</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span>
+</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a>    <span class="n">skip_depth</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span>
+</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a>    <span class="n">leaf_only</span><span class="o">=</span><span class="kc">False</span><span class="p">,</span>
+</span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="p">)</span>
 </span></code></pre></div>
 
   <div class="doc doc-contents ">
   
-      <p>Export tree to Newick notation. Useful for describing phylogenetic tree.</p>
-<p>In the Newick Notation (or New Hampshire Notation),
-  - Tree is represented in round brackets i.e., <code>(child1,child2,child3)parent</code>.
-  - If there are nested tree, they will be in nested round brackets i.e., <code>((grandchild1)child1,(grandchild2,grandchild3)child2)parent</code>.
-  - If there is length attribute, they will be beside the name i.e., <code>(child1:0.5,child2:0.1)parent</code>.
-  - If there are other attributes, attributes are represented in square brackets i.e., <code>(child1:0.5[S:human],child2:0.1[S:human])parent[S:parent]</code>.</p>
+      <p>Export tree to pandas DataFrame.</p>
+<p>All descendants from <code>tree</code> will be exported, <code>tree</code> can be the root node or child node of tree.</p>
 
-<details class="customizations-include" open>
-  <summary>Customizations include</summary>
-  <ul>
-<li>Omitting names of root and intermediate nodes, default all node names are shown.</li>
-<li>Changing length separator to other symbol, default is <code>:</code>.</li>
-<li>Adding an attribute prefix, default is <code>&amp;&amp;NHX:</code>.</li>
-<li>Changing the attribute separator to other symbol, default is <code>:</code>.</li>
-</ul>
-</details>
 
 
 <p><strong>Examples:</strong></p>
-    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">Node</span><span class="p">,</span> <span class="n">tree_to_newick</span>
-</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="n">species</span><span class="o">=</span><span class="s2">&quot;human&quot;</span><span class="p">)</span>
-</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">b</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">65</span><span class="p">,</span> <span class="n">species</span><span class="o">=</span><span class="s2">&quot;human&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
-</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">c</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">60</span><span class="p">,</span> <span class="n">species</span><span class="o">=</span><span class="s2">&quot;human&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
-</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">d</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;d&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">40</span><span class="p">,</span> <span class="n">species</span><span class="o">=</span><span class="s2">&quot;human&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
-</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">e</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;e&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">35</span><span class="p">,</span> <span class="n">species</span><span class="o">=</span><span class="s2">&quot;human&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
-</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
-</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="go">a</span>
-</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a><span class="go">├── b</span>
-</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a><span class="go">│   ├── d</span>
-</span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="go">│   └── e</span>
-</span><span id="__span-0-12"><a id="__codelineno-0-12" name="__codelineno-0-12" href="#__codelineno-0-12"></a><span class="go">└── c</span>
-</span></code></pre></div>
-    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">tree_to_newick</span><span class="p">(</span><span class="n">root</span><span class="p">)</span>
-</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="go">&#39;((d,e)b,c)a&#39;</span>
-</span></code></pre></div>
-    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">tree_to_newick</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">length_attr</span><span class="o">=</span><span class="s2">&quot;age&quot;</span><span class="p">)</span>
-</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="go">&#39;((d:40,e:35)b:65,c:60)a&#39;</span>
+    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">Node</span><span class="p">,</span> <span class="n">tree_to_dataframe</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">90</span><span class="p">)</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">b</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">65</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
+</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">c</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">60</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
+</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">d</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;d&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">40</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
+</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">e</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;e&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">35</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
+</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">tree_to_dataframe</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">name_col</span><span class="o">=</span><span class="s2">&quot;name&quot;</span><span class="p">,</span> <span class="n">parent_col</span><span class="o">=</span><span class="s2">&quot;parent&quot;</span><span class="p">,</span> <span class="n">path_col</span><span class="o">=</span><span class="s2">&quot;path&quot;</span><span class="p">,</span> <span class="n">attr_dict</span><span class="o">=</span><span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="s2">&quot;person age&quot;</span><span class="p">})</span>
+</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="go">     path name parent  person age</span>
+</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a><span class="go">0      /a    a   None          90</span>
+</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a><span class="go">1    /a/b    b      a          65</span>
+</span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="go">2  /a/b/d    d      b          40</span>
+</span><span id="__span-0-12"><a id="__codelineno-0-12" name="__codelineno-0-12" href="#__codelineno-0-12"></a><span class="go">3  /a/b/e    e      b          35</span>
+</span><span id="__span-0-13"><a id="__codelineno-0-13" name="__codelineno-0-13" href="#__codelineno-0-13"></a><span class="go">4    /a/c    c      a          60</span>
 </span></code></pre></div>
-    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">tree_to_newick</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">length_attr</span><span class="o">=</span><span class="s2">&quot;age&quot;</span><span class="p">,</span> <span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;species&quot;</span><span class="p">])</span>
-</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="go">&#39;((d:40[&amp;&amp;NHX:species=human],e:35[&amp;&amp;NHX:species=human])b:65[&amp;&amp;NHX:species=human],c:60[&amp;&amp;NHX:species=human])a[&amp;&amp;NHX:species=human]&#39;</span>
+    <p>For a subset of a tree.</p>
+    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">tree_to_dataframe</span><span class="p">(</span><span class="n">b</span><span class="p">,</span> <span class="n">name_col</span><span class="o">=</span><span class="s2">&quot;name&quot;</span><span class="p">,</span> <span class="n">parent_col</span><span class="o">=</span><span class="s2">&quot;parent&quot;</span><span class="p">,</span> <span class="n">path_col</span><span class="o">=</span><span class="s2">&quot;path&quot;</span><span class="p">,</span> <span class="n">attr_dict</span><span class="o">=</span><span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="s2">&quot;person age&quot;</span><span class="p">})</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="go">     path name parent  person age</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="go">0    /a/b    b      a          65</span>
+</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="go">1  /a/b/d    d      b          40</span>
+</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="go">2  /a/b/e    e      b          35</span>
 </span></code></pre></div>
 
 
@@ -3688,87 +3674,116 @@ <h3 id="bigtree.tree.export.tree_to_newick" class="doc doc-heading">
           </td>
         </tr>
         <tr>
-          <td><code>intermediate_node_name</code></td>
+          <td><code>path_col</code></td>
           <td>
-                <code>bool</code>
+                <code>str</code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>indicator if intermediate nodes have node names, defaults to True</p>
+              <p>column name for <code>node.path_name</code>, defaults to 'path'</p>
             </div>
           </td>
           <td>
-                <code>True</code>
+                <code>&#39;path&#39;</code>
           </td>
         </tr>
         <tr>
-          <td><code>length_attr</code></td>
+          <td><code>name_col</code></td>
           <td>
                 <code>str</code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>node length attribute to extract to beside name, optional</p>
+              <p>column name for <code>node.node_name</code>, defaults to 'name'</p>
             </div>
           </td>
           <td>
-                <code>&#39;&#39;</code>
+                <code>&#39;name&#39;</code>
           </td>
         </tr>
         <tr>
-          <td><code>length_sep</code></td>
+          <td><code>parent_col</code></td>
           <td>
                 <code>str</code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>separator between node name and length, used if length_attr is non-empty, defaults to ":"</p>
+              <p>column name for <code>node.parent.node_name</code>, optional</p>
             </div>
           </td>
           <td>
-                <code><span title="bigtree.utils.constants.NewickCharacter.SEP">SEP</span></code>
+                <code>&#39;&#39;</code>
           </td>
         </tr>
         <tr>
-          <td><code>attr_list</code></td>
+          <td><code>attr_dict</code></td>
           <td>
-                <code><span title="typing.Iterable">Iterable</span>[str]</code>
+                <code><span title="typing.Dict">Dict</span>[str, str]</code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>list of node attributes to extract into square bracket, optional</p>
+              <p>dictionary mapping node attributes to column name,
+key: node attributes, value: corresponding column in dataframe, optional</p>
             </div>
           </td>
           <td>
-                <code>[]</code>
+                <code>{}</code>
           </td>
         </tr>
         <tr>
-          <td><code>attr_prefix</code></td>
+          <td><code>all_attrs</code></td>
           <td>
-                <code>str</code>
+                <code>bool</code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>prefix before all attributes, within square bracket, used if attr_list is non-empty, defaults to "&amp;&amp;NHX:"</p>
+              <p>indicator whether to retrieve all <code>Node</code> attributes, overrides <code>attr_dict</code>, defaults to False</p>
             </div>
           </td>
           <td>
-                <code>&#39;&amp;&amp;NHX:&#39;</code>
+                <code>False</code>
           </td>
         </tr>
         <tr>
-          <td><code>attr_sep</code></td>
+          <td><code>max_depth</code></td>
           <td>
-                <code>str</code>
+                <code>int</code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>separator between attributes, within square brackets, used if attr_list is non-empty, defaults to ":"</p>
+              <p>maximum depth to export tree, optional</p>
             </div>
           </td>
           <td>
-                <code><span title="bigtree.utils.constants.NewickCharacter.SEP">SEP</span></code>
+                <code>0</code>
+          </td>
+        </tr>
+        <tr>
+          <td><code>skip_depth</code></td>
+          <td>
+                <code>int</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>number of initial depths to skip, optional</p>
+            </div>
+          </td>
+          <td>
+                <code>0</code>
+          </td>
+        </tr>
+        <tr>
+          <td><code>leaf_only</code></td>
+          <td>
+                <code>bool</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>indicator to retrieve only information from leaf nodes</p>
+            </div>
+          </td>
+          <td>
+                <code>False</code>
           </td>
         </tr>
     </tbody>
@@ -3787,11 +3802,11 @@ <h3 id="bigtree.tree.export.tree_to_newick" class="doc doc-heading">
     <tbody>
         <tr>
           <td>
-                <code>str</code>
+                <code><span title="pandas.DataFrame">DataFrame</span></code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>(str)</p>
+              <p>(pd.DataFrame)</p>
             </div>
           </td>
         </tr>
@@ -3807,44 +3822,64 @@ <h3 id="bigtree.tree.export.tree_to_newick" class="doc doc-heading">
 
 
 
-<h3 id="bigtree.tree.export.tree_to_dict" class="doc doc-heading">
-<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">tree_to_dict</span>
+<h3 id="bigtree.tree.export.tree_to_polars" class="doc doc-heading">
+<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">tree_to_polars</span>
 
 
 </h3>
-<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">tree_to_dict</span><span class="p">(</span>
+<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">tree_to_polars</span><span class="p">(</span>
 </span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a>    <span class="n">tree</span><span class="p">,</span>
-</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a>    <span class="n">name_key</span><span class="o">=</span><span class="s2">&quot;name&quot;</span><span class="p">,</span>
-</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a>    <span class="n">parent_key</span><span class="o">=</span><span class="s2">&quot;&quot;</span><span class="p">,</span>
-</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a>    <span class="n">attr_dict</span><span class="o">=</span><span class="p">{},</span>
-</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a>    <span class="n">all_attrs</span><span class="o">=</span><span class="kc">False</span><span class="p">,</span>
-</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a>    <span class="n">max_depth</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span>
-</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a>    <span class="n">skip_depth</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span>
-</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a>    <span class="n">leaf_only</span><span class="o">=</span><span class="kc">False</span><span class="p">,</span>
-</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a><span class="p">)</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a>    <span class="n">path_col</span><span class="o">=</span><span class="s2">&quot;path&quot;</span><span class="p">,</span>
+</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a>    <span class="n">name_col</span><span class="o">=</span><span class="s2">&quot;name&quot;</span><span class="p">,</span>
+</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a>    <span class="n">parent_col</span><span class="o">=</span><span class="s2">&quot;&quot;</span><span class="p">,</span>
+</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a>    <span class="n">attr_dict</span><span class="o">=</span><span class="p">{},</span>
+</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a>    <span class="n">all_attrs</span><span class="o">=</span><span class="kc">False</span><span class="p">,</span>
+</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a>    <span class="n">max_depth</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span>
+</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a>    <span class="n">skip_depth</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span>
+</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a>    <span class="n">leaf_only</span><span class="o">=</span><span class="kc">False</span><span class="p">,</span>
+</span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="p">)</span>
 </span></code></pre></div>
 
   <div class="doc doc-contents ">
   
-      <p>Export tree to dictionary.</p>
+      <p>Export tree to polars DataFrame.</p>
 <p>All descendants from <code>tree</code> will be exported, <code>tree</code> can be the root node or child node of tree.</p>
-<p>Exported dictionary will have key as node path, and node attributes as a nested dictionary.</p>
 
 
 
 <p><strong>Examples:</strong></p>
-    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">Node</span><span class="p">,</span> <span class="n">tree_to_dict</span>
+    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">Node</span><span class="p">,</span> <span class="n">tree_to_polars</span>
 </span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">90</span><span class="p">)</span>
 </span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">b</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">65</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
 </span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">c</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">60</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
 </span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">d</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;d&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">40</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
 </span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">e</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;e&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">35</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
-</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">tree_to_dict</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">name_key</span><span class="o">=</span><span class="s2">&quot;name&quot;</span><span class="p">,</span> <span class="n">parent_key</span><span class="o">=</span><span class="s2">&quot;parent&quot;</span><span class="p">,</span> <span class="n">attr_dict</span><span class="o">=</span><span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="s2">&quot;person age&quot;</span><span class="p">})</span>
-</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="go">{&#39;/a&#39;: {&#39;name&#39;: &#39;a&#39;, &#39;parent&#39;: None, &#39;person age&#39;: 90}, &#39;/a/b&#39;: {&#39;name&#39;: &#39;b&#39;, &#39;parent&#39;: &#39;a&#39;, &#39;person age&#39;: 65}, &#39;/a/b/d&#39;: {&#39;name&#39;: &#39;d&#39;, &#39;parent&#39;: &#39;b&#39;, &#39;person age&#39;: 40}, &#39;/a/b/e&#39;: {&#39;name&#39;: &#39;e&#39;, &#39;parent&#39;: &#39;b&#39;, &#39;person age&#39;: 35}, &#39;/a/c&#39;: {&#39;name&#39;: &#39;c&#39;, &#39;parent&#39;: &#39;a&#39;, &#39;person age&#39;: 60}}</span>
+</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">tree_to_polars</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">name_col</span><span class="o">=</span><span class="s2">&quot;name&quot;</span><span class="p">,</span> <span class="n">parent_col</span><span class="o">=</span><span class="s2">&quot;parent&quot;</span><span class="p">,</span> <span class="n">path_col</span><span class="o">=</span><span class="s2">&quot;path&quot;</span><span class="p">,</span> <span class="n">attr_dict</span><span class="o">=</span><span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="s2">&quot;person age&quot;</span><span class="p">})</span>
+</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="go">shape: (5, 4)</span>
+</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a><span class="go">┌────────┬──────┬────────┬────────────┐</span>
+</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a><span class="go">│ path   ┆ name ┆ parent ┆ person age │</span>
+</span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="go">│ ---    ┆ ---  ┆ ---    ┆ ---        │</span>
+</span><span id="__span-0-12"><a id="__codelineno-0-12" name="__codelineno-0-12" href="#__codelineno-0-12"></a><span class="go">│ str    ┆ str  ┆ str    ┆ i64        │</span>
+</span><span id="__span-0-13"><a id="__codelineno-0-13" name="__codelineno-0-13" href="#__codelineno-0-13"></a><span class="go">╞════════╪══════╪════════╪════════════╡</span>
+</span><span id="__span-0-14"><a id="__codelineno-0-14" name="__codelineno-0-14" href="#__codelineno-0-14"></a><span class="go">│ /a     ┆ a    ┆ null   ┆ 90         │</span>
+</span><span id="__span-0-15"><a id="__codelineno-0-15" name="__codelineno-0-15" href="#__codelineno-0-15"></a><span class="go">│ /a/b   ┆ b    ┆ a      ┆ 65         │</span>
+</span><span id="__span-0-16"><a id="__codelineno-0-16" name="__codelineno-0-16" href="#__codelineno-0-16"></a><span class="go">│ /a/b/d ┆ d    ┆ b      ┆ 40         │</span>
+</span><span id="__span-0-17"><a id="__codelineno-0-17" name="__codelineno-0-17" href="#__codelineno-0-17"></a><span class="go">│ /a/b/e ┆ e    ┆ b      ┆ 35         │</span>
+</span><span id="__span-0-18"><a id="__codelineno-0-18" name="__codelineno-0-18" href="#__codelineno-0-18"></a><span class="go">│ /a/c   ┆ c    ┆ a      ┆ 60         │</span>
+</span><span id="__span-0-19"><a id="__codelineno-0-19" name="__codelineno-0-19" href="#__codelineno-0-19"></a><span class="go">└────────┴──────┴────────┴────────────┘</span>
 </span></code></pre></div>
-    <p>For a subset of a tree</p>
-    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">tree_to_dict</span><span class="p">(</span><span class="n">c</span><span class="p">,</span> <span class="n">name_key</span><span class="o">=</span><span class="s2">&quot;name&quot;</span><span class="p">,</span> <span class="n">parent_key</span><span class="o">=</span><span class="s2">&quot;parent&quot;</span><span class="p">,</span> <span class="n">attr_dict</span><span class="o">=</span><span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="s2">&quot;person age&quot;</span><span class="p">})</span>
-</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="go">{&#39;/a/c&#39;: {&#39;name&#39;: &#39;c&#39;, &#39;parent&#39;: &#39;a&#39;, &#39;person age&#39;: 60}}</span>
+    <p>For a subset of a tree.</p>
+    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">tree_to_polars</span><span class="p">(</span><span class="n">b</span><span class="p">,</span> <span class="n">name_col</span><span class="o">=</span><span class="s2">&quot;name&quot;</span><span class="p">,</span> <span class="n">parent_col</span><span class="o">=</span><span class="s2">&quot;parent&quot;</span><span class="p">,</span> <span class="n">path_col</span><span class="o">=</span><span class="s2">&quot;path&quot;</span><span class="p">,</span> <span class="n">attr_dict</span><span class="o">=</span><span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="s2">&quot;person age&quot;</span><span class="p">})</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="go">shape: (3, 4)</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="go">┌────────┬──────┬────────┬────────────┐</span>
+</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="go">│ path   ┆ name ┆ parent ┆ person age │</span>
+</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="go">│ ---    ┆ ---  ┆ ---    ┆ ---        │</span>
+</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="go">│ str    ┆ str  ┆ str    ┆ i64        │</span>
+</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a><span class="go">╞════════╪══════╪════════╪════════════╡</span>
+</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="go">│ /a/b   ┆ b    ┆ a      ┆ 65         │</span>
+</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a><span class="go">│ /a/b/d ┆ d    ┆ b      ┆ 40         │</span>
+</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a><span class="go">│ /a/b/e ┆ e    ┆ b      ┆ 35         │</span>
+</span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="go">└────────┴──────┴────────┴────────────┘</span>
 </span></code></pre></div>
 
 
@@ -3875,13 +3910,27 @@ <h3 id="bigtree.tree.export.tree_to_dict" class="doc doc-heading">
           </td>
         </tr>
         <tr>
-          <td><code>name_key</code></td>
+          <td><code>path_col</code></td>
           <td>
                 <code>str</code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>dictionary key for <code>node.node_name</code>, defaults to 'name'</p>
+              <p>column name for <code>node.path_name</code>, defaults to 'path'</p>
+            </div>
+          </td>
+          <td>
+                <code>&#39;path&#39;</code>
+          </td>
+        </tr>
+        <tr>
+          <td><code>name_col</code></td>
+          <td>
+                <code>str</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>column name for <code>node.node_name</code>, defaults to 'name'</p>
             </div>
           </td>
           <td>
@@ -3889,13 +3938,13 @@ <h3 id="bigtree.tree.export.tree_to_dict" class="doc doc-heading">
           </td>
         </tr>
         <tr>
-          <td><code>parent_key</code></td>
+          <td><code>parent_col</code></td>
           <td>
                 <code>str</code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>dictionary key for <code>node.parent.node_name</code>, optional</p>
+              <p>column name for <code>node.parent.node_name</code>, optional</p>
             </div>
           </td>
           <td>
@@ -3909,8 +3958,8 @@ <h3 id="bigtree.tree.export.tree_to_dict" class="doc doc-heading">
           </td>
           <td>
             <div class="doc-md-description">
-              <p>dictionary mapping node attributes to dictionary key,
-key: node attributes, value: corresponding dictionary key, optional</p>
+              <p>dictionary mapping node attributes to column name,
+key: node attributes, value: corresponding column in dataframe, optional</p>
             </div>
           </td>
           <td>
@@ -3989,11 +4038,11 @@ <h3 id="bigtree.tree.export.tree_to_dict" class="doc doc-heading">
     <tbody>
         <tr>
           <td>
-                <code><span title="typing.Dict">Dict</span>[str, <span title="typing.Any">Any</span>]</code>
+                <code><span title="polars.DataFrame">DataFrame</span></code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>(Dict[str, Any])</p>
+              <p>(pl.DataFrame)</p>
             </div>
           </td>
         </tr>
@@ -4009,38 +4058,44 @@ <h3 id="bigtree.tree.export.tree_to_dict" class="doc doc-heading">
 
 
 
-<h3 id="bigtree.tree.export.tree_to_nested_dict" class="doc doc-heading">
-<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">tree_to_nested_dict</span>
+<h3 id="bigtree.tree.export.tree_to_dict" class="doc doc-heading">
+<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">tree_to_dict</span>
 
 
 </h3>
-<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">tree_to_nested_dict</span><span class="p">(</span>
+<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">tree_to_dict</span><span class="p">(</span>
 </span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a>    <span class="n">tree</span><span class="p">,</span>
 </span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a>    <span class="n">name_key</span><span class="o">=</span><span class="s2">&quot;name&quot;</span><span class="p">,</span>
-</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a>    <span class="n">child_key</span><span class="o">=</span><span class="s2">&quot;children&quot;</span><span class="p">,</span>
+</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a>    <span class="n">parent_key</span><span class="o">=</span><span class="s2">&quot;&quot;</span><span class="p">,</span>
 </span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a>    <span class="n">attr_dict</span><span class="o">=</span><span class="p">{},</span>
 </span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a>    <span class="n">all_attrs</span><span class="o">=</span><span class="kc">False</span><span class="p">,</span>
 </span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a>    <span class="n">max_depth</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span>
-</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="p">)</span>
+</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a>    <span class="n">skip_depth</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span>
+</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a>    <span class="n">leaf_only</span><span class="o">=</span><span class="kc">False</span><span class="p">,</span>
+</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a><span class="p">)</span>
 </span></code></pre></div>
 
   <div class="doc doc-contents ">
   
-      <p>Export tree to nested dictionary.</p>
+      <p>Export tree to dictionary.</p>
 <p>All descendants from <code>tree</code> will be exported, <code>tree</code> can be the root node or child node of tree.</p>
-<p>Exported dictionary will have key as node attribute names, and children as a nested recursive dictionary.</p>
+<p>Exported dictionary will have key as node path, and node attributes as a nested dictionary.</p>
 
 
 
 <p><strong>Examples:</strong></p>
-    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">Node</span><span class="p">,</span> <span class="n">tree_to_nested_dict</span>
+    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">Node</span><span class="p">,</span> <span class="n">tree_to_dict</span>
 </span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">90</span><span class="p">)</span>
 </span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">b</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">65</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
 </span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">c</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">60</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
 </span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">d</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;d&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">40</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
 </span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">e</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;e&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">35</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
-</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">tree_to_nested_dict</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">all_attrs</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
-</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="go">{&#39;name&#39;: &#39;a&#39;, &#39;age&#39;: 90, &#39;children&#39;: [{&#39;name&#39;: &#39;b&#39;, &#39;age&#39;: 65, &#39;children&#39;: [{&#39;name&#39;: &#39;d&#39;, &#39;age&#39;: 40}, {&#39;name&#39;: &#39;e&#39;, &#39;age&#39;: 35}]}, {&#39;name&#39;: &#39;c&#39;, &#39;age&#39;: 60}]}</span>
+</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">tree_to_dict</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">name_key</span><span class="o">=</span><span class="s2">&quot;name&quot;</span><span class="p">,</span> <span class="n">parent_key</span><span class="o">=</span><span class="s2">&quot;parent&quot;</span><span class="p">,</span> <span class="n">attr_dict</span><span class="o">=</span><span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="s2">&quot;person age&quot;</span><span class="p">})</span>
+</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="go">{&#39;/a&#39;: {&#39;name&#39;: &#39;a&#39;, &#39;parent&#39;: None, &#39;person age&#39;: 90}, &#39;/a/b&#39;: {&#39;name&#39;: &#39;b&#39;, &#39;parent&#39;: &#39;a&#39;, &#39;person age&#39;: 65}, &#39;/a/b/d&#39;: {&#39;name&#39;: &#39;d&#39;, &#39;parent&#39;: &#39;b&#39;, &#39;person age&#39;: 40}, &#39;/a/b/e&#39;: {&#39;name&#39;: &#39;e&#39;, &#39;parent&#39;: &#39;b&#39;, &#39;person age&#39;: 35}, &#39;/a/c&#39;: {&#39;name&#39;: &#39;c&#39;, &#39;parent&#39;: &#39;a&#39;, &#39;person age&#39;: 60}}</span>
+</span></code></pre></div>
+    <p>For a subset of a tree</p>
+    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">tree_to_dict</span><span class="p">(</span><span class="n">c</span><span class="p">,</span> <span class="n">name_key</span><span class="o">=</span><span class="s2">&quot;name&quot;</span><span class="p">,</span> <span class="n">parent_key</span><span class="o">=</span><span class="s2">&quot;parent&quot;</span><span class="p">,</span> <span class="n">attr_dict</span><span class="o">=</span><span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="s2">&quot;person age&quot;</span><span class="p">})</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="go">{&#39;/a/c&#39;: {&#39;name&#39;: &#39;c&#39;, &#39;parent&#39;: &#39;a&#39;, &#39;person age&#39;: 60}}</span>
 </span></code></pre></div>
 
 
@@ -4085,17 +4140,17 @@ <h3 id="bigtree.tree.export.tree_to_nested_dict" class="doc doc-heading">
           </td>
         </tr>
         <tr>
-          <td><code>child_key</code></td>
+          <td><code>parent_key</code></td>
           <td>
                 <code>str</code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>dictionary key for list of children, optional</p>
+              <p>dictionary key for <code>node.parent.node_name</code>, optional</p>
             </div>
           </td>
           <td>
-                <code>&#39;children&#39;</code>
+                <code>&#39;&#39;</code>
           </td>
         </tr>
         <tr>
@@ -4141,6 +4196,34 @@ <h3 id="bigtree.tree.export.tree_to_nested_dict" class="doc doc-heading">
                 <code>0</code>
           </td>
         </tr>
+        <tr>
+          <td><code>skip_depth</code></td>
+          <td>
+                <code>int</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>number of initial depths to skip, optional</p>
+            </div>
+          </td>
+          <td>
+                <code>0</code>
+          </td>
+        </tr>
+        <tr>
+          <td><code>leaf_only</code></td>
+          <td>
+                <code>bool</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>indicator to retrieve only information from leaf nodes</p>
+            </div>
+          </td>
+          <td>
+                <code>False</code>
+          </td>
+        </tr>
     </tbody>
   </table>
 
@@ -4177,52 +4260,38 @@ <h3 id="bigtree.tree.export.tree_to_nested_dict" class="doc doc-heading">
 
 
 
-<h3 id="bigtree.tree.export.tree_to_dataframe" class="doc doc-heading">
-<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">tree_to_dataframe</span>
+<h3 id="bigtree.tree.export.tree_to_nested_dict" class="doc doc-heading">
+<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">tree_to_nested_dict</span>
 
 
 </h3>
-<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">tree_to_dataframe</span><span class="p">(</span>
+<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">tree_to_nested_dict</span><span class="p">(</span>
 </span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a>    <span class="n">tree</span><span class="p">,</span>
-</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a>    <span class="n">path_col</span><span class="o">=</span><span class="s2">&quot;path&quot;</span><span class="p">,</span>
-</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a>    <span class="n">name_col</span><span class="o">=</span><span class="s2">&quot;name&quot;</span><span class="p">,</span>
-</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a>    <span class="n">parent_col</span><span class="o">=</span><span class="s2">&quot;&quot;</span><span class="p">,</span>
-</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a>    <span class="n">attr_dict</span><span class="o">=</span><span class="p">{},</span>
-</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a>    <span class="n">all_attrs</span><span class="o">=</span><span class="kc">False</span><span class="p">,</span>
-</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a>    <span class="n">max_depth</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span>
-</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a>    <span class="n">skip_depth</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span>
-</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a>    <span class="n">leaf_only</span><span class="o">=</span><span class="kc">False</span><span class="p">,</span>
-</span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="p">)</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a>    <span class="n">name_key</span><span class="o">=</span><span class="s2">&quot;name&quot;</span><span class="p">,</span>
+</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a>    <span class="n">child_key</span><span class="o">=</span><span class="s2">&quot;children&quot;</span><span class="p">,</span>
+</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a>    <span class="n">attr_dict</span><span class="o">=</span><span class="p">{},</span>
+</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a>    <span class="n">all_attrs</span><span class="o">=</span><span class="kc">False</span><span class="p">,</span>
+</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a>    <span class="n">max_depth</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span>
+</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="p">)</span>
 </span></code></pre></div>
 
   <div class="doc doc-contents ">
   
-      <p>Export tree to pandas DataFrame.</p>
+      <p>Export tree to nested dictionary.</p>
 <p>All descendants from <code>tree</code> will be exported, <code>tree</code> can be the root node or child node of tree.</p>
+<p>Exported dictionary will have key as node attribute names, and children as a nested recursive dictionary.</p>
 
 
 
 <p><strong>Examples:</strong></p>
-    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">Node</span><span class="p">,</span> <span class="n">tree_to_dataframe</span>
+    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">Node</span><span class="p">,</span> <span class="n">tree_to_nested_dict</span>
 </span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">90</span><span class="p">)</span>
 </span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">b</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">65</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
 </span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">c</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">60</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
 </span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">d</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;d&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">40</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
 </span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">e</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;e&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">35</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
-</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">tree_to_dataframe</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">name_col</span><span class="o">=</span><span class="s2">&quot;name&quot;</span><span class="p">,</span> <span class="n">parent_col</span><span class="o">=</span><span class="s2">&quot;parent&quot;</span><span class="p">,</span> <span class="n">path_col</span><span class="o">=</span><span class="s2">&quot;path&quot;</span><span class="p">,</span> <span class="n">attr_dict</span><span class="o">=</span><span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="s2">&quot;person age&quot;</span><span class="p">})</span>
-</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="go">     path name parent  person age</span>
-</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a><span class="go">0      /a    a   None          90</span>
-</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a><span class="go">1    /a/b    b      a          65</span>
-</span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="go">2  /a/b/d    d      b          40</span>
-</span><span id="__span-0-12"><a id="__codelineno-0-12" name="__codelineno-0-12" href="#__codelineno-0-12"></a><span class="go">3  /a/b/e    e      b          35</span>
-</span><span id="__span-0-13"><a id="__codelineno-0-13" name="__codelineno-0-13" href="#__codelineno-0-13"></a><span class="go">4    /a/c    c      a          60</span>
-</span></code></pre></div>
-    <p>For a subset of a tree.</p>
-    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">tree_to_dataframe</span><span class="p">(</span><span class="n">b</span><span class="p">,</span> <span class="n">name_col</span><span class="o">=</span><span class="s2">&quot;name&quot;</span><span class="p">,</span> <span class="n">parent_col</span><span class="o">=</span><span class="s2">&quot;parent&quot;</span><span class="p">,</span> <span class="n">path_col</span><span class="o">=</span><span class="s2">&quot;path&quot;</span><span class="p">,</span> <span class="n">attr_dict</span><span class="o">=</span><span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="s2">&quot;person age&quot;</span><span class="p">})</span>
-</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="go">     path name parent  person age</span>
-</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="go">0    /a/b    b      a          65</span>
-</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="go">1  /a/b/d    d      b          40</span>
-</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="go">2  /a/b/e    e      b          35</span>
+</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">tree_to_nested_dict</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">all_attrs</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
+</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="go">{&#39;name&#39;: &#39;a&#39;, &#39;age&#39;: 90, &#39;children&#39;: [{&#39;name&#39;: &#39;b&#39;, &#39;age&#39;: 65, &#39;children&#39;: [{&#39;name&#39;: &#39;d&#39;, &#39;age&#39;: 40}, {&#39;name&#39;: &#39;e&#39;, &#39;age&#39;: 35}]}, {&#39;name&#39;: &#39;c&#39;, &#39;age&#39;: 60}]}</span>
 </span></code></pre></div>
 
 
@@ -4253,27 +4322,13 @@ <h3 id="bigtree.tree.export.tree_to_dataframe" class="doc doc-heading">
           </td>
         </tr>
         <tr>
-          <td><code>path_col</code></td>
-          <td>
-                <code>str</code>
-          </td>
-          <td>
-            <div class="doc-md-description">
-              <p>column name for <code>node.path_name</code>, defaults to 'path'</p>
-            </div>
-          </td>
-          <td>
-                <code>&#39;path&#39;</code>
-          </td>
-        </tr>
-        <tr>
-          <td><code>name_col</code></td>
+          <td><code>name_key</code></td>
           <td>
                 <code>str</code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>column name for <code>node.node_name</code>, defaults to 'name'</p>
+              <p>dictionary key for <code>node.node_name</code>, defaults to 'name'</p>
             </div>
           </td>
           <td>
@@ -4281,17 +4336,17 @@ <h3 id="bigtree.tree.export.tree_to_dataframe" class="doc doc-heading">
           </td>
         </tr>
         <tr>
-          <td><code>parent_col</code></td>
+          <td><code>child_key</code></td>
           <td>
                 <code>str</code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>column name for <code>node.parent.node_name</code>, optional</p>
+              <p>dictionary key for list of children, optional</p>
             </div>
           </td>
           <td>
-                <code>&#39;&#39;</code>
+                <code>&#39;children&#39;</code>
           </td>
         </tr>
         <tr>
@@ -4301,8 +4356,8 @@ <h3 id="bigtree.tree.export.tree_to_dataframe" class="doc doc-heading">
           </td>
           <td>
             <div class="doc-md-description">
-              <p>dictionary mapping node attributes to column name,
-key: node attributes, value: corresponding column in dataframe, optional</p>
+              <p>dictionary mapping node attributes to dictionary key,
+key: node attributes, value: corresponding dictionary key, optional</p>
             </div>
           </td>
           <td>
@@ -4337,34 +4392,6 @@ <h3 id="bigtree.tree.export.tree_to_dataframe" class="doc doc-heading">
                 <code>0</code>
           </td>
         </tr>
-        <tr>
-          <td><code>skip_depth</code></td>
-          <td>
-                <code>int</code>
-          </td>
-          <td>
-            <div class="doc-md-description">
-              <p>number of initial depths to skip, optional</p>
-            </div>
-          </td>
-          <td>
-                <code>0</code>
-          </td>
-        </tr>
-        <tr>
-          <td><code>leaf_only</code></td>
-          <td>
-                <code>bool</code>
-          </td>
-          <td>
-            <div class="doc-md-description">
-              <p>indicator to retrieve only information from leaf nodes</p>
-            </div>
-          </td>
-          <td>
-                <code>False</code>
-          </td>
-        </tr>
     </tbody>
   </table>
 
@@ -4381,11 +4408,11 @@ <h3 id="bigtree.tree.export.tree_to_dataframe" class="doc doc-heading">
     <tbody>
         <tr>
           <td>
-                <code><span title="pandas.DataFrame">DataFrame</span></code>
+                <code><span title="typing.Dict">Dict</span>[str, <span title="typing.Any">Any</span>]</code>
           </td>
           <td>
             <div class="doc-md-description">
-              <p>(pd.DataFrame)</p>
+              <p>(Dict[str, Any])</p>
             </div>
           </td>
         </tr>
@@ -5268,6 +5295,213 @@ <h3 id="bigtree.tree.export.tree_to_mermaid" class="doc doc-heading">
 </div>
 
 
+<div class="doc doc-object doc-function">
+
+
+
+<h3 id="bigtree.tree.export.tree_to_newick" class="doc doc-heading">
+<code class="doc-symbol doc-symbol-heading doc-symbol-function"></code>          <span class="doc doc-object-name doc-function-name">tree_to_newick</span>
+
+
+</h3>
+<div class="doc-signature highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="nf">tree_to_newick</span><span class="p">(</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a>    <span class="n">tree</span><span class="p">,</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a>    <span class="n">intermediate_node_name</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span>
+</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a>    <span class="n">length_attr</span><span class="o">=</span><span class="s2">&quot;&quot;</span><span class="p">,</span>
+</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a>    <span class="n">length_sep</span><span class="o">=</span><span class="n">NewickCharacter</span><span class="o">.</span><span class="n">SEP</span><span class="p">,</span>
+</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a>    <span class="n">attr_list</span><span class="o">=</span><span class="p">[],</span>
+</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a>    <span class="n">attr_prefix</span><span class="o">=</span><span class="s2">&quot;&amp;&amp;NHX:&quot;</span><span class="p">,</span>
+</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a>    <span class="n">attr_sep</span><span class="o">=</span><span class="n">NewickCharacter</span><span class="o">.</span><span class="n">SEP</span><span class="p">,</span>
+</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a><span class="p">)</span>
+</span></code></pre></div>
+
+  <div class="doc doc-contents ">
+  
+      <p>Export tree to Newick notation. Useful for describing phylogenetic tree.</p>
+<p>In the Newick Notation (or New Hampshire Notation),
+  - Tree is represented in round brackets i.e., <code>(child1,child2,child3)parent</code>.
+  - If there are nested tree, they will be in nested round brackets i.e., <code>((grandchild1)child1,(grandchild2,grandchild3)child2)parent</code>.
+  - If there is length attribute, they will be beside the name i.e., <code>(child1:0.5,child2:0.1)parent</code>.
+  - If there are other attributes, attributes are represented in square brackets i.e., <code>(child1:0.5[S:human],child2:0.1[S:human])parent[S:parent]</code>.</p>
+
+<details class="customizations-include" open>
+  <summary>Customizations include</summary>
+  <ul>
+<li>Omitting names of root and intermediate nodes, default all node names are shown.</li>
+<li>Changing length separator to other symbol, default is <code>:</code>.</li>
+<li>Adding an attribute prefix, default is <code>&amp;&amp;NHX:</code>.</li>
+<li>Changing the attribute separator to other symbol, default is <code>:</code>.</li>
+</ul>
+</details>
+
+
+<p><strong>Examples:</strong></p>
+    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">Node</span><span class="p">,</span> <span class="n">tree_to_newick</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="n">species</span><span class="o">=</span><span class="s2">&quot;human&quot;</span><span class="p">)</span>
+</span><span id="__span-0-3"><a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">b</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">65</span><span class="p">,</span> <span class="n">species</span><span class="o">=</span><span class="s2">&quot;human&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
+</span><span id="__span-0-4"><a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">c</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">60</span><span class="p">,</span> <span class="n">species</span><span class="o">=</span><span class="s2">&quot;human&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
+</span><span id="__span-0-5"><a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">d</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;d&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">40</span><span class="p">,</span> <span class="n">species</span><span class="o">=</span><span class="s2">&quot;human&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
+</span><span id="__span-0-6"><a id="__codelineno-0-6" name="__codelineno-0-6" href="#__codelineno-0-6"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">e</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;e&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">35</span><span class="p">,</span> <span class="n">species</span><span class="o">=</span><span class="s2">&quot;human&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
+</span><span id="__span-0-7"><a id="__codelineno-0-7" name="__codelineno-0-7" href="#__codelineno-0-7"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
+</span><span id="__span-0-8"><a id="__codelineno-0-8" name="__codelineno-0-8" href="#__codelineno-0-8"></a><span class="go">a</span>
+</span><span id="__span-0-9"><a id="__codelineno-0-9" name="__codelineno-0-9" href="#__codelineno-0-9"></a><span class="go">├── b</span>
+</span><span id="__span-0-10"><a id="__codelineno-0-10" name="__codelineno-0-10" href="#__codelineno-0-10"></a><span class="go">│   ├── d</span>
+</span><span id="__span-0-11"><a id="__codelineno-0-11" name="__codelineno-0-11" href="#__codelineno-0-11"></a><span class="go">│   └── e</span>
+</span><span id="__span-0-12"><a id="__codelineno-0-12" name="__codelineno-0-12" href="#__codelineno-0-12"></a><span class="go">└── c</span>
+</span></code></pre></div>
+    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">tree_to_newick</span><span class="p">(</span><span class="n">root</span><span class="p">)</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="go">&#39;((d,e)b,c)a&#39;</span>
+</span></code></pre></div>
+    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">tree_to_newick</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">length_attr</span><span class="o">=</span><span class="s2">&quot;age&quot;</span><span class="p">)</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="go">&#39;((d:40,e:35)b:65,c:60)a&#39;</span>
+</span></code></pre></div>
+    <div class="highlight"><pre><span></span><code><span id="__span-0-1"><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="gp">&gt;&gt;&gt; </span><span class="n">tree_to_newick</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">length_attr</span><span class="o">=</span><span class="s2">&quot;age&quot;</span><span class="p">,</span> <span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;species&quot;</span><span class="p">])</span>
+</span><span id="__span-0-2"><a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="go">&#39;((d:40[&amp;&amp;NHX:species=human],e:35[&amp;&amp;NHX:species=human])b:65[&amp;&amp;NHX:species=human],c:60[&amp;&amp;NHX:species=human])a[&amp;&amp;NHX:species=human]&#39;</span>
+</span></code></pre></div>
+
+
+
+  <p><strong>Parameters:</strong></p>
+  <table>
+    <thead>
+      <tr>
+        <th>Name</th>
+        <th>Type</th>
+        <th>Description</th>
+        <th>Default</th>
+      </tr>
+    </thead>
+    <tbody>
+        <tr>
+          <td><code>tree</code></td>
+          <td>
+                <code><a class="autorefs autorefs-internal" title="bigtree.node.node.Node" href="../../node/node/#bigtree.node.node.Node">Node</a></code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>tree to be exported</p>
+            </div>
+          </td>
+          <td>
+              <em>required</em>
+          </td>
+        </tr>
+        <tr>
+          <td><code>intermediate_node_name</code></td>
+          <td>
+                <code>bool</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>indicator if intermediate nodes have node names, defaults to True</p>
+            </div>
+          </td>
+          <td>
+                <code>True</code>
+          </td>
+        </tr>
+        <tr>
+          <td><code>length_attr</code></td>
+          <td>
+                <code>str</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>node length attribute to extract to beside name, optional</p>
+            </div>
+          </td>
+          <td>
+                <code>&#39;&#39;</code>
+          </td>
+        </tr>
+        <tr>
+          <td><code>length_sep</code></td>
+          <td>
+                <code>str</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>separator between node name and length, used if length_attr is non-empty, defaults to ":"</p>
+            </div>
+          </td>
+          <td>
+                <code><span title="bigtree.utils.constants.NewickCharacter.SEP">SEP</span></code>
+          </td>
+        </tr>
+        <tr>
+          <td><code>attr_list</code></td>
+          <td>
+                <code><span title="typing.Iterable">Iterable</span>[str]</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>list of node attributes to extract into square bracket, optional</p>
+            </div>
+          </td>
+          <td>
+                <code>[]</code>
+          </td>
+        </tr>
+        <tr>
+          <td><code>attr_prefix</code></td>
+          <td>
+                <code>str</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>prefix before all attributes, within square bracket, used if attr_list is non-empty, defaults to "&amp;&amp;NHX:"</p>
+            </div>
+          </td>
+          <td>
+                <code>&#39;&amp;&amp;NHX:&#39;</code>
+          </td>
+        </tr>
+        <tr>
+          <td><code>attr_sep</code></td>
+          <td>
+                <code>str</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>separator between attributes, within square brackets, used if attr_list is non-empty, defaults to ":"</p>
+            </div>
+          </td>
+          <td>
+                <code><span title="bigtree.utils.constants.NewickCharacter.SEP">SEP</span></code>
+          </td>
+        </tr>
+    </tbody>
+  </table>
+
+
+
+  <p><strong>Returns:</strong></p>
+  <table>
+    <thead>
+      <tr>
+        <th>Type</th>
+        <th>Description</th>
+      </tr>
+    </thead>
+    <tbody>
+        <tr>
+          <td>
+                <code>str</code>
+          </td>
+          <td>
+            <div class="doc-md-description">
+              <p>(str)</p>
+            </div>
+          </td>
+        </tr>
+    </tbody>
+  </table>
+
+  </div>
+
+</div>
+
+
 
   </div>
 
diff --git a/bigtree/tree/helper/index.html b/bigtree/tree/helper/index.html
index 2ddbedfa..21f80575 100644
--- a/bigtree/tree/helper/index.html
+++ b/bigtree/tree/helper/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../../demo/" class="md-tabs__link">
+        <a href="../../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/bigtree/tree/index.html b/bigtree/tree/index.html
index 9df682a6..534d7968 100644
--- a/bigtree/tree/index.html
+++ b/bigtree/tree/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../demo/" class="md-tabs__link">
+        <a href="../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/bigtree/tree/modify/index.html b/bigtree/tree/modify/index.html
index 4c8be432..62984253 100644
--- a/bigtree/tree/modify/index.html
+++ b/bigtree/tree/modify/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../../demo/" class="md-tabs__link">
+        <a href="../../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/bigtree/tree/search/index.html b/bigtree/tree/search/index.html
index 7e8de4e1..7daaa834 100644
--- a/bigtree/tree/search/index.html
+++ b/bigtree/tree/search/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../../demo/" class="md-tabs__link">
+        <a href="../../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/bigtree/utils/index.html b/bigtree/utils/index.html
index 66a025c6..3ebd0334 100644
--- a/bigtree/utils/index.html
+++ b/bigtree/utils/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../demo/" class="md-tabs__link">
+        <a href="../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/bigtree/utils/iterators/index.html b/bigtree/utils/iterators/index.html
index d2dbcb1f..bcc01bb2 100644
--- a/bigtree/utils/iterators/index.html
+++ b/bigtree/utils/iterators/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../../demo/" class="md-tabs__link">
+        <a href="../../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/bigtree/utils/plot/index.html b/bigtree/utils/plot/index.html
index 92d05244..d45ae42d 100644
--- a/bigtree/utils/plot/index.html
+++ b/bigtree/utils/plot/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../../demo/" class="md-tabs__link">
+        <a href="../../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/bigtree/workflows/app_calendar/index.html b/bigtree/workflows/app_calendar/index.html
index 92e07ea6..edd54944 100644
--- a/bigtree/workflows/app_calendar/index.html
+++ b/bigtree/workflows/app_calendar/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../../demo/" class="md-tabs__link">
+        <a href="../../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/bigtree/workflows/app_todo/index.html b/bigtree/workflows/app_todo/index.html
index 16f1790f..07038dca 100644
--- a/bigtree/workflows/app_todo/index.html
+++ b/bigtree/workflows/app_todo/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../../demo/" class="md-tabs__link">
+        <a href="../../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/bigtree/workflows/index.html b/bigtree/workflows/index.html
index 631564af..16c1a005 100644
--- a/bigtree/workflows/index.html
+++ b/bigtree/workflows/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../demo/" class="md-tabs__link">
+        <a href="../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/binarytree/index.html b/binarytree/index.html
index 29eb885e..3c2cf63f 100644
--- a/binarytree/index.html
+++ b/binarytree/index.html
@@ -289,7 +289,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../demo/" class="md-tabs__link">
+        <a href="../demo/tree/" class="md-tabs__link">
           
   
     
@@ -953,10 +953,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -981,24 +977,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -1008,8 +996,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1111,10 +1097,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1131,24 +1113,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1158,8 +1132,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/changelog/index.html b/changelog/index.html
index facd669e..4294ee37 100644
--- a/changelog/index.html
+++ b/changelog/index.html
@@ -17,7 +17,7 @@
         <link rel="prev" href="../benchmarks/">
       
       
-        <link rel="next" href="../demo/">
+        <link rel="next" href="../demo/tree/">
       
       
       <link rel="icon" href="../_static/favicon.ico">
@@ -289,7 +289,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../demo/" class="md-tabs__link">
+        <a href="../demo/tree/" class="md-tabs__link">
           
   
     
@@ -855,6 +855,39 @@
     </span>
   </a>
   
+</li>
+      
+        <li class="md-nav__item">
+  <a href="#0180-2024-05-28" class="md-nav__link">
+    <span class="md-ellipsis">
+      0.18.0 - 2024-05-28
+    </span>
+  </a>
+  
+    <nav class="md-nav" aria-label="0.18.0 - 2024-05-28">
+      <ul class="md-nav__list">
+        
+          <li class="md-nav__item">
+  <a href="#added" class="md-nav__link">
+    <span class="md-ellipsis">
+      Added:
+    </span>
+  </a>
+  
+</li>
+        
+          <li class="md-nav__item">
+  <a href="#fixed" class="md-nav__link">
+    <span class="md-ellipsis">
+      Fixed:
+    </span>
+  </a>
+  
+</li>
+        
+      </ul>
+    </nav>
+  
 </li>
       
         <li class="md-nav__item">
@@ -877,7 +910,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed" class="md-nav__link">
+  <a href="#fixed_1" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed:
     </span>
@@ -901,7 +934,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_1" class="md-nav__link">
+  <a href="#fixed_2" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -925,7 +958,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added" class="md-nav__link">
+  <a href="#added_1" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -943,7 +976,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_2" class="md-nav__link">
+  <a href="#fixed_3" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -967,7 +1000,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_3" class="md-nav__link">
+  <a href="#fixed_4" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -991,7 +1024,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_1" class="md-nav__link">
+  <a href="#added_2" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -1009,7 +1042,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_4" class="md-nav__link">
+  <a href="#fixed_5" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -1033,7 +1066,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_2" class="md-nav__link">
+  <a href="#added_3" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -1066,7 +1099,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_5" class="md-nav__link">
+  <a href="#fixed_6" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -1090,7 +1123,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_3" class="md-nav__link">
+  <a href="#added_4" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -1108,7 +1141,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_6" class="md-nav__link">
+  <a href="#fixed_7" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -1132,7 +1165,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_4" class="md-nav__link">
+  <a href="#added_5" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -1150,7 +1183,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_7" class="md-nav__link">
+  <a href="#fixed_8" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -1174,7 +1207,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_5" class="md-nav__link">
+  <a href="#added_6" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -1240,7 +1273,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_8" class="md-nav__link">
+  <a href="#fixed_9" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -1264,7 +1297,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_6" class="md-nav__link">
+  <a href="#added_7" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -1288,7 +1321,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_7" class="md-nav__link">
+  <a href="#added_8" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -1312,7 +1345,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_8" class="md-nav__link">
+  <a href="#added_9" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -1330,7 +1363,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_9" class="md-nav__link">
+  <a href="#fixed_10" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -1354,7 +1387,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_9" class="md-nav__link">
+  <a href="#added_10" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -1396,7 +1429,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_10" class="md-nav__link">
+  <a href="#fixed_11" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -1429,7 +1462,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_11" class="md-nav__link">
+  <a href="#fixed_12" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -1453,7 +1486,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_10" class="md-nav__link">
+  <a href="#added_11" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -1534,7 +1567,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_11" class="md-nav__link">
+  <a href="#added_12" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -1558,7 +1591,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_12" class="md-nav__link">
+  <a href="#added_13" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -1582,7 +1615,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_13" class="md-nav__link">
+  <a href="#added_14" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -1606,7 +1639,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_14" class="md-nav__link">
+  <a href="#added_15" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -1630,7 +1663,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_15" class="md-nav__link">
+  <a href="#added_16" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -1654,7 +1687,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_16" class="md-nav__link">
+  <a href="#added_17" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -1678,7 +1711,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_17" class="md-nav__link">
+  <a href="#added_18" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -1702,7 +1735,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_18" class="md-nav__link">
+  <a href="#added_19" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -1735,7 +1768,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_19" class="md-nav__link">
+  <a href="#added_20" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -1744,7 +1777,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_12" class="md-nav__link">
+  <a href="#fixed_13" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -1768,7 +1801,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_20" class="md-nav__link">
+  <a href="#added_21" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -1840,7 +1873,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_13" class="md-nav__link">
+  <a href="#fixed_14" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -1873,7 +1906,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_14" class="md-nav__link">
+  <a href="#fixed_15" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -1897,7 +1930,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_21" class="md-nav__link">
+  <a href="#added_22" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -1915,7 +1948,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_15" class="md-nav__link">
+  <a href="#fixed_16" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -1939,7 +1972,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_22" class="md-nav__link">
+  <a href="#added_23" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -1972,7 +2005,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_16" class="md-nav__link">
+  <a href="#fixed_17" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -1996,7 +2029,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_23" class="md-nav__link">
+  <a href="#added_24" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -2020,7 +2053,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_24" class="md-nav__link">
+  <a href="#added_25" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -2044,7 +2077,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_25" class="md-nav__link">
+  <a href="#added_26" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -2053,7 +2086,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_17" class="md-nav__link">
+  <a href="#fixed_18" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -2077,7 +2110,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_26" class="md-nav__link">
+  <a href="#added_27" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -2095,7 +2128,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_18" class="md-nav__link">
+  <a href="#fixed_19" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -2128,7 +2161,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_19" class="md-nav__link">
+  <a href="#fixed_20" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -2152,7 +2185,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_27" class="md-nav__link">
+  <a href="#added_28" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -2200,7 +2233,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_28" class="md-nav__link">
+  <a href="#added_29" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -2218,7 +2251,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_20" class="md-nav__link">
+  <a href="#fixed_21" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -2242,7 +2275,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_29" class="md-nav__link">
+  <a href="#added_30" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -2323,7 +2356,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_21" class="md-nav__link">
+  <a href="#fixed_22" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -2347,7 +2380,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_30" class="md-nav__link">
+  <a href="#added_31" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -2365,7 +2398,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_22" class="md-nav__link">
+  <a href="#fixed_23" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -2389,7 +2422,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_23" class="md-nav__link">
+  <a href="#fixed_24" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -2413,7 +2446,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_31" class="md-nav__link">
+  <a href="#added_32" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -2437,7 +2470,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_32" class="md-nav__link">
+  <a href="#added_33" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -2461,7 +2494,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_33" class="md-nav__link">
+  <a href="#added_34" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -2485,7 +2518,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_34" class="md-nav__link">
+  <a href="#added_35" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -2509,7 +2542,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_24" class="md-nav__link">
+  <a href="#fixed_25" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -2533,7 +2566,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_35" class="md-nav__link">
+  <a href="#added_36" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -2557,7 +2590,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_25" class="md-nav__link">
+  <a href="#fixed_26" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -2605,7 +2638,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_36" class="md-nav__link">
+  <a href="#added_37" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -2629,7 +2662,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_37" class="md-nav__link">
+  <a href="#added_38" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -2653,7 +2686,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_26" class="md-nav__link">
+  <a href="#fixed_27" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -2677,7 +2710,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_38" class="md-nav__link">
+  <a href="#added_39" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -2695,7 +2728,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_27" class="md-nav__link">
+  <a href="#fixed_28" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -2767,7 +2800,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_39" class="md-nav__link">
+  <a href="#added_40" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -2776,7 +2809,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_28" class="md-nav__link">
+  <a href="#fixed_29" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -2800,7 +2833,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_40" class="md-nav__link">
+  <a href="#added_41" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -2809,7 +2842,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_29" class="md-nav__link">
+  <a href="#fixed_30" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -2833,7 +2866,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_41" class="md-nav__link">
+  <a href="#added_42" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -2842,7 +2875,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_30" class="md-nav__link">
+  <a href="#fixed_31" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -2866,7 +2899,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_42" class="md-nav__link">
+  <a href="#added_43" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -2875,7 +2908,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_31" class="md-nav__link">
+  <a href="#fixed_32" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -2899,7 +2932,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_32" class="md-nav__link">
+  <a href="#fixed_33" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -2923,7 +2956,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_43" class="md-nav__link">
+  <a href="#added_44" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -2947,7 +2980,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_44" class="md-nav__link">
+  <a href="#added_45" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -2980,7 +3013,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_45" class="md-nav__link">
+  <a href="#added_46" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -3037,7 +3070,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_33" class="md-nav__link">
+  <a href="#fixed_34" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -3061,7 +3094,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_46" class="md-nav__link">
+  <a href="#added_47" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -3085,7 +3118,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_34" class="md-nav__link">
+  <a href="#fixed_35" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -3109,7 +3142,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_35" class="md-nav__link">
+  <a href="#fixed_36" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -3133,7 +3166,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_47" class="md-nav__link">
+  <a href="#added_48" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -3157,7 +3190,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_48" class="md-nav__link">
+  <a href="#added_49" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -3190,7 +3223,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_36" class="md-nav__link">
+  <a href="#fixed_37" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -3214,7 +3247,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_49" class="md-nav__link">
+  <a href="#added_50" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -3238,7 +3271,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_50" class="md-nav__link">
+  <a href="#added_51" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -3271,7 +3304,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_51" class="md-nav__link">
+  <a href="#added_52" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -3295,7 +3328,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_52" class="md-nav__link">
+  <a href="#added_53" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -3386,10 +3419,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -3414,24 +3443,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -3441,8 +3462,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -3544,10 +3563,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -3564,24 +3579,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -3591,8 +3598,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -4707,19 +4712,19 @@
 </li>
       
         <li class="md-nav__item">
-  <a href="#0172-2024-04-24" class="md-nav__link">
+  <a href="#0180-2024-05-28" class="md-nav__link">
     <span class="md-ellipsis">
-      0.17.2 - 2024-04-24
+      0.18.0 - 2024-05-28
     </span>
   </a>
   
-    <nav class="md-nav" aria-label="0.17.2 - 2024-04-24">
+    <nav class="md-nav" aria-label="0.18.0 - 2024-05-28">
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#changed" class="md-nav__link">
+  <a href="#added" class="md-nav__link">
     <span class="md-ellipsis">
-      Changed:
+      Added:
     </span>
   </a>
   
@@ -4740,17 +4745,50 @@
 </li>
       
         <li class="md-nav__item">
-  <a href="#0171-2024-04-23" class="md-nav__link">
+  <a href="#0172-2024-04-24" class="md-nav__link">
     <span class="md-ellipsis">
-      0.17.1 - 2024-04-23
+      0.17.2 - 2024-04-24
     </span>
   </a>
   
-    <nav class="md-nav" aria-label="0.17.1 - 2024-04-23">
+    <nav class="md-nav" aria-label="0.17.2 - 2024-04-24">
       <ul class="md-nav__list">
         
+          <li class="md-nav__item">
+  <a href="#changed" class="md-nav__link">
+    <span class="md-ellipsis">
+      Changed:
+    </span>
+  </a>
+  
+</li>
+        
           <li class="md-nav__item">
   <a href="#fixed_1" class="md-nav__link">
+    <span class="md-ellipsis">
+      Fixed:
+    </span>
+  </a>
+  
+</li>
+        
+      </ul>
+    </nav>
+  
+</li>
+      
+        <li class="md-nav__item">
+  <a href="#0171-2024-04-23" class="md-nav__link">
+    <span class="md-ellipsis">
+      0.17.1 - 2024-04-23
+    </span>
+  </a>
+  
+    <nav class="md-nav" aria-label="0.17.1 - 2024-04-23">
+      <ul class="md-nav__list">
+        
+          <li class="md-nav__item">
+  <a href="#fixed_2" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -4774,7 +4812,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added" class="md-nav__link">
+  <a href="#added_1" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -4792,7 +4830,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_2" class="md-nav__link">
+  <a href="#fixed_3" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -4816,7 +4854,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_3" class="md-nav__link">
+  <a href="#fixed_4" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -4840,7 +4878,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_1" class="md-nav__link">
+  <a href="#added_2" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -4858,7 +4896,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_4" class="md-nav__link">
+  <a href="#fixed_5" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -4882,7 +4920,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_2" class="md-nav__link">
+  <a href="#added_3" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -4915,7 +4953,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_5" class="md-nav__link">
+  <a href="#fixed_6" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -4939,7 +4977,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_3" class="md-nav__link">
+  <a href="#added_4" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -4957,7 +4995,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_6" class="md-nav__link">
+  <a href="#fixed_7" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -4981,7 +5019,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_4" class="md-nav__link">
+  <a href="#added_5" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -4999,7 +5037,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_7" class="md-nav__link">
+  <a href="#fixed_8" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -5023,7 +5061,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_5" class="md-nav__link">
+  <a href="#added_6" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -5089,7 +5127,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_8" class="md-nav__link">
+  <a href="#fixed_9" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -5113,7 +5151,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_6" class="md-nav__link">
+  <a href="#added_7" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -5137,7 +5175,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_7" class="md-nav__link">
+  <a href="#added_8" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -5161,7 +5199,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_8" class="md-nav__link">
+  <a href="#added_9" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -5179,7 +5217,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_9" class="md-nav__link">
+  <a href="#fixed_10" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -5203,7 +5241,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_9" class="md-nav__link">
+  <a href="#added_10" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -5245,7 +5283,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_10" class="md-nav__link">
+  <a href="#fixed_11" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -5278,7 +5316,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_11" class="md-nav__link">
+  <a href="#fixed_12" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -5302,7 +5340,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_10" class="md-nav__link">
+  <a href="#added_11" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -5383,7 +5421,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_11" class="md-nav__link">
+  <a href="#added_12" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -5407,7 +5445,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_12" class="md-nav__link">
+  <a href="#added_13" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -5431,7 +5469,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_13" class="md-nav__link">
+  <a href="#added_14" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -5455,7 +5493,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_14" class="md-nav__link">
+  <a href="#added_15" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -5479,7 +5517,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_15" class="md-nav__link">
+  <a href="#added_16" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -5503,7 +5541,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_16" class="md-nav__link">
+  <a href="#added_17" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -5527,7 +5565,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_17" class="md-nav__link">
+  <a href="#added_18" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -5551,7 +5589,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_18" class="md-nav__link">
+  <a href="#added_19" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -5584,7 +5622,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_19" class="md-nav__link">
+  <a href="#added_20" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -5593,7 +5631,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_12" class="md-nav__link">
+  <a href="#fixed_13" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -5617,7 +5655,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_20" class="md-nav__link">
+  <a href="#added_21" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -5689,7 +5727,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_13" class="md-nav__link">
+  <a href="#fixed_14" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -5722,7 +5760,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_14" class="md-nav__link">
+  <a href="#fixed_15" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -5746,7 +5784,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_21" class="md-nav__link">
+  <a href="#added_22" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -5764,7 +5802,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_15" class="md-nav__link">
+  <a href="#fixed_16" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -5788,7 +5826,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_22" class="md-nav__link">
+  <a href="#added_23" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -5821,7 +5859,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_16" class="md-nav__link">
+  <a href="#fixed_17" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -5845,7 +5883,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_23" class="md-nav__link">
+  <a href="#added_24" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -5869,7 +5907,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_24" class="md-nav__link">
+  <a href="#added_25" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -5893,7 +5931,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_25" class="md-nav__link">
+  <a href="#added_26" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -5902,7 +5940,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_17" class="md-nav__link">
+  <a href="#fixed_18" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -5926,7 +5964,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_26" class="md-nav__link">
+  <a href="#added_27" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -5944,7 +5982,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_18" class="md-nav__link">
+  <a href="#fixed_19" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -5977,7 +6015,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_19" class="md-nav__link">
+  <a href="#fixed_20" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -6001,7 +6039,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_27" class="md-nav__link">
+  <a href="#added_28" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -6049,7 +6087,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_28" class="md-nav__link">
+  <a href="#added_29" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -6067,7 +6105,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_20" class="md-nav__link">
+  <a href="#fixed_21" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -6091,7 +6129,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_29" class="md-nav__link">
+  <a href="#added_30" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -6172,7 +6210,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_21" class="md-nav__link">
+  <a href="#fixed_22" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -6196,7 +6234,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_30" class="md-nav__link">
+  <a href="#added_31" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -6214,7 +6252,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_22" class="md-nav__link">
+  <a href="#fixed_23" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -6238,7 +6276,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_23" class="md-nav__link">
+  <a href="#fixed_24" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -6262,7 +6300,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_31" class="md-nav__link">
+  <a href="#added_32" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -6286,7 +6324,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_32" class="md-nav__link">
+  <a href="#added_33" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -6310,7 +6348,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_33" class="md-nav__link">
+  <a href="#added_34" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -6334,7 +6372,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_34" class="md-nav__link">
+  <a href="#added_35" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -6358,7 +6396,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_24" class="md-nav__link">
+  <a href="#fixed_25" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -6382,7 +6420,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_35" class="md-nav__link">
+  <a href="#added_36" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -6406,7 +6444,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_25" class="md-nav__link">
+  <a href="#fixed_26" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -6454,7 +6492,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_36" class="md-nav__link">
+  <a href="#added_37" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -6478,7 +6516,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_37" class="md-nav__link">
+  <a href="#added_38" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -6502,7 +6540,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_26" class="md-nav__link">
+  <a href="#fixed_27" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -6526,7 +6564,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_38" class="md-nav__link">
+  <a href="#added_39" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -6544,7 +6582,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_27" class="md-nav__link">
+  <a href="#fixed_28" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -6616,7 +6654,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_39" class="md-nav__link">
+  <a href="#added_40" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -6625,7 +6663,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_28" class="md-nav__link">
+  <a href="#fixed_29" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -6649,7 +6687,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_40" class="md-nav__link">
+  <a href="#added_41" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -6658,7 +6696,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_29" class="md-nav__link">
+  <a href="#fixed_30" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -6682,7 +6720,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_41" class="md-nav__link">
+  <a href="#added_42" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -6691,7 +6729,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_30" class="md-nav__link">
+  <a href="#fixed_31" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -6715,7 +6753,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_42" class="md-nav__link">
+  <a href="#added_43" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -6724,7 +6762,7 @@
 </li>
         
           <li class="md-nav__item">
-  <a href="#fixed_31" class="md-nav__link">
+  <a href="#fixed_32" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -6748,7 +6786,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_32" class="md-nav__link">
+  <a href="#fixed_33" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -6772,7 +6810,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_43" class="md-nav__link">
+  <a href="#added_44" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -6796,7 +6834,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_44" class="md-nav__link">
+  <a href="#added_45" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -6829,7 +6867,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_45" class="md-nav__link">
+  <a href="#added_46" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -6886,7 +6924,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_33" class="md-nav__link">
+  <a href="#fixed_34" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -6910,7 +6948,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_46" class="md-nav__link">
+  <a href="#added_47" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -6934,7 +6972,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_34" class="md-nav__link">
+  <a href="#fixed_35" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -6958,7 +6996,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_35" class="md-nav__link">
+  <a href="#fixed_36" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -6982,7 +7020,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_47" class="md-nav__link">
+  <a href="#added_48" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -7006,7 +7044,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_48" class="md-nav__link">
+  <a href="#added_49" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -7039,7 +7077,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#fixed_36" class="md-nav__link">
+  <a href="#fixed_37" class="md-nav__link">
     <span class="md-ellipsis">
       Fixed
     </span>
@@ -7063,7 +7101,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_49" class="md-nav__link">
+  <a href="#added_50" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -7087,7 +7125,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_50" class="md-nav__link">
+  <a href="#added_51" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -7120,7 +7158,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_51" class="md-nav__link">
+  <a href="#added_52" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -7144,7 +7182,7 @@
       <ul class="md-nav__list">
         
           <li class="md-nav__item">
-  <a href="#added_52" class="md-nav__link">
+  <a href="#added_53" class="md-nav__link">
     <span class="md-ellipsis">
       Added
     </span>
@@ -7179,14 +7217,27 @@ <h1 id="changelog">🍂 Changelog</h1>
 <p>All notable changes to this project will be documented in this file.</p>
 <p>The format is based on <a href="https://keepachangelog.com/en/1.0.0/">Keep a Changelog</a>,
 and this project adheres to <a href="https://semver.org/spec/v2.0.0.html">Semantic Versioning</a>.</p>
-<h2 id="unreleased"><a href="https://github.com/kayjan/bigtree/compare/0.17.2...HEAD">Unreleased</a></h2>
+<h2 id="unreleased"><a href="https://github.com/kayjan/bigtree/compare/0.18.0...HEAD">Unreleased</a></h2>
+<h2 id="0180-2024-05-28"><a href="https://github.com/kayjan/bigtree/compare/0.17.2...0.18.0">0.18.0</a> - 2024-05-28</h2>
+<h3 id="added">Added:</h3>
+<ul>
+<li>Tree Constructor: Polars method <code>polars_to_tree</code>, <code>polars_to_tree_by_relation</code>, <code>add_polars_to_tree_by_path</code>,
+and <code>add_polars_to_tree_by_name</code>.</li>
+<li>Tree Exporter: Polars method <code>tree_to_polars</code>.</li>
+</ul>
+<h3 id="fixed">Fixed:</h3>
+<ul>
+<li>Misc: Documentation to update mkdocs-material version for social plugin.</li>
+<li>Misc: Update links in README.</li>
+<li>Misc: Fix mypy typing.</li>
+</ul>
 <h2 id="0172-2024-04-24"><a href="https://github.com/kayjan/bigtree/compare/0.17.1...0.17.2">0.17.2</a> - 2024-04-24</h2>
 <h3 id="changed">Changed:</h3>
 <ul>
 <li>DAG Constructor: <code>list_to_dag</code> and <code>dict_to_dag</code> does not rely on <code>dataframe_to_dag</code> as pandas dataframe operation
 is phased out.</li>
 </ul>
-<h3 id="fixed">Fixed:</h3>
+<h3 id="fixed_1">Fixed:</h3>
 <ul>
 <li>DAG Constructor: Handle cases where reserved keywords are part of attribute upon creation and throw error accordingly.</li>
 <li>[#224] Tree/DAG Constructor: Null checks to not interpret 0 as null, this affects <code>dataframe_to_tree_by_relation</code>,
@@ -7194,13 +7245,14 @@ <h3 id="fixed">Fixed:</h3>
 This will also affect showing/printing of trees when <code>attr_omit_null</code> is set to True.</li>
 </ul>
 <h2 id="0171-2024-04-23"><a href="https://github.com/kayjan/bigtree/compare/0.17.0...0.17.1">0.17.1</a> - 2024-04-23</h2>
-<h3 id="fixed_1">Fixed</h3>
+<h3 id="fixed_2">Fixed</h3>
 <ul>
 <li>[#222] Tree Constructor: <code>dataframe_to_tree_by_relation</code> duplicate root node name error message to handle
 different data types.</li>
+<li>Misc: Update links in README.</li>
 </ul>
 <h2 id="0170-2024-04-04"><a href="https://github.com/kayjan/bigtree/compare/0.16.4...0.17.0">0.17.0</a> - 2024-04-04</h2>
-<h3 id="added">Added</h3>
+<h3 id="added_1">Added</h3>
 <ul>
 <li>Misc: Group tests for benchmark timings to compare the timings by multiplier more effectively.</li>
 </ul>
@@ -7216,7 +7268,7 @@ <h3 id="changed_1">Changed</h3>
 <li>Misc: Abstract out logic for checking null and filtering attributes.</li>
 <li>Misc: Optimization in dictionary and dataframe operations.</li>
 </ul>
-<h3 id="fixed_2">Fixed</h3>
+<h3 id="fixed_3">Fixed</h3>
 <ul>
 <li>Tree Constructor: <code>dict_to_tree</code> no longer uses dataframe operations, leading to 33% improvement in timings for
 a tree with 10000 nodes, averaged across 10 runs. The resulting data type of node follows the dictionary exactly,
@@ -7234,12 +7286,12 @@ <h3 id="fixed_2">Fixed</h3>
 ignore null attribute columns.</li>
 </ul>
 <h2 id="0164-2024-03-14"><a href="https://github.com/kayjan/bigtree/compare/0.16.3...0.16.4">0.16.4</a> - 2024-03-14</h2>
-<h3 id="fixed_3">Fixed</h3>
+<h3 id="fixed_4">Fixed</h3>
 <ul>
 <li>[#216] Tree Exporter: Fix nan checker when printing trees.</li>
 </ul>
 <h2 id="0163-2024-03-14"><a href="https://github.com/kayjan/bigtree/compare/0.16.2...0.16.3">0.16.3</a> - 2024-03-14</h2>
-<h3 id="added_1">Added</h3>
+<h3 id="added_2">Added</h3>
 <ul>
 <li>BaseNode: Add diameter property.</li>
 <li>Misc: Testing to include benchmark timings for tree creation, compare benchmark tests across commits, reject pull request if benchmark tests fails.</li>
@@ -7250,13 +7302,13 @@ <h3 id="changed_2">Changed</h3>
 <li>Misc: Documentation to enable zooming in of images, add navigation section headers, remove some meta tags.</li>
 <li>Misc: Split up testing into multiple conftest files.</li>
 </ul>
-<h3 id="fixed_4">Fixed</h3>
+<h3 id="fixed_5">Fixed</h3>
 <ul>
 <li>Tree Constructor: Tree creation from dictionary adds None for empty attributes instead of np.nan.</li>
 <li>[#216] Tree Exporter: <code>attr_omit_null</code> to handle nan/null values in addition to checking for None.</li>
 </ul>
 <h2 id="0162-2024-02-06"><a href="https://github.com/kayjan/bigtree/compare/0.16.1...0.16.2">0.16.2</a> - 2024-02-06</h2>
-<h3 id="added_2">Added</h3>
+<h3 id="added_3">Added</h3>
 <ul>
 <li>Misc: Documentation plugin Termynal for code animation.</li>
 <li>Misc: Usage of <code>docstr-coverage</code>.</li>
@@ -7268,12 +7320,12 @@ <h3 id="changed_3">Changed</h3>
 <li>Misc: Documentation CSS for h1 display for windows compatibility, modify the related links on main page.</li>
 </ul>
 <h2 id="0161-2024-01-29"><a href="https://github.com/kayjan/bigtree/compare/0.16.0...0.16.1">0.16.1</a> - 2024-01-29</h2>
-<h3 id="fixed_5">Fixed</h3>
+<h3 id="fixed_6">Fixed</h3>
 <ul>
 <li>Misc: Compatibility of mkdocs with readthedocs.</li>
 </ul>
 <h2 id="0160-2024-01-28"><a href="https://github.com/kayjan/bigtree/compare/0.15.7...0.16.0">0.16.0</a> - 2024-01-28</h2>
-<h3 id="added_3">Added</h3>
+<h3 id="added_4">Added</h3>
 <ul>
 <li>Misc: Documentation using mkdocs.</li>
 </ul>
@@ -7282,12 +7334,12 @@ <h3 id="changed_4">Changed</h3>
 <li>Misc: Markdown edit for README, CHANGELOG.</li>
 <li>Misc: Docstring to indicate Examples, to indicate exceptions for BaseNode and DAGNode, simplify code for tree modification.</li>
 </ul>
-<h3 id="fixed_6">Fixed</h3>
+<h3 id="fixed_7">Fixed</h3>
 <ul>
 <li>Misc: Docstring bullet point alignment, images compatibility with markdown.</li>
 </ul>
 <h2 id="0157-2024-01-26"><a href="https://github.com/kayjan/bigtree/compare/0.15.6...0.15.7">0.15.7</a> - 2024-01-26</h2>
-<h3 id="added_4">Added</h3>
+<h3 id="added_5">Added</h3>
 <ul>
 <li>Misc: Sphinx documentation to support mermaid markdown images, reflect CHANGELOG section, add more emojis.</li>
 </ul>
@@ -7297,12 +7349,12 @@ <h3 id="changed_5">Changed</h3>
 <li>Misc: Fix Sphinx documentation font size difference between web and mobile, include last updated date.</li>
 <li>Misc: Upgrade package versions in pre-commit hook.</li>
 </ul>
-<h3 id="fixed_7">Fixed</h3>
+<h3 id="fixed_8">Fixed</h3>
 <ul>
 <li>Tree Exporter: <code>hprint_tree</code> and <code>hyield_tree</code> to be compatible with <code>BinaryNode</code> where child nodes can be None type.</li>
 </ul>
 <h2 id="0156-2024-01-20"><a href="https://github.com/kayjan/bigtree/compare/0.15.5...0.15.6">0.15.6</a> - 2024-01-20</h2>
-<h3 id="added_5">Added</h3>
+<h3 id="added_6">Added</h3>
 <ul>
 <li>DAGNode: Able to access and delete node children via name with square bracket accessor with <code>__getitem__</code> and <code>__delitem__</code> magic methods.</li>
 <li>DAGNode: Able to delete all children for a node.</li>
@@ -7328,24 +7380,24 @@ <h3 id="changed_8">Changed</h3>
 <ul>
 <li>Tree Exporter: <code>hprint_tree</code> and <code>hyield_tree</code> to allow hiding names of intermediate node.</li>
 </ul>
-<h3 id="fixed_8">Fixed</h3>
+<h3 id="fixed_9">Fixed</h3>
 <ul>
 <li>Tree Constructor: <code>newick_to_tree</code> to handle invalid closing and use of apostrophe.</li>
 <li>Tree Exporter: <code>tree_to_newick</code> to handle special characters by wrapping them in apostrophe.</li>
 </ul>
 <h2 id="0153-2024-01-08"><a href="https://github.com/kayjan/bigtree/compare/0.15.2...0.15.3">0.15.3</a> - 2024-01-08</h2>
-<h3 id="added_6">Added</h3>
+<h3 id="added_7">Added</h3>
 <ul>
 <li>Tree Helper: <code>get_subtree</code> method to retrieve subtree.</li>
 </ul>
 <h2 id="0152-2024-01-08"><a href="https://github.com/kayjan/bigtree/compare/0.15.1...0.15.2">0.15.2</a> - 2024-01-08</h2>
-<h3 id="added_7">Added</h3>
+<h3 id="added_8">Added</h3>
 <ul>
 <li>Tree Exporter: <code>hprint_tree</code> and <code>hyield_tree</code> to print and retrieve results for tree in horizontal orientation.</li>
 <li>Node: Added <code>hshow</code> method to print tree in horizontal orientation to console.</li>
 </ul>
 <h2 id="0151-2024-01-05"><a href="https://github.com/kayjan/bigtree/compare/0.15.0...0.15.1">0.15.1</a> - 2024-01-05</h2>
-<h3 id="added_8">Added</h3>
+<h3 id="added_9">Added</h3>
 <ul>
 <li>Tree Constructor: <code>newick_to_tree</code> to convert Newick notation to tree.</li>
 </ul>
@@ -7353,12 +7405,12 @@ <h3 id="changed_9">Changed</h3>
 <ul>
 <li>Tree Exporter: <code>tree_to_newick</code> to accept more parameters to parse length and attributes.</li>
 </ul>
-<h3 id="fixed_9">Fixed</h3>
+<h3 id="fixed_10">Fixed</h3>
 <ul>
 <li>Misc: Automated doctest setup to use os operations instead of string operations.</li>
 </ul>
 <h2 id="0150-2024-01-02"><a href="https://github.com/kayjan/bigtree/compare/0.14.8...0.15.0">0.15.0</a> - 2024-01-02</h2>
-<h3 id="added_9">Added</h3>
+<h3 id="added_10">Added</h3>
 <ul>
 <li>Tree Exporter: Export to Newick notation with <code>tree_to_newick</code>.</li>
 </ul>
@@ -7375,7 +7427,7 @@ <h3 id="changed_11">Changed</h3>
 <li>Misc: Organize assets folder based on whether it originated from README, docstrings, or sphinx documentation.</li>
 <li>Misc: Rename functions in <code>plot.py</code> utils file for coverage report.</li>
 </ul>
-<h3 id="fixed_10">Fixed</h3>
+<h3 id="fixed_11">Fixed</h3>
 <ul>
 <li>Misc: Fixed doctests and automate doctest checks.</li>
 </ul>
@@ -7384,12 +7436,12 @@ <h3 id="changed_12">Changed</h3>
 <ul>
 <li>Tree Helper: <code>get_tree_diff</code> enhanced to compare tree attributes by taking in <code>attr_list</code> parameter, and indicates difference with <code>(~)</code>.</li>
 </ul>
-<h3 id="fixed_11">Fixed</h3>
+<h3 id="fixed_12">Fixed</h3>
 <ul>
 <li>Tree Helper: <code>get_tree_diff</code> compare tree structure by considering all nodes (previously only consider leaf nodes).</li>
 </ul>
 <h2 id="0146-2023-12-14"><a href="https://github.com/kayjan/bigtree/compare/0.14.5...0.14.6">0.14.6</a> - 2023-12-14</h2>
-<h3 id="added_10">Added</h3>
+<h3 id="added_11">Added</h3>
 <ul>
 <li>Node: Able to access and delete node children via name with square bracket accessor with <code>__getitem__</code> and <code>__delitem__</code> magic methods.</li>
 <li>BaseNode/Node/BinaryNode: Able to add one or more children with <code>append</code> and <code>extend</code> methods.</li>
@@ -7416,24 +7468,24 @@ <h3 id="changed_15">Changed</h3>
 <li>Misc: Clean up github actions.</li>
 </ul>
 <h2 id="0143-2023-10-31"><a href="https://github.com/kayjan/bigtree/compare/0.14.2...0.14.3">0.14.3</a> - 2023-10-31</h2>
-<h3 id="added_11">Added</h3>
+<h3 id="added_12">Added</h3>
 <ul>
 <li>Misc: Publish to conda, enable automated publishing to conda-forge in addition to existing PyPI.</li>
 <li>Misc: Tree demonstration code for <code>shift_and_replace_nodes</code> and <code>copy_and_replace_nodes_from_tree_to_tree</code> in README.</li>
 </ul>
 <h2 id="0142-2023-10-21"><a href="https://github.com/kayjan/bigtree/compare/0.14.1...0.14.2">0.14.2</a> - 2023-10-21</h2>
-<h3 id="added_12">Added</h3>
+<h3 id="added_13">Added</h3>
 <ul>
 <li>Misc: RTD integration.</li>
 <li>Misc: Enable manual publishing of python package.</li>
 </ul>
 <h2 id="0141-2023-10-18"><a href="https://github.com/kayjan/bigtree/compare/0.14.0...0.14.1">0.14.1</a> - 2023-10-18</h2>
-<h3 id="added_13">Added</h3>
+<h3 id="added_14">Added</h3>
 <ul>
 <li>Misc: Changes to main branch checks if the latest version exists (using git tag) before publishing package and building documentation.</li>
 </ul>
 <h2 id="0140-2023-10-18"><a href="https://github.com/kayjan/bigtree/compare/0.13.3...0.14.0">0.14.0</a> - 2023-10-18</h2>
-<h3 id="added_14">Added</h3>
+<h3 id="added_15">Added</h3>
 <ul>
 <li>Tree Modifier: Shift nodes with replacement of to-node with <code>shift_and_replace_nodes</code>.</li>
 <li>Tree Modifier: Copy nodes from tree to tree with replacement of to-node with <code>copy_and_replace_nodes_from_tree_to_tree</code>.</li>
@@ -7441,23 +7493,23 @@ <h3 id="added_14">Added</h3>
 <li>Tree Modifier: Add relevant test cases and documentations accordingly.</li>
 </ul>
 <h2 id="0133-2023-10-17"><a href="https://github.com/kayjan/bigtree/compare/0.13.2...0.13.3">0.13.3</a> - 2023-10-17</h2>
-<h3 id="added_15">Added</h3>
+<h3 id="added_16">Added</h3>
 <ul>
 <li>Misc: Add automatic release notes with content into GitHub workflow.</li>
 </ul>
 <h2 id="0132-2023-10-17"><a href="https://github.com/kayjan/bigtree/compare/0.13.1...0.13.2">0.13.2</a> - 2023-10-17</h2>
-<h3 id="added_16">Added</h3>
+<h3 id="added_17">Added</h3>
 <ul>
 <li>Misc: Add automatic release notes into GitHub workflow.</li>
 </ul>
 <h2 id="0131-2023-10-15"><a href="https://github.com/kayjan/bigtree/compare/0.13.0...0.13.1">0.13.1</a> - 2023-10-15</h2>
-<h3 id="added_17">Added</h3>
+<h3 id="added_18">Added</h3>
 <ul>
 <li>Misc: Add automatic comment on code coverage to pull requests into GitHub workflow.</li>
 <li>Misc: Add more checks into pre-commit.</li>
 </ul>
 <h2 id="0130-2023-09-29"><a href="https://github.com/kayjan/bigtree/compare/0.12.5...0.13.0">0.13.0</a> - 2023-09-29</h2>
-<h3 id="added_18">Added</h3>
+<h3 id="added_19">Added</h3>
 <ul>
 <li>Tree Exporter: Export tree to flowchart diagram in mermaid markdown format using <code>tree_to_mermaid</code>.</li>
 </ul>
@@ -7468,16 +7520,16 @@ <h3 id="changed_16">Changed</h3>
 <li>Misc: Fix docstring for better presentation of code vs variable vs normal text.</li>
 </ul>
 <h2 id="0125-2023-09-26"><a href="https://github.com/kayjan/bigtree/compare/0.12.4...0.12.5">0.12.5</a> - 2023-09-26</h2>
-<h3 id="added_19">Added</h3>
+<h3 id="added_20">Added</h3>
 <ul>
 <li>Utility Groot: Add test cases.</li>
 </ul>
-<h3 id="fixed_12">Fixed</h3>
+<h3 id="fixed_13">Fixed</h3>
 <ul>
 <li>Tree Exporter: <code>tree_to_pillow</code> function to reference online font file instead of relative path.</li>
 </ul>
 <h2 id="0124-2023-09-25"><a href="https://github.com/kayjan/bigtree/compare/0.12.3...0.12.4">0.12.4</a> - 2023-09-25</h2>
-<h3 id="added_20">Added</h3>
+<h3 id="added_21">Added</h3>
 <ul>
 <li>Utility Groot: Add groot utility functions.</li>
 </ul>
@@ -7493,7 +7545,7 @@ <h3 id="changed_18">Changed</h3>
 <li>Tree Plot: Reingold Tilford Algorithm code for succinctness and docstring.</li>
 </ul>
 <h2 id="0121-2023-09-11"><a href="https://github.com/kayjan/bigtree/compare/0.12.0...0.12.1">0.12.1</a> - 2023-09-11</h2>
-<h3 id="fixed_13">Fixed</h3>
+<h3 id="fixed_14">Fixed</h3>
 <ul>
 <li>Tree Plot: Reingold Tilford Algorithm to handle cases of negative x-coordinates with adjustment parameter.</li>
 </ul>
@@ -7502,13 +7554,13 @@ <h3 id="changed_19">Changed</h3>
 <ul>
 <li>Tree/DAG Constructor, Tree/DAG Exporter: Make <code>pandas</code> optional dependency.</li>
 </ul>
-<h3 id="fixed_14">Fixed</h3>
+<h3 id="fixed_15">Fixed</h3>
 <ul>
 <li>Misc: Fixed Calendar workflow to throw error when <code>to_dataframe</code> method is called on empty calendar.</li>
 <li>Tree/DAGNode Exporter, Tree Helper, Tree Search: Relax type hinting using TypeVar.</li>
 </ul>
 <h2 id="0110-2023-09-08"><a href="https://github.com/kayjan/bigtree/compare/0.10.3...0.11.0">0.11.0</a> - 2023-09-08</h2>
-<h3 id="added_21">Added</h3>
+<h3 id="added_22">Added</h3>
 <ul>
 <li>Tree Helper: Pruning tree to allow pruning by <code>prune_path</code> and <code>max_depth</code>.</li>
 <li>Tree Plot: Implement Enhanced Reingold Tilford Algorithm to retrieve (x, y) coordinates for a tree structure.</li>
@@ -7517,12 +7569,12 @@ <h3 id="changed_20">Changed</h3>
 <ul>
 <li>BaseNode/DAGNode: <code>get_attr</code> method to allow default return value.</li>
 </ul>
-<h3 id="fixed_15">Fixed</h3>
+<h3 id="fixed_16">Fixed</h3>
 <ul>
 <li>Utility Iterator: Relax type hinting using TypeVar.</li>
 </ul>
 <h2 id="0103-2023-08-12"><a href="https://github.com/kayjan/bigtree/compare/0.10.2...0.10.3">0.10.3</a> - 2023-08-12</h2>
-<h3 id="added_22">Added</h3>
+<h3 id="added_23">Added</h3>
 <ul>
 <li>Tree Constructor: <code>add_path_to_tree</code>, <code>dataframe_to_tree</code>, <code>dataframe_to_tree_by_relation</code> to allow custom node types that takes in constructor arguments.</li>
 </ul>
@@ -7531,33 +7583,33 @@ <h3 id="changed_21">Changed</h3>
 <li>Binary Tree: Able to accept node val of <code>str</code> type besides <code>int</code> type.</li>
 </ul>
 <h2 id="0102-2023-08-11"><a href="https://github.com/kayjan/bigtree/compare/0.10.1...0.10.2">0.10.2</a> - 2023-08-11</h2>
-<h3 id="fixed_16">Fixed</h3>
+<h3 id="fixed_17">Fixed</h3>
 <ul>
 <li>Tree Constructor: <code>nested_dict_to_tree</code> to throw TypeError if child_key is not list type.</li>
 </ul>
 <h2 id="0101-2023-07-27"><a href="https://github.com/kayjan/bigtree/compare/0.10.0...0.10.1">0.10.1</a> - 2023-07-27</h2>
-<h3 id="added_23">Added</h3>
+<h3 id="added_24">Added</h3>
 <ul>
 <li>[#71] Node: <code>path_name</code> to allow different node name of different dtypes; map everything to string type.</li>
 </ul>
 <h2 id="0100-2023-07-15"><a href="https://github.com/kayjan/bigtree/compare/0.9.5...0.10.0">0.10.0</a> - 2023-07-15</h2>
-<h3 id="added_24">Added</h3>
+<h3 id="added_25">Added</h3>
 <ul>
 <li>[#65] Tree Search: Implement <code>find_relative_path</code> to find relative path from node.</li>
 <li>[#65] Utility Iterator: Implement <code>zigzag_iter</code> and <code>zigzaggroup_iter</code> Tree traversal methods.</li>
 </ul>
 <h2 id="095-2023-07-13"><a href="https://github.com/kayjan/bigtree/compare/0.9.4...0.9.5">0.9.5</a> - 2023-07-13</h2>
-<h3 id="added_25">Added</h3>
+<h3 id="added_26">Added</h3>
 <ul>
 <li>Misc: Added init files, add link to discussions to README and pyproject, add sphinx coverage shortcuts.</li>
 </ul>
-<h3 id="fixed_17">Fixed</h3>
+<h3 id="fixed_18">Fixed</h3>
 <ul>
 <li>[#66] DAGNode/Node: Children constructor to allow Iterable types, fixed issue of lists being mutable.</li>
 <li>[#67] Node: <code>path_name</code> to reduce number of recursive calls to root node for <code>sep</code>.</li>
 </ul>
 <h2 id="094-2023-06-18"><a href="https://github.com/kayjan/bigtree/compare/0.9.3...0.9.4">0.9.4</a> - 2023-06-18</h2>
-<h3 id="added_26">Added</h3>
+<h3 id="added_27">Added</h3>
 <ul>
 <li>Tree Constructor: <code>list_to_tree_by_relation</code> and <code>dataframe_to_tree_by_relation</code> method to allow duplicate intermediate nodes (default is false).</li>
 <li>DAG Exporter: Added <code>node_shape</code> parameter in <code>dag_to_dot</code> export function for easier way to customize node shape.</li>
@@ -7570,7 +7622,7 @@ <h3 id="changed_22">Changed</h3>
 <li>Tree Constructor: <code>add_dict_to_tree_by_name</code> method rename argument from <code>path_attrs</code> to <code>name_attrs</code>.</li>
 <li>Misc: Modified contributing instructions.</li>
 </ul>
-<h3 id="fixed_18">Fixed</h3>
+<h3 id="fixed_19">Fixed</h3>
 <ul>
 <li>Tree Exporter: <code>tree_to_dot</code> to handle cases when not all nodes have <code>edge_attr</code>.</li>
 <li>DAG Exporter: <code>dag_to_dot</code> to perform dictionary copy to prevent style from being overridden for child nodes.</li>
@@ -7581,12 +7633,12 @@ <h3 id="changed_23">Changed</h3>
 <ul>
 <li>Tree Constructor: Relax type hint to <code>Iterable</code> instead of <code>List</code> for <code>list_to_tree</code> and <code>list_to_tree_by_relation</code> methods.</li>
 </ul>
-<h3 id="fixed_19">Fixed</h3>
+<h3 id="fixed_20">Fixed</h3>
 <ul>
 <li>Node: Fix error message when trees have different <code>sep</code>.</li>
 </ul>
 <h2 id="092-2023-04-09"><a href="https://github.com/kayjan/bigtree/compare/0.9.1...0.9.2">0.9.2</a> - 2023-04-09</h2>
-<h3 id="added_27">Added</h3>
+<h3 id="added_28">Added</h3>
 <ul>
 <li>Node: Added <code>show</code> method to print tree to console.</li>
 <li>Workflow Calendar: Tree use case with calendar implementation.</li>
@@ -7597,7 +7649,7 @@ <h3 id="changed_24">Changed</h3>
 <li>Node: Added <code>sep</code> parameter to constructor instead of using getter and setter methods to set <code>sep</code>.</li>
 </ul>
 <h2 id="090-2023-03-29"><a href="https://github.com/kayjan/bigtree/compare/0.8.4...0.9.0">0.9.0</a> - 2023-03-29</h2>
-<h3 id="added_28">Added</h3>
+<h3 id="added_29">Added</h3>
 <ul>
 <li>Tree Modifier: Ability to copy/shift nodes with full path in <code>from_paths</code> for faster search performance, added <code>with_full_path</code> parameter.</li>
 </ul>
@@ -7608,12 +7660,12 @@ <h3 id="changed_25">Changed</h3>
 <li>Tree Modifier: Better handling of <code>sep</code> in paths by performing string replacement at the start.</li>
 <li>Tree Modifier: Check and throw error for invalid parameters, case when node is meant to be deleted but <code>copy=True</code>.</li>
 </ul>
-<h3 id="fixed_20">Fixed</h3>
+<h3 id="fixed_21">Fixed</h3>
 <ul>
 <li>Tree Modifier: Fix issue trailing <code>sep</code> differing in <code>from_paths</code> and <code>to_paths</code> which should not throw error.</li>
 </ul>
 <h2 id="084-2023-03-24"><a href="https://github.com/kayjan/bigtree/compare/0.8.3...0.8.4">0.8.4</a> - 2023-03-24</h2>
-<h3 id="added_29">Added</h3>
+<h3 id="added_30">Added</h3>
 <ul>
 <li>Tree Search: Implement <code>find_child</code> and <code>find_children</code> to find single child or multiple children based on user-defined condition.</li>
 </ul>
@@ -7637,12 +7689,12 @@ <h3 id="changed_28">Changed</h3>
 <li>Misc: Shift .flake8, .mypy.ini, and pytest.ini files to pyproject.toml.</li>
 </ul>
 <h2 id="081-2023-03-10"><a href="https://github.com/kayjan/bigtree/compare/0.8.0...0.8.1">0.8.1</a> - 2023-03-10</h2>
-<h3 id="fixed_21">Fixed</h3>
+<h3 id="fixed_22">Fixed</h3>
 <ul>
 <li>Tree Modifier: Fix issue of <code>sep</code> of tree differing from the <code>sep</code> in <code>from_paths</code> and <code>to_paths</code>.</li>
 </ul>
 <h2 id="080-2023-03-10"><a href="https://github.com/kayjan/bigtree/compare/0.7.4...0.8.0">0.8.0</a> - 2023-03-10</h2>
-<h3 id="added_30">Added</h3>
+<h3 id="added_31">Added</h3>
 <ul>
 <li>Misc: Type checking with <code>mypy</code>, added type checks to pre-commit hooks.</li>
 </ul>
@@ -7650,51 +7702,51 @@ <h3 id="changed_29">Changed</h3>
 <ul>
 <li>DAGNode: <code>go_to</code> method to be consistent with <code>List[List[DAGNode]]</code> type.</li>
 </ul>
-<h3 id="fixed_22">Fixed</h3>
+<h3 id="fixed_23">Fixed</h3>
 <ul>
 <li>Tree Exporter: Exception handling in <code>yield_tree</code> if <code>node_name_or_path</code> is not found.</li>
 <li>Workflow: Exception handling in prioritizing item/list if item/list is not the correct tree depth.</li>
 <li>Workflow: Exception handling in removing item/list if item/list is not found.</li>
 </ul>
 <h2 id="074-2023-02-27"><a href="https://github.com/kayjan/bigtree/compare/0.7.3...0.7.4">0.7.4</a> - 2023-02-27</h2>
-<h3 id="fixed_23">Fixed</h3>
+<h3 id="fixed_24">Fixed</h3>
 <ul>
 <li>Tree Constructor: Fixed pandas SettingwithCopyWarning when performing dataframe operations.</li>
 </ul>
 <h2 id="073-2023-02-25"><a href="https://github.com/kayjan/bigtree/compare/0.7.2...0.7.3">0.7.3</a> - 2023-02-25</h2>
-<h3 id="added_31">Added</h3>
+<h3 id="added_32">Added</h3>
 <ul>
 <li>Tree Exporter: Fixed <code>print_tree</code> checking attributes with <code>hasattr</code> to handle cases of null or 0 value attributes, add more test cases.</li>
 <li>Misc: Added more description to Contributing.</li>
 </ul>
 <h2 id="072-2023-02-18"><a href="https://github.com/kayjan/bigtree/compare/0.7.1...0.7.2">0.7.2</a> - 2023-02-18</h2>
-<h3 id="added_32">Added</h3>
+<h3 id="added_33">Added</h3>
 <ul>
 <li>Tree Exporter: Added <code>node_shape</code> parameter in <code>tree_to_dot</code> export function for easier way to customize node shape.</li>
 </ul>
 <h2 id="071-2023-02-18"><a href="https://github.com/kayjan/bigtree/compare/0.7.0...0.7.1">0.7.1</a> - 2023-02-18</h2>
-<h3 id="added_33">Added</h3>
+<h3 id="added_34">Added</h3>
 <ul>
 <li>BaseNode/Node: Added <code>go_to</code> BaseNode method to travel from one node to another node from the same tree.</li>
 <li>DAGNode: Added <code>go_to</code> DAGNode method to travel from one node to another node from the same DAG.</li>
 </ul>
 <h2 id="070-2023-02-18"><a href="https://github.com/kayjan/bigtree/compare/0.6.10...0.7.0">0.7.0</a> - 2023-02-18</h2>
-<h3 id="added_34">Added</h3>
+<h3 id="added_35">Added</h3>
 <ul>
 <li>Tree Modifier: Accept <code>merge_leaves</code> type of modification, enhance documentation to provide more examples and illustrations.</li>
 </ul>
 <h2 id="0610-2023-01-23"><a href="https://github.com/kayjan/bigtree/compare/0.6.9...0.6.10">0.6.10</a> - 2023-01-23</h2>
-<h3 id="fixed_24">Fixed</h3>
+<h3 id="fixed_25">Fixed</h3>
 <ul>
 <li>Tree Constructor: <code>str_to_tree</code> accept prefixes to support unicode characters in node names.</li>
 </ul>
 <h2 id="069-2023-01-22"><a href="https://github.com/kayjan/bigtree/compare/0.6.8...0.6.9">0.6.9</a> - 2023-01-22</h2>
-<h3 id="added_35">Added</h3>
+<h3 id="added_36">Added</h3>
 <ul>
 <li>Tree Construct: <code>str_to_tree</code> to construct tree from tree string.</li>
 </ul>
 <h2 id="068-2023-01-14"><a href="https://github.com/kayjan/bigtree/compare/0.6.7...0.6.8">0.6.8</a> - 2023-01-14</h2>
-<h3 id="fixed_25">Fixed</h3>
+<h3 id="fixed_26">Fixed</h3>
 <ul>
 <li>Tree Exporter: <code>tree_to_dot</code> to perform dictionary copy to prevent style from being overridden for child nodes.</li>
 </ul>
@@ -7704,22 +7756,22 @@ <h3 id="changed_30">Changed</h3>
 <li>Binary Tree: Changed <code>BNode</code> to <code>BinaryNode</code>, and construct method <code>list_to_btree</code> to <code>list_to_binarytree</code>.</li>
 </ul>
 <h2 id="066-2022-12-15"><a href="https://github.com/kayjan/bigtree/compare/0.6.5...0.6.6">0.6.6</a> - 2022-12-15</h2>
-<h3 id="added_36">Added</h3>
+<h3 id="added_37">Added</h3>
 <ul>
 <li>Tree Exporter: Export <code>print_tree</code> output to image using Pillow package.</li>
 </ul>
 <h2 id="065-2022-12-07"><a href="https://github.com/kayjan/bigtree/compare/0.6.4...0.6.5">0.6.5</a> - 2022-12-07</h2>
-<h3 id="added_37">Added</h3>
+<h3 id="added_38">Added</h3>
 <ul>
 <li>Tree Modifier: Shift/copy nodes able to shift node-only and delete the children (backwards-compatible).</li>
 </ul>
 <h2 id="064-2022-11-16"><a href="https://github.com/kayjan/bigtree/compare/0.6.3...0.6.4">0.6.4</a> - 2022-11-16</h2>
-<h3 id="fixed_26">Fixed</h3>
+<h3 id="fixed_27">Fixed</h3>
 <ul>
 <li>BNode: Minor fix on rollback functionality when original children includes None.</li>
 </ul>
 <h2 id="063-2022-11-15"><a href="https://github.com/kayjan/bigtree/compare/0.6.2...0.6.3">0.6.3</a> - 2022-11-15</h2>
-<h3 id="added_38">Added</h3>
+<h3 id="added_39">Added</h3>
 <ul>
 <li>DAGNode: Rollback functionality to original state when there is error setting parent and children (backwards-compatible).</li>
 </ul>
@@ -7727,7 +7779,7 @@ <h3 id="changed_31">Changed</h3>
 <ul>
 <li>BaseNode, BNode, DAGNode: Refactor by abstracting checks.</li>
 </ul>
-<h3 id="fixed_27">Fixed</h3>
+<h3 id="fixed_28">Fixed</h3>
 <ul>
 <li>BaseNode: Fix rollback logic to handle failure in pre-assign checks and reassigning same child / parent.</li>
 <li>BNode: Fix issue of reassigning children shifting existing child from right to left.</li>
@@ -7743,7 +7795,7 @@ <h3 id="changed_33">Changed</h3>
 <li>Tree Modifier: Handle shifting/copying that removes intermediate layer (backwards-compatible).</li>
 </ul>
 <h2 id="060-2022-11-13"><a href="https://github.com/kayjan/bigtree/compare/0.5.5...0.6.0">0.6.0</a> - 2022-11-13</h2>
-<h3 id="added_39">Added</h3>
+<h3 id="added_40">Added</h3>
 <ul>
 <li>BaseNode: Rollback functionality to original state when there is error setting parent and children (backwards-compatible).</li>
 <li>BaseNode and DAGNode: Type hints.</li>
@@ -7752,54 +7804,54 @@ <h3 id="added_39">Added</h3>
 <li>BNode Iterator: Level-Order Iterator.</li>
 <li>Misc: Add Tips and Tricks to documentation (List Directory).</li>
 </ul>
-<h3 id="fixed_28">Fixed</h3>
+<h3 id="fixed_29">Fixed</h3>
 <ul>
 <li>DAGNode: Fix issue of duplicate parent constructor creating duplicate children.</li>
 </ul>
 <h2 id="055-2022-11-12"><a href="https://github.com/kayjan/bigtree/compare/0.5.4...0.5.5">0.5.5</a> - 2022-11-12</h2>
-<h3 id="added_40">Added</h3>
+<h3 id="added_41">Added</h3>
 <ul>
 <li>Misc: More docstring examples.</li>
 <li>Misc: More test cases.</li>
 </ul>
-<h3 id="fixed_29">Fixed</h3>
+<h3 id="fixed_30">Fixed</h3>
 <ul>
 <li>Tree Modifier: Fix issue with <code>merge_children</code> argument not working as expected.</li>
 </ul>
 <h2 id="054-2022-11-12"><a href="https://github.com/kayjan/bigtree/compare/0.5.3...0.5.4">0.5.4</a> - 2022-11-12</h2>
-<h3 id="added_41">Added</h3>
+<h3 id="added_42">Added</h3>
 <ul>
 <li>BaseNode: Add sort() to sort children.</li>
 <li>Node: Made more extendable with pre-/post-assign checks.</li>
 <li>Misc: Add Tips and Tricks to documentation (Extending Nodes).</li>
 <li>Misc: More test cases.</li>
 </ul>
-<h3 id="fixed_30">Fixed</h3>
+<h3 id="fixed_31">Fixed</h3>
 <ul>
 <li>Tree Search: Type hints.</li>
 </ul>
 <h2 id="053-2022-11-11"><a href="https://github.com/kayjan/bigtree/compare/0.5.2...0.5.3">0.5.3</a> - 2022-11-11</h2>
-<h3 id="added_42">Added</h3>
+<h3 id="added_43">Added</h3>
 <ul>
 <li>DAG and Tree Exporter: More customizations allowed on edges.</li>
 <li>Add Tips and Tricks to documentation (Weighted Trees, Merging Trees).</li>
 </ul>
-<h3 id="fixed_31">Fixed</h3>
+<h3 id="fixed_32">Fixed</h3>
 <ul>
 <li>Tree Modifier: Fix issue with <code>merge_children</code> argument not working as expected.</li>
 </ul>
 <h2 id="052-2022-11-10"><a href="https://github.com/kayjan/bigtree/compare/0.5.1...0.5.2">0.5.2</a> - 2022-11-10</h2>
-<h3 id="fixed_32">Fixed</h3>
+<h3 id="fixed_33">Fixed</h3>
 <ul>
 <li>Tree Constructor: Fix issue <code>dataframe_to_tree_by_relation</code> unable to find parent node.</li>
 </ul>
 <h2 id="051-2022-11-09"><a href="https://github.com/kayjan/bigtree/compare/0.5.0...0.5.1">0.5.1</a> - 2022-11-09</h2>
-<h3 id="added_43">Added</h3>
+<h3 id="added_44">Added</h3>
 <ul>
 <li>Misc: Clean codes and documentation.</li>
 </ul>
 <h2 id="050-2022-11-09"><a href="https://github.com/kayjan/bigtree/compare/0.4.6...0.5.0">0.5.0</a> - 2022-11-09</h2>
-<h3 id="added_44">Added</h3>
+<h3 id="added_45">Added</h3>
 <ul>
 <li>Misc: Clean codes and documentation.</li>
 </ul>
@@ -7809,7 +7861,7 @@ <h3 id="changed_34">Changed</h3>
 <li>DAG and Tree Exporter: Export to dot able to plot multiple disjointed trees/dags, rename <code>bgcolor</code> to <code>bg_colour</code>.</li>
 </ul>
 <h2 id="046-2022-11-09"><a href="https://github.com/kayjan/bigtree/compare/0.4.5...0.4.6">0.4.6</a> - 2022-11-09</h2>
-<h3 id="added_45">Added</h3>
+<h3 id="added_46">Added</h3>
 <ul>
 <li>Tree Constructor: From DataFrame of parent-child columns.</li>
 </ul>
@@ -7825,32 +7877,32 @@ <h3 id="changed_36">Changed</h3>
 <li>Tree Exporter: Printing tree with added ability to omit null attributes.</li>
 </ul>
 <h2 id="044-2022-11-08"><a href="https://github.com/kayjan/bigtree/compare/0.4.3...0.4.4">0.4.4</a> - 2022-11-08</h2>
-<h3 id="fixed_33">Fixed</h3>
+<h3 id="fixed_34">Fixed</h3>
 <ul>
 <li>Tree Constructor: Handle adding attributes that are array-like - add array even when one of the items is null.</li>
 </ul>
 <h2 id="043-2022-11-08"><a href="https://github.com/kayjan/bigtree/compare/0.4.2...0.4.3">0.4.3</a> - 2022-11-08</h2>
-<h3 id="added_46">Added</h3>
+<h3 id="added_47">Added</h3>
 <ul>
 <li>Node: Print format for BaseNode.</li>
 </ul>
 <h2 id="042-2022-11-08"><a href="https://github.com/kayjan/bigtree/compare/0.4.1...0.4.2">0.4.2</a> - 2022-11-08</h2>
-<h3 id="fixed_34">Fixed</h3>
+<h3 id="fixed_35">Fixed</h3>
 <ul>
 <li>Tree Constructor: For list of tuples, handle cases where parent name is None.</li>
 </ul>
 <h2 id="041-2022-11-07"><a href="https://github.com/kayjan/bigtree/compare/0.4.0...0.4.1">0.4.1</a> - 2022-11-07</h2>
-<h3 id="fixed_35">Fixed</h3>
+<h3 id="fixed_36">Fixed</h3>
 <ul>
 <li>Tree Constructor: Handle adding attributes that are array-like - error in drop_duplicate() and pd.isnull().</li>
 </ul>
 <h2 id="040-2022-11-07"><a href="https://github.com/kayjan/bigtree/compare/0.3.3...0.4.0">0.4.0</a> - 2022-11-07</h2>
-<h3 id="added_47">Added</h3>
+<h3 id="added_48">Added</h3>
 <ul>
 <li>Tree Constructor: From list of tuples of parent-child.</li>
 </ul>
 <h2 id="033-2022-11-07"><a href="https://github.com/kayjan/bigtree/compare/0.3.2...0.3.3">0.3.3</a> - 2022-11-07</h2>
-<h3 id="added_48">Added</h3>
+<h3 id="added_49">Added</h3>
 <ul>
 <li>DAG Exporter: To list, nested dictionary, pandas DataFrame.</li>
 </ul>
@@ -7862,17 +7914,17 @@ <h3 id="changed_37">Changed</h3>
 <li>Utility Iterator: Modify docstring.</li>
 </ul>
 <h2 id="032-2022-11-07"><a href="https://github.com/kayjan/bigtree/compare/0.3.1...0.3.2">0.3.2</a> - 2022-11-07</h2>
-<h3 id="fixed_36">Fixed</h3>
+<h3 id="fixed_37">Fixed</h3>
 <ul>
 <li>Tree Exporter: Fix edge direction error.</li>
 </ul>
 <h2 id="031-2022-11-07"><a href="https://github.com/kayjan/bigtree/compare/0.3.0...0.3.1">0.3.1</a> - 2022-11-07</h2>
-<h3 id="added_49">Added</h3>
+<h3 id="added_50">Added</h3>
 <ul>
 <li>Tree and DAG Exporter: More customizations for Node to dot and DAGNode to dot.</li>
 </ul>
 <h2 id="030-2022-11-05"><a href="https://github.com/kayjan/bigtree/compare/0.2.0...0.3.0">0.3.0</a> - 2022-11-05</h2>
-<h3 id="added_50">Added</h3>
+<h3 id="added_51">Added</h3>
 <ul>
 <li>DAG Constructor: From list, nested dictionary, pandas DataFrame.</li>
 <li>Utility Iterator: DAG traversal methods.</li>
@@ -7882,14 +7934,14 @@ <h3 id="changed_38">Changed</h3>
 <li>Tree Exporter and DAG Exporter: More customizations for Node to dot and DAGNode to dot.</li>
 </ul>
 <h2 id="020-2022-11-03"><a href="https://github.com/kayjan/bigtree/compare/0.1.0...0.2.0">0.2.0</a> - 2022-11-03</h2>
-<h3 id="added_51">Added</h3>
+<h3 id="added_52">Added</h3>
 <ul>
 <li>Node: DAGNode for creating DAG graph.</li>
 <li>Tree Exporter: Support Node to dot which can export to png, svg, jpeg, dot files.</li>
 <li>DAG Exporter: Support DAGNode to dot.</li>
 </ul>
 <h2 id="010-2022-11-01"><a href="https://github.com/kayjan/bigtree/releases/tag/0.1.0">0.1.0</a> - 2022-11-01</h2>
-<h3 id="added_52">Added</h3>
+<h3 id="added_53">Added</h3>
 <ul>
 <li>Node: Node and BaseNode.</li>
 <li>Tree Constructor: From list, nested dictionary, pandas DataFrame.</li>
diff --git a/contributing/index.html b/contributing/index.html
index fd57408c..afeb81bb 100644
--- a/contributing/index.html
+++ b/contributing/index.html
@@ -289,7 +289,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../demo/" class="md-tabs__link">
+        <a href="../demo/tree/" class="md-tabs__link">
           
   
     
@@ -971,10 +971,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -999,24 +995,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -1026,8 +1014,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1129,10 +1115,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1149,24 +1131,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1176,8 +1150,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/dag/index.html b/dag/index.html
index 059857f9..4477e536 100644
--- a/dag/index.html
+++ b/dag/index.html
@@ -289,7 +289,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../demo/" class="md-tabs__link">
+        <a href="../demo/tree/" class="md-tabs__link">
           
   
     
@@ -962,10 +962,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -990,24 +986,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -1017,8 +1005,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1120,10 +1106,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1140,24 +1122,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1167,8 +1141,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/demo/binarytree/index.html b/demo/binarytree/index.html
index f2954bcf..59ffee8f 100644
--- a/demo/binarytree/index.html
+++ b/demo/binarytree/index.html
@@ -291,7 +291,7 @@
     
     
       <li class="md-tabs__item md-tabs__item--active">
-        <a href="../" class="md-tabs__link">
+        <a href="../tree/" class="md-tabs__link">
           
   
     
@@ -881,10 +881,6 @@
     
       
         
-          
-        
-      
-        
       
         
       
@@ -910,24 +906,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" checked>
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="true">
           <label class="md-nav__title" for="__nav_2_1">
@@ -937,8 +925,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1122,10 +1108,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1145,24 +1127,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1172,8 +1146,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/demo/dag/index.html b/demo/dag/index.html
index 5b9b9bee..15c9693c 100644
--- a/demo/dag/index.html
+++ b/demo/dag/index.html
@@ -291,7 +291,7 @@
     
     
       <li class="md-tabs__item md-tabs__item--active">
-        <a href="../" class="md-tabs__link">
+        <a href="../tree/" class="md-tabs__link">
           
   
     
@@ -881,10 +881,6 @@
     
       
         
-          
-        
-      
-        
       
         
       
@@ -910,24 +906,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" checked>
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="true">
           <label class="md-nav__title" for="__nav_2_1">
@@ -937,8 +925,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1140,10 +1126,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1163,24 +1145,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1190,8 +1164,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/demo/index.html b/demo/index.html
deleted file mode 100644
index 85e616d4..00000000
--- a/demo/index.html
+++ /dev/null
@@ -1,2313 +0,0 @@
-
-<!doctype html>
-<html lang="en" class="no-js">
-  <head>
-    
-<meta name="keywords" content="Python, Tree, Bigtree">
-<meta property="og:url" content="https://kayjan.github.io/bigtree/demo/" />
-
-      <meta charset="utf-8">
-      <meta name="viewport" content="width=device-width,initial-scale=1">
-      
-      
-      
-        <link rel="canonical" href="https://kayjan.github.io/bigtree/demo/">
-      
-      
-        <link rel="prev" href="../changelog/">
-      
-      
-        <link rel="next" href="tree/">
-      
-      
-      <link rel="icon" href="../_static/favicon.ico">
-      <meta name="generator" content="mkdocs-1.5.3, mkdocs-material-9.5.17">
-    
-
-    
-      
-        <title>Demonstration - bigtree Documentation</title>
-      
-    
-    
-      <link rel="stylesheet" href="../assets/stylesheets/main.bcfcd587.min.css">
-      
-        
-        <link rel="stylesheet" href="../assets/stylesheets/palette.06af60db.min.css">
-      
-      
-
-
-    
-    
-      
-    
-    
-      
-        
-        
-        <link rel="preconnect" href="https://fonts.gstatic.com" crossorigin>
-        <link rel="stylesheet" href="https://fonts.googleapis.com/css?family=Roboto:300,300i,400,400i,700,700i%7CRoboto+Mono:400,400i,700,700i&display=fallback">
-        <style>:root{--md-text-font:"Roboto";--md-code-font:"Roboto Mono"}</style>
-      
-    
-    
-      <link rel="stylesheet" href="../assets/_mkdocstrings.css">
-    
-      <link rel="stylesheet" href="../_static/custom.css">
-    
-      <link rel="stylesheet" href="../termynal.css">
-    
-    <script>__md_scope=new URL("..",location),__md_hash=e=>[...e].reduce((e,_)=>(e<<5)-e+_.charCodeAt(0),0),__md_get=(e,_=localStorage,t=__md_scope)=>JSON.parse(_.getItem(t.pathname+"."+e)),__md_set=(e,_,t=localStorage,a=__md_scope)=>{try{t.setItem(a.pathname+"."+e,JSON.stringify(_))}catch(e){}}</script>
-    
-      
-
-    
-    
-      
-        <meta  property="og:type"  content="website" >
-      
-        <meta  property="og:title"  content="Demonstration - bigtree Documentation" >
-      
-        <meta  property="og:description"  content="None" >
-      
-        <meta  property="og:image"  content="https://kayjan.github.io/bigtree/assets/images/social/demo/index.png" >
-      
-        <meta  property="og:image:type"  content="image/png" >
-      
-        <meta  property="og:image:width"  content="1200" >
-      
-        <meta  property="og:image:height"  content="630" >
-      
-        <meta  property="og:url"  content="https://kayjan.github.io/bigtree/demo/" >
-      
-        <meta  name="twitter:card"  content="summary_large_image" >
-      
-        <meta  name="twitter:title"  content="Demonstration - bigtree Documentation" >
-      
-        <meta  name="twitter:description"  content="None" >
-      
-        <meta  name="twitter:image"  content="https://kayjan.github.io/bigtree/assets/images/social/demo/index.png" >
-      
-    
-    
-   <link href="../assets/stylesheets/glightbox.min.css" rel="stylesheet"/><style>
-    html.glightbox-open { overflow: initial; height: 100%; }
-    .gslide-title { margin-top: 0px; user-select: text; }
-    .gslide-desc { color: #666; user-select: text; }
-    .gslide-image img { background: white; }
-    .gscrollbar-fixer { padding-right: 15px; }
-    .gdesc-inner { font-size: 0.75rem; }
-    body[data-md-color-scheme="slate"] .gdesc-inner { background: var(--md-default-bg-color);}
-    body[data-md-color-scheme="slate"] .gslide-title { color: var(--md-default-fg-color);}
-    body[data-md-color-scheme="slate"] .gslide-desc { color: var(--md-default-fg-color);}</style> <script src="../assets/javascripts/glightbox.min.js"></script></head>
-  
-  
-    
-    
-      
-    
-    
-    
-    
-    <body dir="ltr" data-md-color-scheme="default" data-md-color-primary="teal" data-md-color-accent="amber">
-  
-    
-    <input class="md-toggle" data-md-toggle="drawer" type="checkbox" id="__drawer" autocomplete="off">
-    <input class="md-toggle" data-md-toggle="search" type="checkbox" id="__search" autocomplete="off">
-    <label class="md-overlay" for="__drawer"></label>
-    <div data-md-component="skip">
-      
-        
-        <a href="#demonstration" class="md-skip">
-          Skip to content
-        </a>
-      
-    </div>
-    <div data-md-component="announce">
-      
-    </div>
-    
-      <div data-md-color-scheme="default" data-md-component="outdated" hidden>
-        
-      </div>
-    
-    
-      
-
-  
-
-<header class="md-header md-header--shadow md-header--lifted" data-md-component="header">
-  <nav class="md-header__inner md-grid" aria-label="Header">
-    <a href=".." title="bigtree Documentation" class="md-header__button md-logo" aria-label="bigtree Documentation" data-md-component="logo">
-      
-  <img src="../_static/favicon.svg" alt="logo">
-
-    </a>
-    <label class="md-header__button md-icon" for="__drawer">
-      
-      <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M3 6h18v2H3V6m0 5h18v2H3v-2m0 5h18v2H3v-2Z"/></svg>
-    </label>
-    <div class="md-header__title" data-md-component="header-title">
-      <div class="md-header__ellipsis">
-        <div class="md-header__topic">
-          <span class="md-ellipsis">
-            bigtree Documentation
-          </span>
-        </div>
-        <div class="md-header__topic" data-md-component="header-topic">
-          <span class="md-ellipsis">
-            
-              Demonstration
-            
-          </span>
-        </div>
-      </div>
-    </div>
-    
-      
-        <form class="md-header__option" data-md-component="palette">
-  
-    
-    
-    
-    <input class="md-option" data-md-color-media="(prefers-color-scheme: light)" data-md-color-scheme="default" data-md-color-primary="teal" data-md-color-accent="amber"  aria-label="Switch to dark mode"  type="radio" name="__palette" id="__palette_0">
-    
-      <label class="md-header__button md-icon" title="Switch to dark mode" for="__palette_1" hidden>
-        <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M12 7a5 5 0 0 1 5 5 5 5 0 0 1-5 5 5 5 0 0 1-5-5 5 5 0 0 1 5-5m0 2a3 3 0 0 0-3 3 3 3 0 0 0 3 3 3 3 0 0 0 3-3 3 3 0 0 0-3-3m0-7 2.39 3.42C13.65 5.15 12.84 5 12 5c-.84 0-1.65.15-2.39.42L12 2M3.34 7l4.16-.35A7.2 7.2 0 0 0 5.94 8.5c-.44.74-.69 1.5-.83 2.29L3.34 7m.02 10 1.76-3.77a7.131 7.131 0 0 0 2.38 4.14L3.36 17M20.65 7l-1.77 3.79a7.023 7.023 0 0 0-2.38-4.15l4.15.36m-.01 10-4.14.36c.59-.51 1.12-1.14 1.54-1.86.42-.73.69-1.5.83-2.29L20.64 17M12 22l-2.41-3.44c.74.27 1.55.44 2.41.44.82 0 1.63-.17 2.37-.44L12 22Z"/></svg>
-      </label>
-    
-  
-    
-    
-    
-    <input class="md-option" data-md-color-media="(prefers-color-scheme: dark)" data-md-color-scheme="slate" data-md-color-primary="teal" data-md-color-accent="yellow"  aria-label="Switch to light mode"  type="radio" name="__palette" id="__palette_1">
-    
-      <label class="md-header__button md-icon" title="Switch to light mode" for="__palette_0" hidden>
-        <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="m17.75 4.09-2.53 1.94.91 3.06-2.63-1.81-2.63 1.81.91-3.06-2.53-1.94L12.44 4l1.06-3 1.06 3 3.19.09m3.5 6.91-1.64 1.25.59 1.98-1.7-1.17-1.7 1.17.59-1.98L15.75 11l2.06-.05L18.5 9l.69 1.95 2.06.05m-2.28 4.95c.83-.08 1.72 1.1 1.19 1.85-.32.45-.66.87-1.08 1.27C15.17 23 8.84 23 4.94 19.07c-3.91-3.9-3.91-10.24 0-14.14.4-.4.82-.76 1.27-1.08.75-.53 1.93.36 1.85 1.19-.27 2.86.69 5.83 2.89 8.02a9.96 9.96 0 0 0 8.02 2.89m-1.64 2.02a12.08 12.08 0 0 1-7.8-3.47c-2.17-2.19-3.33-5-3.49-7.82-2.81 3.14-2.7 7.96.31 10.98 3.02 3.01 7.84 3.12 10.98.31Z"/></svg>
-      </label>
-    
-  
-</form>
-      
-    
-    
-      <script>var media,input,key,value,palette=__md_get("__palette");if(palette&&palette.color){"(prefers-color-scheme)"===palette.color.media&&(media=matchMedia("(prefers-color-scheme: light)"),input=document.querySelector(media.matches?"[data-md-color-media='(prefers-color-scheme: light)']":"[data-md-color-media='(prefers-color-scheme: dark)']"),palette.color.media=input.getAttribute("data-md-color-media"),palette.color.scheme=input.getAttribute("data-md-color-scheme"),palette.color.primary=input.getAttribute("data-md-color-primary"),palette.color.accent=input.getAttribute("data-md-color-accent"));for([key,value]of Object.entries(palette.color))document.body.setAttribute("data-md-color-"+key,value)}</script>
-    
-    
-    
-      <label class="md-header__button md-icon" for="__search">
-        
-        <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M9.5 3A6.5 6.5 0 0 1 16 9.5c0 1.61-.59 3.09-1.56 4.23l.27.27h.79l5 5-1.5 1.5-5-5v-.79l-.27-.27A6.516 6.516 0 0 1 9.5 16 6.5 6.5 0 0 1 3 9.5 6.5 6.5 0 0 1 9.5 3m0 2C7 5 5 7 5 9.5S7 14 9.5 14 14 12 14 9.5 12 5 9.5 5Z"/></svg>
-      </label>
-      <div class="md-search" data-md-component="search" role="dialog">
-  <label class="md-search__overlay" for="__search"></label>
-  <div class="md-search__inner" role="search">
-    <form class="md-search__form" name="search">
-      <input type="text" class="md-search__input" name="query" aria-label="Search" placeholder="Search" autocapitalize="off" autocorrect="off" autocomplete="off" spellcheck="false" data-md-component="search-query" required>
-      <label class="md-search__icon md-icon" for="__search">
-        
-        <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M9.5 3A6.5 6.5 0 0 1 16 9.5c0 1.61-.59 3.09-1.56 4.23l.27.27h.79l5 5-1.5 1.5-5-5v-.79l-.27-.27A6.516 6.516 0 0 1 9.5 16 6.5 6.5 0 0 1 3 9.5 6.5 6.5 0 0 1 9.5 3m0 2C7 5 5 7 5 9.5S7 14 9.5 14 14 12 14 9.5 12 5 9.5 5Z"/></svg>
-        
-        <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M20 11v2H8l5.5 5.5-1.42 1.42L4.16 12l7.92-7.92L13.5 5.5 8 11h12Z"/></svg>
-      </label>
-      <nav class="md-search__options" aria-label="Search">
-        
-        <button type="reset" class="md-search__icon md-icon" title="Clear" aria-label="Clear" tabindex="-1">
-          
-          <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M19 6.41 17.59 5 12 10.59 6.41 5 5 6.41 10.59 12 5 17.59 6.41 19 12 13.41 17.59 19 19 17.59 13.41 12 19 6.41Z"/></svg>
-        </button>
-      </nav>
-      
-    </form>
-    <div class="md-search__output">
-      <div class="md-search__scrollwrap" data-md-scrollfix>
-        <div class="md-search-result" data-md-component="search-result">
-          <div class="md-search-result__meta">
-            Initializing search
-          </div>
-          <ol class="md-search-result__list" role="presentation"></ol>
-        </div>
-      </div>
-    </div>
-  </div>
-</div>
-    
-    
-      <div class="md-header__source">
-        <a href="https://github.com/kayjan/bigtree" title="Go to repository" class="md-source" data-md-component="source">
-  <div class="md-source__icon md-icon">
-    
-    <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 496 512"><!--! Font Awesome Free 6.5.1 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2023 Fonticons, Inc.--><path d="M165.9 397.4c0 2-2.3 3.6-5.2 3.6-3.3.3-5.6-1.3-5.6-3.6 0-2 2.3-3.6 5.2-3.6 3-.3 5.6 1.3 5.6 3.6zm-31.1-4.5c-.7 2 1.3 4.3 4.3 4.9 2.6 1 5.6 0 6.2-2s-1.3-4.3-4.3-5.2c-2.6-.7-5.5.3-6.2 2.3zm44.2-1.7c-2.9.7-4.9 2.6-4.6 4.9.3 2 2.9 3.3 5.9 2.6 2.9-.7 4.9-2.6 4.6-4.6-.3-1.9-3-3.2-5.9-2.9zM244.8 8C106.1 8 0 113.3 0 252c0 110.9 69.8 205.8 169.5 239.2 12.8 2.3 17.3-5.6 17.3-12.1 0-6.2-.3-40.4-.3-61.4 0 0-70 15-84.7-29.8 0 0-11.4-29.1-27.8-36.6 0 0-22.9-15.7 1.6-15.4 0 0 24.9 2 38.6 25.8 21.9 38.6 58.6 27.5 72.9 20.9 2.3-16 8.8-27.1 16-33.7-55.9-6.2-112.3-14.3-112.3-110.5 0-27.5 7.6-41.3 23.6-58.9-2.6-6.5-11.1-33.3 2.6-67.9 20.9-6.5 69 27 69 27 20-5.6 41.5-8.5 62.8-8.5s42.8 2.9 62.8 8.5c0 0 48.1-33.6 69-27 13.7 34.7 5.2 61.4 2.6 67.9 16 17.7 25.8 31.5 25.8 58.9 0 96.5-58.9 104.2-114.8 110.5 9.2 7.9 17 22.9 17 46.4 0 33.7-.3 75.4-.3 83.6 0 6.5 4.6 14.4 17.3 12.1C428.2 457.8 496 362.9 496 252 496 113.3 383.5 8 244.8 8zM97.2 352.9c-1.3 1-1 3.3.7 5.2 1.6 1.6 3.9 2.3 5.2 1 1.3-1 1-3.3-.7-5.2-1.6-1.6-3.9-2.3-5.2-1zm-10.8-8.1c-.7 1.3.3 2.9 2.3 3.9 1.6 1 3.6.7 4.3-.7.7-1.3-.3-2.9-2.3-3.9-2-.6-3.6-.3-4.3.7zm32.4 35.6c-1.6 1.3-1 4.3 1.3 6.2 2.3 2.3 5.2 2.6 6.5 1 1.3-1.3.7-4.3-1.3-6.2-2.2-2.3-5.2-2.6-6.5-1zm-11.4-14.7c-1.6 1-1.6 3.6 0 5.9 1.6 2.3 4.3 3.3 5.6 2.3 1.6-1.3 1.6-3.9 0-6.2-1.4-2.3-4-3.3-5.6-2z"/></svg>
-  </div>
-  <div class="md-source__repository">
-    bigtree
-  </div>
-</a>
-      </div>
-    
-  </nav>
-  
-    
-      
-<nav class="md-tabs" aria-label="Tabs" data-md-component="tabs">
-  <div class="md-grid">
-    <ul class="md-tabs__list">
-      
-        
-  
-  
-  
-    
-    
-      <li class="md-tabs__item">
-        <a href=".." class="md-tabs__link">
-          
-  
-    
-  
-  Home
-
-        </a>
-      </li>
-    
-  
-
-      
-        
-  
-  
-    
-  
-  
-    
-    
-      
-  
-  
-    
-  
-  
-    
-    
-      <li class="md-tabs__item md-tabs__item--active">
-        <a href="./" class="md-tabs__link">
-          
-  
-    
-  
-  Getting Started
-
-        </a>
-      </li>
-    
-  
-
-    
-  
-
-      
-        
-  
-  
-  
-    
-    
-      
-  
-  
-  
-    
-    
-      <li class="md-tabs__item">
-        <a href="../bigtree/node/" class="md-tabs__link">
-          
-  
-    
-  
-  Code Documentation
-
-        </a>
-      </li>
-    
-  
-
-    
-  
-
-      
-        
-  
-  
-  
-    
-    
-      
-  
-  
-  
-    
-    
-      <li class="md-tabs__item">
-        <a href="../others/" class="md-tabs__link">
-          
-  
-    
-  
-  Others
-
-        </a>
-      </li>
-    
-  
-
-    
-  
-
-      
-    </ul>
-  </div>
-</nav>
-    
-  
-</header>
-    
-    <div class="md-container" data-md-component="container">
-      
-      
-        
-      
-      <main class="md-main" data-md-component="main">
-        <div class="md-main__inner md-grid">
-          
-            
-              
-              <div class="md-sidebar md-sidebar--primary" data-md-component="sidebar" data-md-type="navigation" >
-                <div class="md-sidebar__scrollwrap">
-                  <div class="md-sidebar__inner">
-                    
-
-
-  
-
-
-<nav class="md-nav md-nav--primary md-nav--lifted" aria-label="Navigation" data-md-level="0">
-  <label class="md-nav__title" for="__drawer">
-    <a href=".." title="bigtree Documentation" class="md-nav__button md-logo" aria-label="bigtree Documentation" data-md-component="logo">
-      
-  <img src="../_static/favicon.svg" alt="logo">
-
-    </a>
-    bigtree Documentation
-  </label>
-  
-    <div class="md-nav__source">
-      <a href="https://github.com/kayjan/bigtree" title="Go to repository" class="md-source" data-md-component="source">
-  <div class="md-source__icon md-icon">
-    
-    <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 496 512"><!--! Font Awesome Free 6.5.1 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2023 Fonticons, Inc.--><path d="M165.9 397.4c0 2-2.3 3.6-5.2 3.6-3.3.3-5.6-1.3-5.6-3.6 0-2 2.3-3.6 5.2-3.6 3-.3 5.6 1.3 5.6 3.6zm-31.1-4.5c-.7 2 1.3 4.3 4.3 4.9 2.6 1 5.6 0 6.2-2s-1.3-4.3-4.3-5.2c-2.6-.7-5.5.3-6.2 2.3zm44.2-1.7c-2.9.7-4.9 2.6-4.6 4.9.3 2 2.9 3.3 5.9 2.6 2.9-.7 4.9-2.6 4.6-4.6-.3-1.9-3-3.2-5.9-2.9zM244.8 8C106.1 8 0 113.3 0 252c0 110.9 69.8 205.8 169.5 239.2 12.8 2.3 17.3-5.6 17.3-12.1 0-6.2-.3-40.4-.3-61.4 0 0-70 15-84.7-29.8 0 0-11.4-29.1-27.8-36.6 0 0-22.9-15.7 1.6-15.4 0 0 24.9 2 38.6 25.8 21.9 38.6 58.6 27.5 72.9 20.9 2.3-16 8.8-27.1 16-33.7-55.9-6.2-112.3-14.3-112.3-110.5 0-27.5 7.6-41.3 23.6-58.9-2.6-6.5-11.1-33.3 2.6-67.9 20.9-6.5 69 27 69 27 20-5.6 41.5-8.5 62.8-8.5s42.8 2.9 62.8 8.5c0 0 48.1-33.6 69-27 13.7 34.7 5.2 61.4 2.6 67.9 16 17.7 25.8 31.5 25.8 58.9 0 96.5-58.9 104.2-114.8 110.5 9.2 7.9 17 22.9 17 46.4 0 33.7-.3 75.4-.3 83.6 0 6.5 4.6 14.4 17.3 12.1C428.2 457.8 496 362.9 496 252 496 113.3 383.5 8 244.8 8zM97.2 352.9c-1.3 1-1 3.3.7 5.2 1.6 1.6 3.9 2.3 5.2 1 1.3-1 1-3.3-.7-5.2-1.6-1.6-3.9-2.3-5.2-1zm-10.8-8.1c-.7 1.3.3 2.9 2.3 3.9 1.6 1 3.6.7 4.3-.7.7-1.3-.3-2.9-2.3-3.9-2-.6-3.6-.3-4.3.7zm32.4 35.6c-1.6 1.3-1 4.3 1.3 6.2 2.3 2.3 5.2 2.6 6.5 1 1.3-1.3.7-4.3-1.3-6.2-2.2-2.3-5.2-2.6-6.5-1zm-11.4-14.7c-1.6 1-1.6 3.6 0 5.9 1.6 2.3 4.3 3.3 5.6 2.3 1.6-1.3 1.6-3.9 0-6.2-1.4-2.3-4-3.3-5.6-2z"/></svg>
-  </div>
-  <div class="md-source__repository">
-    bigtree
-  </div>
-</a>
-    </div>
-  
-  <ul class="md-nav__list" data-md-scrollfix>
-    
-      
-      
-  
-  
-  
-  
-    
-    
-      
-        
-          
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_1" >
-        
-          
-          
-          <div class="md-nav__link md-nav__container">
-            <a href=".." class="md-nav__link ">
-              
-  
-  <span class="md-ellipsis">
-    Home
-  </span>
-  
-
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_1" id="__nav_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
-        
-        <nav class="md-nav" data-md-level="1" aria-labelledby="__nav_1_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_1">
-            <span class="md-nav__icon md-icon"></span>
-            Home
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../home/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    🌳 Documentation
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../install/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Installation
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    
-    
-      
-        
-      
-        
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_1_4" >
-        
-          
-          <label class="md-nav__link" for="__nav_1_4" id="__nav_1_4_label" tabindex="0">
-            
-  
-  <span class="md-ellipsis">
-    Components
-  </span>
-  
-
-            <span class="md-nav__icon md-icon"></span>
-          </label>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_1_4_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_1_4">
-            <span class="md-nav__icon md-icon"></span>
-            Components
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../tree/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Tree
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../binarytree/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Binary Tree
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../dag/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Directed Acyclic Graph (DAG)
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    
-    
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_1_5" >
-        
-          
-          <label class="md-nav__link" for="__nav_1_5" id="__nav_1_5_label" tabindex="0">
-            
-  
-  <span class="md-ellipsis">
-    Contributing
-  </span>
-  
-
-            <span class="md-nav__icon md-icon"></span>
-          </label>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_1_5_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_1_5">
-            <span class="md-nav__icon md-icon"></span>
-            Contributing
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../contributing/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Contributing
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    
-    
-      
-        
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_1_6" >
-        
-          
-          <label class="md-nav__link" for="__nav_1_6" id="__nav_1_6_label" tabindex="0">
-            
-  
-  <span class="md-ellipsis">
-    Changes
-  </span>
-  
-
-            <span class="md-nav__icon md-icon"></span>
-          </label>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_1_6_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_1_6">
-            <span class="md-nav__icon md-icon"></span>
-            Changes
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../benchmarks/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Benchmarks
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../changelog/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Changelog
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-    
-      
-      
-  
-  
-    
-  
-  
-  
-    
-    
-      
-        
-      
-        
-      
-    
-    
-      
-        
-        
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--active md-nav__item--section md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2" checked>
-        
-          
-          <label class="md-nav__link" for="__nav_2" id="__nav_2_label" tabindex="">
-            
-  
-  <span class="md-ellipsis">
-    Getting Started
-  </span>
-  
-
-            <span class="md-nav__icon md-icon"></span>
-          </label>
-        
-        <nav class="md-nav" data-md-level="1" aria-labelledby="__nav_2_label" aria-expanded="true">
-          <label class="md-nav__title" for="__nav_2">
-            <span class="md-nav__icon md-icon"></span>
-            Getting Started
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-                
-  
-  
-    
-  
-  
-  
-    
-    
-      
-        
-          
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-    
-    
-      
-      
-        
-          
-          
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--active md-nav__item--section md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" checked>
-        
-          
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="./" class="md-nav__link md-nav__link--active">
-              
-  
-  <span class="md-ellipsis">
-    Demonstration
-  </span>
-  
-
-            </a>
-            
-              
-              <label class="md-nav__link md-nav__link--active" for="__nav_2_1" id="__nav_2_1_label" tabindex="">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="true">
-          <label class="md-nav__title" for="__nav_2_1">
-            <span class="md-nav__icon md-icon"></span>
-            Demonstration
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="tree/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Tree Demonstration
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="binarytree/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Binary Tree Demonstration
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="dag/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    DAG Demonstration
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="workflow/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Workflow Demonstration
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    
-    
-      
-        
-          
-        
-      
-        
-      
-    
-    
-      
-      
-        
-          
-          
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--section md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
-        
-          
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../resources/" class="md-nav__link ">
-              
-  
-  <span class="md-ellipsis">
-    Resources
-  </span>
-  
-
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_2_2">
-            <span class="md-nav__icon md-icon"></span>
-            Resources
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../resources/articles/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Articles
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-    
-      
-      
-  
-  
-  
-  
-    
-    
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_3" >
-        
-          
-          <label class="md-nav__link" for="__nav_3" id="__nav_3_label" tabindex="0">
-            
-  
-  <span class="md-ellipsis">
-    Code Documentation
-  </span>
-  
-
-            <span class="md-nav__icon md-icon"></span>
-          </label>
-        
-        <nav class="md-nav" data-md-level="1" aria-labelledby="__nav_3_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_3">
-            <span class="md-nav__icon md-icon"></span>
-            Code Documentation
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-                
-  
-  
-  
-  
-    
-    
-      
-        
-          
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_3_1" >
-        
-          
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../bigtree/node/" class="md-nav__link ">
-              
-  
-  <span class="md-ellipsis">
-    Node
-  </span>
-  
-
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_3_1" id="__nav_3_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_3_1_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_3_1">
-            <span class="md-nav__icon md-icon"></span>
-            Node
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/node/basenode/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    BaseNode
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/node/node/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Node
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/node/binarynode/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    BinaryNode
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/node/dagnode/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    DAGNode
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    
-    
-      
-        
-          
-        
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_3_2" >
-        
-          
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../bigtree/binarytree/" class="md-nav__link ">
-              
-  
-  <span class="md-ellipsis">
-    Binary Tree
-  </span>
-  
-
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_3_2" id="__nav_3_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_3_2_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_3_2">
-            <span class="md-nav__icon md-icon"></span>
-            Binary Tree
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/binarytree/construct/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Binary Tree Construct
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    
-    
-      
-        
-          
-        
-      
-        
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_3_3" >
-        
-          
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../bigtree/dag/" class="md-nav__link ">
-              
-  
-  <span class="md-ellipsis">
-    DAG
-  </span>
-  
-
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_3_3" id="__nav_3_3_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_3_3_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_3_3">
-            <span class="md-nav__icon md-icon"></span>
-            DAG
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/dag/construct/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    DAG Construct
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/dag/export/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    DAG Export
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    
-    
-      
-        
-          
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_3_4" >
-        
-          
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../bigtree/tree/" class="md-nav__link ">
-              
-  
-  <span class="md-ellipsis">
-    Tree
-  </span>
-  
-
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_3_4" id="__nav_3_4_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_3_4_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_3_4">
-            <span class="md-nav__icon md-icon"></span>
-            Tree
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/tree/construct/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Tree Construct
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/tree/export/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Tree Export
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/tree/helper/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Tree Helper
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/tree/modify/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Tree Modify
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/tree/search/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Tree Search
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    
-    
-      
-        
-          
-        
-      
-        
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_3_5" >
-        
-          
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../bigtree/utils/" class="md-nav__link ">
-              
-  
-  <span class="md-ellipsis">
-    Utils
-  </span>
-  
-
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_3_5" id="__nav_3_5_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_3_5_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_3_5">
-            <span class="md-nav__icon md-icon"></span>
-            Utils
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/utils/iterators/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Iterators
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/utils/plot/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Plot
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    
-    
-      
-        
-          
-        
-      
-        
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_3_6" >
-        
-          
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../bigtree/workflows/" class="md-nav__link ">
-              
-  
-  <span class="md-ellipsis">
-    Workflows
-  </span>
-  
-
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_3_6" id="__nav_3_6_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_3_6_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_3_6">
-            <span class="md-nav__icon md-icon"></span>
-            Workflows
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/workflows/app_todo/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    To Do App
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/workflows/app_calendar/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Calendar App
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-    
-      
-      
-  
-  
-  
-  
-    
-    
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_4" >
-        
-          
-          <label class="md-nav__link" for="__nav_4" id="__nav_4_label" tabindex="0">
-            
-  
-  <span class="md-ellipsis">
-    Others
-  </span>
-  
-
-            <span class="md-nav__icon md-icon"></span>
-          </label>
-        
-        <nav class="md-nav" data-md-level="1" aria-labelledby="__nav_4_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_4">
-            <span class="md-nav__icon md-icon"></span>
-            Others
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-                
-  
-  
-  
-  
-    
-    
-      
-        
-          
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_4_1" >
-        
-          
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../others/" class="md-nav__link ">
-              
-  
-  <span class="md-ellipsis">
-    Tips and Tricks
-  </span>
-  
-
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_4_1" id="__nav_4_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_4_1_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_4_1">
-            <span class="md-nav__icon md-icon"></span>
-            Tips and Tricks
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../others/remove_checks/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Remove Tree Checks
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../others/list_dir/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    List Directory
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../others/nodes/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Extending Nodes
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../others/merging_trees/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Merging Trees
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../others/weighted_trees/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Trees with Weighted Edges
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-    
-  </ul>
-</nav>
-                  </div>
-                </div>
-              </div>
-            
-            
-              
-              <div class="md-sidebar md-sidebar--secondary" data-md-component="sidebar" data-md-type="toc" >
-                <div class="md-sidebar__scrollwrap">
-                  <div class="md-sidebar__inner">
-                    
-
-<nav class="md-nav md-nav--secondary" aria-label="Table of contents">
-  
-  
-  
-    
-  
-  
-</nav>
-                  </div>
-                </div>
-              </div>
-            
-          
-          
-            <div class="md-content" data-md-component="content">
-              <article class="md-content__inner md-typeset">
-                
-                  
-
-  
-  
-
-
-<h1 id="demonstration">📋 Demonstration</h1>
-
-
-
-
-
-
-
-  
-  
-
-
-
-
-
-
-                
-              </article>
-            </div>
-          
-          
-<script>var target=document.getElementById(location.hash.slice(1));target&&target.name&&(target.checked=target.name.startsWith("__tabbed_"))</script>
-        </div>
-        
-          <button type="button" class="md-top md-icon" data-md-component="top" hidden>
-  
-  <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M13 20h-2V8l-5.5 5.5-1.42-1.42L12 4.16l7.92 7.92-1.42 1.42L13 8v12Z"/></svg>
-  Back to top
-</button>
-        
-      </main>
-      
-        <footer class="md-footer">
-  
-  <div class="md-footer-meta md-typeset">
-    <div class="md-footer-meta__inner md-grid">
-      <div class="md-copyright">
-  
-  
-    Made with
-    <a href="https://squidfunk.github.io/mkdocs-material/" target="_blank" rel="noopener">
-      Material for MkDocs
-    </a>
-  
-</div>
-      
-        <div class="md-social">
-  
-    
-    
-    
-    
-      
-      
-    
-    <a href="https://github.com/kayjan" target="_blank" rel="noopener" title="github.com" class="md-social__link">
-      <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 496 512"><!--! Font Awesome Free 6.5.1 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2023 Fonticons, Inc.--><path d="M165.9 397.4c0 2-2.3 3.6-5.2 3.6-3.3.3-5.6-1.3-5.6-3.6 0-2 2.3-3.6 5.2-3.6 3-.3 5.6 1.3 5.6 3.6zm-31.1-4.5c-.7 2 1.3 4.3 4.3 4.9 2.6 1 5.6 0 6.2-2s-1.3-4.3-4.3-5.2c-2.6-.7-5.5.3-6.2 2.3zm44.2-1.7c-2.9.7-4.9 2.6-4.6 4.9.3 2 2.9 3.3 5.9 2.6 2.9-.7 4.9-2.6 4.6-4.6-.3-1.9-3-3.2-5.9-2.9zM244.8 8C106.1 8 0 113.3 0 252c0 110.9 69.8 205.8 169.5 239.2 12.8 2.3 17.3-5.6 17.3-12.1 0-6.2-.3-40.4-.3-61.4 0 0-70 15-84.7-29.8 0 0-11.4-29.1-27.8-36.6 0 0-22.9-15.7 1.6-15.4 0 0 24.9 2 38.6 25.8 21.9 38.6 58.6 27.5 72.9 20.9 2.3-16 8.8-27.1 16-33.7-55.9-6.2-112.3-14.3-112.3-110.5 0-27.5 7.6-41.3 23.6-58.9-2.6-6.5-11.1-33.3 2.6-67.9 20.9-6.5 69 27 69 27 20-5.6 41.5-8.5 62.8-8.5s42.8 2.9 62.8 8.5c0 0 48.1-33.6 69-27 13.7 34.7 5.2 61.4 2.6 67.9 16 17.7 25.8 31.5 25.8 58.9 0 96.5-58.9 104.2-114.8 110.5 9.2 7.9 17 22.9 17 46.4 0 33.7-.3 75.4-.3 83.6 0 6.5 4.6 14.4 17.3 12.1C428.2 457.8 496 362.9 496 252 496 113.3 383.5 8 244.8 8zM97.2 352.9c-1.3 1-1 3.3.7 5.2 1.6 1.6 3.9 2.3 5.2 1 1.3-1 1-3.3-.7-5.2-1.6-1.6-3.9-2.3-5.2-1zm-10.8-8.1c-.7 1.3.3 2.9 2.3 3.9 1.6 1 3.6.7 4.3-.7.7-1.3-.3-2.9-2.3-3.9-2-.6-3.6-.3-4.3.7zm32.4 35.6c-1.6 1.3-1 4.3 1.3 6.2 2.3 2.3 5.2 2.6 6.5 1 1.3-1.3.7-4.3-1.3-6.2-2.2-2.3-5.2-2.6-6.5-1zm-11.4-14.7c-1.6 1-1.6 3.6 0 5.9 1.6 2.3 4.3 3.3 5.6 2.3 1.6-1.3 1.6-3.9 0-6.2-1.4-2.3-4-3.3-5.6-2z"/></svg>
-    </a>
-  
-    
-    
-    
-    
-      
-      
-    
-    <a href="https://linkedin.com/in/kayjan" target="_blank" rel="noopener" title="linkedin.com" class="md-social__link">
-      <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512"><!--! Font Awesome Free 6.5.1 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2023 Fonticons, Inc.--><path d="M416 32H31.9C14.3 32 0 46.5 0 64.3v383.4C0 465.5 14.3 480 31.9 480H416c17.6 0 32-14.5 32-32.3V64.3c0-17.8-14.4-32.3-32-32.3zM135.4 416H69V202.2h66.5V416zm-33.2-243c-21.3 0-38.5-17.3-38.5-38.5S80.9 96 102.2 96c21.2 0 38.5 17.3 38.5 38.5 0 21.3-17.2 38.5-38.5 38.5zm282.1 243h-66.4V312c0-24.8-.5-56.7-34.5-56.7-34.6 0-39.9 27-39.9 54.9V416h-66.4V202.2h63.7v29.2h.9c8.9-16.8 30.6-34.5 62.9-34.5 67.2 0 79.7 44.3 79.7 101.9V416z"/></svg>
-    </a>
-  
-    
-    
-    
-    
-      
-      
-    
-    <a href="https://kayjanwong.medium.com" target="_blank" rel="noopener" title="kayjanwong.medium.com" class="md-social__link">
-      <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 640 512"><!--! Font Awesome Free 6.5.1 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2023 Fonticons, Inc.--><path d="M180.5 74.262C80.813 74.262 0 155.633 0 256s80.819 181.738 180.5 181.738S361 356.373 361 256 280.191 74.262 180.5 74.262Zm288.25 10.646c-49.845 0-90.245 76.619-90.245 171.095s40.406 171.1 90.251 171.1 90.251-76.619 90.251-171.1H559c0-94.503-40.4-171.095-90.248-171.095Zm139.506 17.821c-17.526 0-31.735 68.628-31.735 153.274s14.2 153.274 31.735 153.274S640 340.631 640 256c0-84.649-14.215-153.271-31.742-153.271Z"/></svg>
-    </a>
-  
-</div>
-      
-    </div>
-  </div>
-</footer>
-      
-    </div>
-    <div class="md-dialog" data-md-component="dialog">
-      <div class="md-dialog__inner md-typeset"></div>
-    </div>
-    
-    
-    <script id="__config" type="application/json">{"base": "..", "features": ["navigation.tabs", "navigation.tabs.sticky", "navigation.top", "navigation.indexes", "navigation.sections", "content.code.copy", "content.code.annotate", "content.tooltips"], "search": "../assets/javascripts/workers/search.b8dbb3d2.min.js", "translations": {"clipboard.copied": "Copied to clipboard", "clipboard.copy": "Copy to clipboard", "search.result.more.one": "1 more on this page", "search.result.more.other": "# more on this page", "search.result.none": "No matching documents", "search.result.one": "1 matching document", "search.result.other": "# matching documents", "search.result.placeholder": "Type to start searching", "search.result.term.missing": "Missing", "select.version": "Select version"}, "version": {"provider": "mike"}}</script>
-    
-    
-      <script src="../assets/javascripts/bundle.1e8ae164.min.js"></script>
-      
-        <script src="../_static/custom.js"></script>
-      
-        <script src="../termynal.js"></script>
-      
-    
-  <script>document$.subscribe(() => {const lightbox = GLightbox({"touchNavigation": true, "loop": false, "zoomable": true, "draggable": true, "openEffect": "zoom", "closeEffect": "zoom", "slideEffect": "slide"});})</script></body>
-</html>
\ No newline at end of file
diff --git a/demo/tree/index.html b/demo/tree/index.html
index 7ddbdd21..43f8e5e6 100644
--- a/demo/tree/index.html
+++ b/demo/tree/index.html
@@ -14,7 +14,7 @@
         <link rel="canonical" href="https://kayjan.github.io/bigtree/demo/tree/">
       
       
-        <link rel="prev" href="../">
+        <link rel="prev" href="../../changelog/">
       
       
         <link rel="next" href="../binarytree/">
@@ -291,7 +291,7 @@
     
     
       <li class="md-tabs__item md-tabs__item--active">
-        <a href="../" class="md-tabs__link">
+        <a href="./" class="md-tabs__link">
           
   
     
@@ -881,10 +881,6 @@
     
       
         
-          
-        
-      
-        
       
         
       
@@ -910,24 +906,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" checked>
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="true">
           <label class="md-nav__title" for="__nav_2_1">
@@ -937,8 +925,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1043,6 +1029,15 @@
     </span>
   </a>
   
+</li>
+        
+          <li class="md-nav__item">
+  <a href="#6-from-polars-dataframe" class="md-nav__link">
+    <span class="md-ellipsis">
+      6. From polars DataFrame
+    </span>
+  </a>
+  
 </li>
         
       </ul>
@@ -1245,10 +1240,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1268,24 +1259,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1295,8 +1278,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -2454,6 +2435,15 @@
     </span>
   </a>
   
+</li>
+        
+          <li class="md-nav__item">
+  <a href="#6-from-polars-dataframe" class="md-nav__link">
+    <span class="md-ellipsis">
+      6. From polars DataFrame
+    </span>
+  </a>
+  
 </li>
         
       </ul>
@@ -2587,7 +2577,7 @@
 <h1 id="tree-demonstration">📋 Tree Demonstration</h1>
 <p>Here are some codes to get started.</p>
 <h2 id="construct-tree">Construct Tree</h2>
-<p>Nodes can have attributes if they are initialized from <code>Node</code>, <em>dictionary</em>, or <em>pandas DataFrame</em>.</p>
+<p>Nodes can have attributes if they are initialized from <code>Node</code>, <em>dictionary</em>, <em>pandas DataFrame</em>, or <em>polars DataFrame</em>.</p>
 <h3 id="1-from-node">1. From Node</h3>
 <p>Nodes can be linked to each other in the following ways:</p>
 <ul>
@@ -2845,121 +2835,174 @@ <h3 id="5-from-pandas-dataframe">5. From pandas DataFrame</h3>
 </div>
 </div>
 </div>
+<h3 id="6-from-polars-dataframe">6. From polars DataFrame</h3>
+<p>Construct nodes with attributes. <em>Polars DataFrame</em> can contain either <mark>path column</mark> or
+<mark>parent-child columns</mark>. Other columns can be used to specify attributes.</p>
+<div class="tabbed-set tabbed-alternate" data-tabs="6:2"><input checked="checked" id="__tabbed_6_1" name="__tabbed_6" type="radio" /><input id="__tabbed_6_2" name="__tabbed_6" type="radio" /><div class="tabbed-labels"><label for="__tabbed_6_1">Path column</label><label for="__tabbed_6_2">Parent-child columns</label></div>
+<div class="tabbed-content">
+<div class="tabbed-block">
+<div class="language-python highlight"><pre><span></span><code><span id="__span-12-1"><a id="__codelineno-12-1" name="__codelineno-12-1" href="#__codelineno-12-1"></a><span class="kn">import</span> <span class="nn">polars</span> <span class="k">as</span> <span class="nn">pl</span>
+</span><span id="__span-12-2"><a id="__codelineno-12-2" name="__codelineno-12-2" href="#__codelineno-12-2"></a>
+</span><span id="__span-12-3"><a id="__codelineno-12-3" name="__codelineno-12-3" href="#__codelineno-12-3"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">polars_to_tree</span>
+</span><span id="__span-12-4"><a id="__codelineno-12-4" name="__codelineno-12-4" href="#__codelineno-12-4"></a>
+</span><span id="__span-12-5"><a id="__codelineno-12-5" name="__codelineno-12-5" href="#__codelineno-12-5"></a><span class="n">data</span> <span class="o">=</span> <span class="n">pl</span><span class="o">.</span><span class="n">DataFrame</span><span class="p">(</span>
+</span><span id="__span-12-6"><a id="__codelineno-12-6" name="__codelineno-12-6" href="#__codelineno-12-6"></a>   <span class="p">[</span>
+</span><span id="__span-12-7"><a id="__codelineno-12-7" name="__codelineno-12-7" href="#__codelineno-12-7"></a>      <span class="p">[</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="mi">90</span><span class="p">],</span>
+</span><span id="__span-12-8"><a id="__codelineno-12-8" name="__codelineno-12-8" href="#__codelineno-12-8"></a>      <span class="p">[</span><span class="s2">&quot;a/b&quot;</span><span class="p">,</span> <span class="mi">65</span><span class="p">],</span>
+</span><span id="__span-12-9"><a id="__codelineno-12-9" name="__codelineno-12-9" href="#__codelineno-12-9"></a>      <span class="p">[</span><span class="s2">&quot;a/c&quot;</span><span class="p">,</span> <span class="mi">60</span><span class="p">],</span>
+</span><span id="__span-12-10"><a id="__codelineno-12-10" name="__codelineno-12-10" href="#__codelineno-12-10"></a>      <span class="p">[</span><span class="s2">&quot;a/b/d&quot;</span><span class="p">,</span> <span class="mi">40</span><span class="p">],</span>
+</span><span id="__span-12-11"><a id="__codelineno-12-11" name="__codelineno-12-11" href="#__codelineno-12-11"></a>   <span class="p">],</span>
+</span><span id="__span-12-12"><a id="__codelineno-12-12" name="__codelineno-12-12" href="#__codelineno-12-12"></a>   <span class="n">schema</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;path&quot;</span><span class="p">,</span> <span class="s2">&quot;age&quot;</span><span class="p">],</span>
+</span><span id="__span-12-13"><a id="__codelineno-12-13" name="__codelineno-12-13" href="#__codelineno-12-13"></a><span class="p">)</span>
+</span><span id="__span-12-14"><a id="__codelineno-12-14" name="__codelineno-12-14" href="#__codelineno-12-14"></a><span class="hll"><span class="n">root</span> <span class="o">=</span> <span class="n">polars_to_tree</span><span class="p">(</span><span class="n">data</span><span class="p">)</span>
+</span></span><span id="__span-12-15"><a id="__codelineno-12-15" name="__codelineno-12-15" href="#__codelineno-12-15"></a>
+</span><span id="__span-12-16"><a id="__codelineno-12-16" name="__codelineno-12-16" href="#__codelineno-12-16"></a><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">(</span><span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;age&quot;</span><span class="p">])</span>
+</span><span id="__span-12-17"><a id="__codelineno-12-17" name="__codelineno-12-17" href="#__codelineno-12-17"></a><span class="c1"># a [age=90]</span>
+</span><span id="__span-12-18"><a id="__codelineno-12-18" name="__codelineno-12-18" href="#__codelineno-12-18"></a><span class="c1"># ├── b [age=65]</span>
+</span><span id="__span-12-19"><a id="__codelineno-12-19" name="__codelineno-12-19" href="#__codelineno-12-19"></a><span class="c1"># │   └── d [age=40]</span>
+</span><span id="__span-12-20"><a id="__codelineno-12-20" name="__codelineno-12-20" href="#__codelineno-12-20"></a><span class="c1"># └── c [age=60]</span>
+</span></code></pre></div>
+</div>
+<div class="tabbed-block">
+<div class="language-python highlight"><pre><span></span><code><span id="__span-13-1"><a id="__codelineno-13-1" name="__codelineno-13-1" href="#__codelineno-13-1"></a><span class="kn">import</span> <span class="nn">polars</span> <span class="k">as</span> <span class="nn">pl</span>
+</span><span id="__span-13-2"><a id="__codelineno-13-2" name="__codelineno-13-2" href="#__codelineno-13-2"></a>
+</span><span id="__span-13-3"><a id="__codelineno-13-3" name="__codelineno-13-3" href="#__codelineno-13-3"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">polars_to_tree_by_relation</span>
+</span><span id="__span-13-4"><a id="__codelineno-13-4" name="__codelineno-13-4" href="#__codelineno-13-4"></a>
+</span><span id="__span-13-5"><a id="__codelineno-13-5" name="__codelineno-13-5" href="#__codelineno-13-5"></a><span class="n">data</span> <span class="o">=</span> <span class="n">pl</span><span class="o">.</span><span class="n">DataFrame</span><span class="p">(</span>
+</span><span id="__span-13-6"><a id="__codelineno-13-6" name="__codelineno-13-6" href="#__codelineno-13-6"></a>   <span class="p">[</span>
+</span><span id="__span-13-7"><a id="__codelineno-13-7" name="__codelineno-13-7" href="#__codelineno-13-7"></a>      <span class="p">[</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="kc">None</span><span class="p">,</span> <span class="mi">90</span><span class="p">],</span>
+</span><span id="__span-13-8"><a id="__codelineno-13-8" name="__codelineno-13-8" href="#__codelineno-13-8"></a>      <span class="p">[</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="mi">65</span><span class="p">],</span>
+</span><span id="__span-13-9"><a id="__codelineno-13-9" name="__codelineno-13-9" href="#__codelineno-13-9"></a>      <span class="p">[</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="mi">60</span><span class="p">],</span>
+</span><span id="__span-13-10"><a id="__codelineno-13-10" name="__codelineno-13-10" href="#__codelineno-13-10"></a>      <span class="p">[</span><span class="s2">&quot;d&quot;</span><span class="p">,</span> <span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="mi">40</span><span class="p">],</span>
+</span><span id="__span-13-11"><a id="__codelineno-13-11" name="__codelineno-13-11" href="#__codelineno-13-11"></a>   <span class="p">],</span>
+</span><span id="__span-13-12"><a id="__codelineno-13-12" name="__codelineno-13-12" href="#__codelineno-13-12"></a>   <span class="n">schema</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;child&quot;</span><span class="p">,</span> <span class="s2">&quot;parent&quot;</span><span class="p">,</span> <span class="s2">&quot;age&quot;</span><span class="p">],</span>
+</span><span id="__span-13-13"><a id="__codelineno-13-13" name="__codelineno-13-13" href="#__codelineno-13-13"></a><span class="p">)</span>
+</span><span id="__span-13-14"><a id="__codelineno-13-14" name="__codelineno-13-14" href="#__codelineno-13-14"></a><span class="hll"><span class="n">root</span> <span class="o">=</span> <span class="n">polars_to_tree_by_relation</span><span class="p">(</span><span class="n">data</span><span class="p">)</span>
+</span></span><span id="__span-13-15"><a id="__codelineno-13-15" name="__codelineno-13-15" href="#__codelineno-13-15"></a>
+</span><span id="__span-13-16"><a id="__codelineno-13-16" name="__codelineno-13-16" href="#__codelineno-13-16"></a><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">(</span><span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;age&quot;</span><span class="p">])</span>
+</span><span id="__span-13-17"><a id="__codelineno-13-17" name="__codelineno-13-17" href="#__codelineno-13-17"></a><span class="c1"># a [age=90]</span>
+</span><span id="__span-13-18"><a id="__codelineno-13-18" name="__codelineno-13-18" href="#__codelineno-13-18"></a><span class="c1"># ├── b [age=65]</span>
+</span><span id="__span-13-19"><a id="__codelineno-13-19" name="__codelineno-13-19" href="#__codelineno-13-19"></a><span class="c1"># │   └── d [age=40]</span>
+</span><span id="__span-13-20"><a id="__codelineno-13-20" name="__codelineno-13-20" href="#__codelineno-13-20"></a><span class="c1"># └── c [age=60]</span>
+</span></code></pre></div>
+</div>
+</div>
+</div>
 <div class="admonition note">
 <p class="admonition-title">Note</p>
-<p>If tree is already created, nodes can still be added using path string, dictionary, and pandas DataFrame!<br>
-Attributes can be added to existing nodes using a dictionary or pandas DataFrame.</p>
+<p>If tree is already created, nodes can still be added using path string, dictionary, and pandas/polars DataFrame!<br>
+Attributes can be added to existing nodes using a dictionary or pandas/polars DataFrame.</p>
 </div>
 <h2 id="print-tree">Print Tree</h2>
 <p>After tree is constructed, it can be viewed by printing to console using <code>show</code> or <code>hshow</code> method directly,
 for vertical and horizontal orientation respectively.
 Alternatively, the <code>print_tree</code> or <code>hprint_tree</code> method can be used.</p>
-<div class="language-python highlight"><pre><span></span><code><span id="__span-12-1"><a id="__codelineno-12-1" name="__codelineno-12-1" href="#__codelineno-12-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">Node</span><span class="p">,</span> <span class="n">print_tree</span><span class="p">,</span> <span class="n">hprint_tree</span>
-</span><span id="__span-12-2"><a id="__codelineno-12-2" name="__codelineno-12-2" href="#__codelineno-12-2"></a>
-</span><span id="__span-12-3"><a id="__codelineno-12-3" name="__codelineno-12-3" href="#__codelineno-12-3"></a><span class="n">root</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">90</span><span class="p">,</span> <span class="n">gender</span><span class="o">=</span><span class="s2">&quot;F&quot;</span><span class="p">)</span>
-</span><span id="__span-12-4"><a id="__codelineno-12-4" name="__codelineno-12-4" href="#__codelineno-12-4"></a><span class="n">b</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">65</span><span class="p">,</span> <span class="n">gender</span><span class="o">=</span><span class="s2">&quot;M&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
-</span><span id="__span-12-5"><a id="__codelineno-12-5" name="__codelineno-12-5" href="#__codelineno-12-5"></a><span class="n">c</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">60</span><span class="p">,</span> <span class="n">gender</span><span class="o">=</span><span class="s2">&quot;M&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
-</span><span id="__span-12-6"><a id="__codelineno-12-6" name="__codelineno-12-6" href="#__codelineno-12-6"></a><span class="n">d</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;d&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">40</span><span class="p">,</span> <span class="n">gender</span><span class="o">=</span><span class="s2">&quot;F&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
-</span><span id="__span-12-7"><a id="__codelineno-12-7" name="__codelineno-12-7" href="#__codelineno-12-7"></a><span class="n">e</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;e&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">35</span><span class="p">,</span> <span class="n">gender</span><span class="o">=</span><span class="s2">&quot;M&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
-</span><span id="__span-12-8"><a id="__codelineno-12-8" name="__codelineno-12-8" href="#__codelineno-12-8"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">)</span> <span class="c1"># (1)!</span>
-</span></span><span id="__span-12-9"><a id="__codelineno-12-9" name="__codelineno-12-9" href="#__codelineno-12-9"></a><span class="c1"># a</span>
-</span><span id="__span-12-10"><a id="__codelineno-12-10" name="__codelineno-12-10" href="#__codelineno-12-10"></a><span class="c1"># ├── b</span>
-</span><span id="__span-12-11"><a id="__codelineno-12-11" name="__codelineno-12-11" href="#__codelineno-12-11"></a><span class="c1"># │   ├── d</span>
-</span><span id="__span-12-12"><a id="__codelineno-12-12" name="__codelineno-12-12" href="#__codelineno-12-12"></a><span class="c1"># │   └── e</span>
-</span><span id="__span-12-13"><a id="__codelineno-12-13" name="__codelineno-12-13" href="#__codelineno-12-13"></a><span class="c1"># └── c</span>
-</span><span id="__span-12-14"><a id="__codelineno-12-14" name="__codelineno-12-14" href="#__codelineno-12-14"></a>
-</span><span id="__span-12-15"><a id="__codelineno-12-15" name="__codelineno-12-15" href="#__codelineno-12-15"></a><span class="hll"><span class="n">hprint_tree</span><span class="p">(</span><span class="n">root</span><span class="p">)</span> <span class="c1"># (2)!</span>
-</span></span><span id="__span-12-16"><a id="__codelineno-12-16" name="__codelineno-12-16" href="#__codelineno-12-16"></a><span class="c1">#            ┌─ d</span>
-</span><span id="__span-12-17"><a id="__codelineno-12-17" name="__codelineno-12-17" href="#__codelineno-12-17"></a><span class="c1">#      ┌─ b ─┤</span>
-</span><span id="__span-12-18"><a id="__codelineno-12-18" name="__codelineno-12-18" href="#__codelineno-12-18"></a><span class="c1"># ─ a ─┤     └─ e</span>
-</span><span id="__span-12-19"><a id="__codelineno-12-19" name="__codelineno-12-19" href="#__codelineno-12-19"></a><span class="c1">#      └─ c</span>
-</span><span id="__span-12-20"><a id="__codelineno-12-20" name="__codelineno-12-20" href="#__codelineno-12-20"></a>
-</span><span id="__span-12-21"><a id="__codelineno-12-21" name="__codelineno-12-21" href="#__codelineno-12-21"></a><span class="c1"># Print subtree</span>
-</span><span id="__span-12-22"><a id="__codelineno-12-22" name="__codelineno-12-22" href="#__codelineno-12-22"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">node_name_or_path</span><span class="o">=</span><span class="s2">&quot;b&quot;</span><span class="p">)</span>
-</span></span><span id="__span-12-23"><a id="__codelineno-12-23" name="__codelineno-12-23" href="#__codelineno-12-23"></a><span class="c1"># b</span>
-</span><span id="__span-12-24"><a id="__codelineno-12-24" name="__codelineno-12-24" href="#__codelineno-12-24"></a><span class="c1"># ├── d</span>
-</span><span id="__span-12-25"><a id="__codelineno-12-25" name="__codelineno-12-25" href="#__codelineno-12-25"></a><span class="c1"># └── e</span>
-</span><span id="__span-12-26"><a id="__codelineno-12-26" name="__codelineno-12-26" href="#__codelineno-12-26"></a>
-</span><span id="__span-12-27"><a id="__codelineno-12-27" name="__codelineno-12-27" href="#__codelineno-12-27"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">max_depth</span><span class="o">=</span><span class="mi">2</span><span class="p">)</span>
-</span></span><span id="__span-12-28"><a id="__codelineno-12-28" name="__codelineno-12-28" href="#__codelineno-12-28"></a><span class="c1"># a</span>
-</span><span id="__span-12-29"><a id="__codelineno-12-29" name="__codelineno-12-29" href="#__codelineno-12-29"></a><span class="c1"># ├── b</span>
-</span><span id="__span-12-30"><a id="__codelineno-12-30" name="__codelineno-12-30" href="#__codelineno-12-30"></a><span class="c1"># └── c</span>
-</span><span id="__span-12-31"><a id="__codelineno-12-31" name="__codelineno-12-31" href="#__codelineno-12-31"></a>
-</span><span id="__span-12-32"><a id="__codelineno-12-32" name="__codelineno-12-32" href="#__codelineno-12-32"></a><span class="c1"># Print attributes</span>
-</span><span id="__span-12-33"><a id="__codelineno-12-33" name="__codelineno-12-33" href="#__codelineno-12-33"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;age&quot;</span><span class="p">])</span>
-</span></span><span id="__span-12-34"><a id="__codelineno-12-34" name="__codelineno-12-34" href="#__codelineno-12-34"></a><span class="c1"># a [age=90]</span>
-</span><span id="__span-12-35"><a id="__codelineno-12-35" name="__codelineno-12-35" href="#__codelineno-12-35"></a><span class="c1"># ├── b [age=65]</span>
-</span><span id="__span-12-36"><a id="__codelineno-12-36" name="__codelineno-12-36" href="#__codelineno-12-36"></a><span class="c1"># │   ├── d [age=40]</span>
-</span><span id="__span-12-37"><a id="__codelineno-12-37" name="__codelineno-12-37" href="#__codelineno-12-37"></a><span class="c1"># │   └── e [age=35]</span>
-</span><span id="__span-12-38"><a id="__codelineno-12-38" name="__codelineno-12-38" href="#__codelineno-12-38"></a><span class="c1"># └── c [age=60]</span>
-</span><span id="__span-12-39"><a id="__codelineno-12-39" name="__codelineno-12-39" href="#__codelineno-12-39"></a>
-</span><span id="__span-12-40"><a id="__codelineno-12-40" name="__codelineno-12-40" href="#__codelineno-12-40"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;age&quot;</span><span class="p">],</span> <span class="n">attr_bracket</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;*(&quot;</span><span class="p">,</span> <span class="s2">&quot;)&quot;</span><span class="p">])</span>
-</span></span><span id="__span-12-41"><a id="__codelineno-12-41" name="__codelineno-12-41" href="#__codelineno-12-41"></a><span class="c1"># a *(age=90)</span>
-</span><span id="__span-12-42"><a id="__codelineno-12-42" name="__codelineno-12-42" href="#__codelineno-12-42"></a><span class="c1"># ├── b *(age=65)</span>
-</span><span id="__span-12-43"><a id="__codelineno-12-43" name="__codelineno-12-43" href="#__codelineno-12-43"></a><span class="c1"># │   ├── d *(age=40)</span>
-</span><span id="__span-12-44"><a id="__codelineno-12-44" name="__codelineno-12-44" href="#__codelineno-12-44"></a><span class="c1"># │   └── e *(age=35)</span>
-</span><span id="__span-12-45"><a id="__codelineno-12-45" name="__codelineno-12-45" href="#__codelineno-12-45"></a><span class="c1"># └── c *(age=60)</span>
-</span><span id="__span-12-46"><a id="__codelineno-12-46" name="__codelineno-12-46" href="#__codelineno-12-46"></a>
-</span><span id="__span-12-47"><a id="__codelineno-12-47" name="__codelineno-12-47" href="#__codelineno-12-47"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">all_attrs</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
-</span></span><span id="__span-12-48"><a id="__codelineno-12-48" name="__codelineno-12-48" href="#__codelineno-12-48"></a><span class="c1"># a [age=90, gender=F]</span>
-</span><span id="__span-12-49"><a id="__codelineno-12-49" name="__codelineno-12-49" href="#__codelineno-12-49"></a><span class="c1"># ├── b [age=65, gender=M]</span>
-</span><span id="__span-12-50"><a id="__codelineno-12-50" name="__codelineno-12-50" href="#__codelineno-12-50"></a><span class="c1"># │   ├── d [age=40, gender=F]</span>
-</span><span id="__span-12-51"><a id="__codelineno-12-51" name="__codelineno-12-51" href="#__codelineno-12-51"></a><span class="c1"># │   └── e [age=35, gender=M]</span>
-</span><span id="__span-12-52"><a id="__codelineno-12-52" name="__codelineno-12-52" href="#__codelineno-12-52"></a><span class="c1"># └── c [age=60, gender=M]</span>
-</span><span id="__span-12-53"><a id="__codelineno-12-53" name="__codelineno-12-53" href="#__codelineno-12-53"></a>
-</span><span id="__span-12-54"><a id="__codelineno-12-54" name="__codelineno-12-54" href="#__codelineno-12-54"></a><span class="c1"># Available styles</span>
-</span><span id="__span-12-55"><a id="__codelineno-12-55" name="__codelineno-12-55" href="#__codelineno-12-55"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">style</span><span class="o">=</span><span class="s2">&quot;ansi&quot;</span><span class="p">)</span>
-</span></span><span id="__span-12-56"><a id="__codelineno-12-56" name="__codelineno-12-56" href="#__codelineno-12-56"></a><span class="c1"># a</span>
-</span><span id="__span-12-57"><a id="__codelineno-12-57" name="__codelineno-12-57" href="#__codelineno-12-57"></a><span class="c1"># |-- b</span>
-</span><span id="__span-12-58"><a id="__codelineno-12-58" name="__codelineno-12-58" href="#__codelineno-12-58"></a><span class="c1"># |   |-- d</span>
-</span><span id="__span-12-59"><a id="__codelineno-12-59" name="__codelineno-12-59" href="#__codelineno-12-59"></a><span class="c1"># |   `-- e</span>
-</span><span id="__span-12-60"><a id="__codelineno-12-60" name="__codelineno-12-60" href="#__codelineno-12-60"></a><span class="c1"># `-- c</span>
-</span><span id="__span-12-61"><a id="__codelineno-12-61" name="__codelineno-12-61" href="#__codelineno-12-61"></a>
-</span><span id="__span-12-62"><a id="__codelineno-12-62" name="__codelineno-12-62" href="#__codelineno-12-62"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">style</span><span class="o">=</span><span class="s2">&quot;ascii&quot;</span><span class="p">)</span>
-</span></span><span id="__span-12-63"><a id="__codelineno-12-63" name="__codelineno-12-63" href="#__codelineno-12-63"></a><span class="c1"># a</span>
-</span><span id="__span-12-64"><a id="__codelineno-12-64" name="__codelineno-12-64" href="#__codelineno-12-64"></a><span class="c1"># |-- b</span>
-</span><span id="__span-12-65"><a id="__codelineno-12-65" name="__codelineno-12-65" href="#__codelineno-12-65"></a><span class="c1"># |   |-- d</span>
-</span><span id="__span-12-66"><a id="__codelineno-12-66" name="__codelineno-12-66" href="#__codelineno-12-66"></a><span class="c1"># |   +-- e</span>
-</span><span id="__span-12-67"><a id="__codelineno-12-67" name="__codelineno-12-67" href="#__codelineno-12-67"></a><span class="c1"># +-- c</span>
-</span><span id="__span-12-68"><a id="__codelineno-12-68" name="__codelineno-12-68" href="#__codelineno-12-68"></a>
-</span><span id="__span-12-69"><a id="__codelineno-12-69" name="__codelineno-12-69" href="#__codelineno-12-69"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">style</span><span class="o">=</span><span class="s2">&quot;const&quot;</span><span class="p">)</span>
-</span></span><span id="__span-12-70"><a id="__codelineno-12-70" name="__codelineno-12-70" href="#__codelineno-12-70"></a><span class="c1"># a</span>
-</span><span id="__span-12-71"><a id="__codelineno-12-71" name="__codelineno-12-71" href="#__codelineno-12-71"></a><span class="c1"># ├── b</span>
-</span><span id="__span-12-72"><a id="__codelineno-12-72" name="__codelineno-12-72" href="#__codelineno-12-72"></a><span class="c1"># │   ├── d</span>
-</span><span id="__span-12-73"><a id="__codelineno-12-73" name="__codelineno-12-73" href="#__codelineno-12-73"></a><span class="c1"># │   └── e</span>
-</span><span id="__span-12-74"><a id="__codelineno-12-74" name="__codelineno-12-74" href="#__codelineno-12-74"></a><span class="c1"># └── c</span>
-</span><span id="__span-12-75"><a id="__codelineno-12-75" name="__codelineno-12-75" href="#__codelineno-12-75"></a>
-</span><span id="__span-12-76"><a id="__codelineno-12-76" name="__codelineno-12-76" href="#__codelineno-12-76"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">style</span><span class="o">=</span><span class="s2">&quot;const_bold&quot;</span><span class="p">)</span>
-</span></span><span id="__span-12-77"><a id="__codelineno-12-77" name="__codelineno-12-77" href="#__codelineno-12-77"></a><span class="c1"># a</span>
-</span><span id="__span-12-78"><a id="__codelineno-12-78" name="__codelineno-12-78" href="#__codelineno-12-78"></a><span class="c1"># ┣━━ b</span>
-</span><span id="__span-12-79"><a id="__codelineno-12-79" name="__codelineno-12-79" href="#__codelineno-12-79"></a><span class="c1"># ┃   ┣━━ d</span>
-</span><span id="__span-12-80"><a id="__codelineno-12-80" name="__codelineno-12-80" href="#__codelineno-12-80"></a><span class="c1"># ┃   ┗━━ e</span>
-</span><span id="__span-12-81"><a id="__codelineno-12-81" name="__codelineno-12-81" href="#__codelineno-12-81"></a><span class="c1"># ┗━━ c</span>
-</span><span id="__span-12-82"><a id="__codelineno-12-82" name="__codelineno-12-82" href="#__codelineno-12-82"></a>
-</span><span id="__span-12-83"><a id="__codelineno-12-83" name="__codelineno-12-83" href="#__codelineno-12-83"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">style</span><span class="o">=</span><span class="s2">&quot;rounded&quot;</span><span class="p">)</span>
-</span></span><span id="__span-12-84"><a id="__codelineno-12-84" name="__codelineno-12-84" href="#__codelineno-12-84"></a><span class="c1"># a</span>
-</span><span id="__span-12-85"><a id="__codelineno-12-85" name="__codelineno-12-85" href="#__codelineno-12-85"></a><span class="c1"># ├── b</span>
-</span><span id="__span-12-86"><a id="__codelineno-12-86" name="__codelineno-12-86" href="#__codelineno-12-86"></a><span class="c1"># │   ├── d</span>
-</span><span id="__span-12-87"><a id="__codelineno-12-87" name="__codelineno-12-87" href="#__codelineno-12-87"></a><span class="c1"># │   ╰── e</span>
-</span><span id="__span-12-88"><a id="__codelineno-12-88" name="__codelineno-12-88" href="#__codelineno-12-88"></a><span class="c1"># ╰── c</span>
-</span><span id="__span-12-89"><a id="__codelineno-12-89" name="__codelineno-12-89" href="#__codelineno-12-89"></a>
-</span><span id="__span-12-90"><a id="__codelineno-12-90" name="__codelineno-12-90" href="#__codelineno-12-90"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">style</span><span class="o">=</span><span class="s2">&quot;double&quot;</span><span class="p">)</span>
-</span></span><span id="__span-12-91"><a id="__codelineno-12-91" name="__codelineno-12-91" href="#__codelineno-12-91"></a><span class="c1"># a</span>
-</span><span id="__span-12-92"><a id="__codelineno-12-92" name="__codelineno-12-92" href="#__codelineno-12-92"></a><span class="c1"># ╠══ b</span>
-</span><span id="__span-12-93"><a id="__codelineno-12-93" name="__codelineno-12-93" href="#__codelineno-12-93"></a><span class="c1"># ║   ╠══ d</span>
-</span><span id="__span-12-94"><a id="__codelineno-12-94" name="__codelineno-12-94" href="#__codelineno-12-94"></a><span class="c1"># ║   ╚══ e</span>
-</span><span id="__span-12-95"><a id="__codelineno-12-95" name="__codelineno-12-95" href="#__codelineno-12-95"></a><span class="c1"># ╚══ c</span>
-</span><span id="__span-12-96"><a id="__codelineno-12-96" name="__codelineno-12-96" href="#__codelineno-12-96"></a>
-</span><span id="__span-12-97"><a id="__codelineno-12-97" name="__codelineno-12-97" href="#__codelineno-12-97"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span>
-</span></span><span id="__span-12-98"><a id="__codelineno-12-98" name="__codelineno-12-98" href="#__codelineno-12-98"></a><span class="hll">    <span class="n">root</span><span class="p">,</span>
-</span></span><span id="__span-12-99"><a id="__codelineno-12-99" name="__codelineno-12-99" href="#__codelineno-12-99"></a><span class="hll">    <span class="n">style</span><span class="o">=</span><span class="s2">&quot;custom&quot;</span><span class="p">,</span>
-</span></span><span id="__span-12-100"><a id="__codelineno-12-100" name="__codelineno-12-100" href="#__codelineno-12-100"></a><span class="hll">    <span class="n">custom_style</span><span class="o">=</span><span class="p">(</span><span class="s2">&quot;│  &quot;</span><span class="p">,</span> <span class="s2">&quot;├→ &quot;</span><span class="p">,</span> <span class="s2">&quot;╰→ &quot;</span><span class="p">),</span>
-</span></span><span id="__span-12-101"><a id="__codelineno-12-101" name="__codelineno-12-101" href="#__codelineno-12-101"></a><span class="hll"><span class="p">)</span>
-</span></span><span id="__span-12-102"><a id="__codelineno-12-102" name="__codelineno-12-102" href="#__codelineno-12-102"></a><span class="c1"># a</span>
-</span><span id="__span-12-103"><a id="__codelineno-12-103" name="__codelineno-12-103" href="#__codelineno-12-103"></a><span class="c1"># ├→ b</span>
-</span><span id="__span-12-104"><a id="__codelineno-12-104" name="__codelineno-12-104" href="#__codelineno-12-104"></a><span class="c1"># │  ├→ d</span>
-</span><span id="__span-12-105"><a id="__codelineno-12-105" name="__codelineno-12-105" href="#__codelineno-12-105"></a><span class="c1"># │  ╰→ e</span>
-</span><span id="__span-12-106"><a id="__codelineno-12-106" name="__codelineno-12-106" href="#__codelineno-12-106"></a><span class="c1"># ╰→ c</span>
+<div class="language-python highlight"><pre><span></span><code><span id="__span-14-1"><a id="__codelineno-14-1" name="__codelineno-14-1" href="#__codelineno-14-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">Node</span><span class="p">,</span> <span class="n">print_tree</span><span class="p">,</span> <span class="n">hprint_tree</span>
+</span><span id="__span-14-2"><a id="__codelineno-14-2" name="__codelineno-14-2" href="#__codelineno-14-2"></a>
+</span><span id="__span-14-3"><a id="__codelineno-14-3" name="__codelineno-14-3" href="#__codelineno-14-3"></a><span class="n">root</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">90</span><span class="p">,</span> <span class="n">gender</span><span class="o">=</span><span class="s2">&quot;F&quot;</span><span class="p">)</span>
+</span><span id="__span-14-4"><a id="__codelineno-14-4" name="__codelineno-14-4" href="#__codelineno-14-4"></a><span class="n">b</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">65</span><span class="p">,</span> <span class="n">gender</span><span class="o">=</span><span class="s2">&quot;M&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
+</span><span id="__span-14-5"><a id="__codelineno-14-5" name="__codelineno-14-5" href="#__codelineno-14-5"></a><span class="n">c</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">60</span><span class="p">,</span> <span class="n">gender</span><span class="o">=</span><span class="s2">&quot;M&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
+</span><span id="__span-14-6"><a id="__codelineno-14-6" name="__codelineno-14-6" href="#__codelineno-14-6"></a><span class="n">d</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;d&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">40</span><span class="p">,</span> <span class="n">gender</span><span class="o">=</span><span class="s2">&quot;F&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
+</span><span id="__span-14-7"><a id="__codelineno-14-7" name="__codelineno-14-7" href="#__codelineno-14-7"></a><span class="n">e</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;e&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">35</span><span class="p">,</span> <span class="n">gender</span><span class="o">=</span><span class="s2">&quot;M&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
+</span><span id="__span-14-8"><a id="__codelineno-14-8" name="__codelineno-14-8" href="#__codelineno-14-8"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">)</span> <span class="c1"># (1)!</span>
+</span></span><span id="__span-14-9"><a id="__codelineno-14-9" name="__codelineno-14-9" href="#__codelineno-14-9"></a><span class="c1"># a</span>
+</span><span id="__span-14-10"><a id="__codelineno-14-10" name="__codelineno-14-10" href="#__codelineno-14-10"></a><span class="c1"># ├── b</span>
+</span><span id="__span-14-11"><a id="__codelineno-14-11" name="__codelineno-14-11" href="#__codelineno-14-11"></a><span class="c1"># │   ├── d</span>
+</span><span id="__span-14-12"><a id="__codelineno-14-12" name="__codelineno-14-12" href="#__codelineno-14-12"></a><span class="c1"># │   └── e</span>
+</span><span id="__span-14-13"><a id="__codelineno-14-13" name="__codelineno-14-13" href="#__codelineno-14-13"></a><span class="c1"># └── c</span>
+</span><span id="__span-14-14"><a id="__codelineno-14-14" name="__codelineno-14-14" href="#__codelineno-14-14"></a>
+</span><span id="__span-14-15"><a id="__codelineno-14-15" name="__codelineno-14-15" href="#__codelineno-14-15"></a><span class="hll"><span class="n">hprint_tree</span><span class="p">(</span><span class="n">root</span><span class="p">)</span> <span class="c1"># (2)!</span>
+</span></span><span id="__span-14-16"><a id="__codelineno-14-16" name="__codelineno-14-16" href="#__codelineno-14-16"></a><span class="c1">#            ┌─ d</span>
+</span><span id="__span-14-17"><a id="__codelineno-14-17" name="__codelineno-14-17" href="#__codelineno-14-17"></a><span class="c1">#      ┌─ b ─┤</span>
+</span><span id="__span-14-18"><a id="__codelineno-14-18" name="__codelineno-14-18" href="#__codelineno-14-18"></a><span class="c1"># ─ a ─┤     └─ e</span>
+</span><span id="__span-14-19"><a id="__codelineno-14-19" name="__codelineno-14-19" href="#__codelineno-14-19"></a><span class="c1">#      └─ c</span>
+</span><span id="__span-14-20"><a id="__codelineno-14-20" name="__codelineno-14-20" href="#__codelineno-14-20"></a>
+</span><span id="__span-14-21"><a id="__codelineno-14-21" name="__codelineno-14-21" href="#__codelineno-14-21"></a><span class="c1"># Print subtree</span>
+</span><span id="__span-14-22"><a id="__codelineno-14-22" name="__codelineno-14-22" href="#__codelineno-14-22"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">node_name_or_path</span><span class="o">=</span><span class="s2">&quot;b&quot;</span><span class="p">)</span>
+</span></span><span id="__span-14-23"><a id="__codelineno-14-23" name="__codelineno-14-23" href="#__codelineno-14-23"></a><span class="c1"># b</span>
+</span><span id="__span-14-24"><a id="__codelineno-14-24" name="__codelineno-14-24" href="#__codelineno-14-24"></a><span class="c1"># ├── d</span>
+</span><span id="__span-14-25"><a id="__codelineno-14-25" name="__codelineno-14-25" href="#__codelineno-14-25"></a><span class="c1"># └── e</span>
+</span><span id="__span-14-26"><a id="__codelineno-14-26" name="__codelineno-14-26" href="#__codelineno-14-26"></a>
+</span><span id="__span-14-27"><a id="__codelineno-14-27" name="__codelineno-14-27" href="#__codelineno-14-27"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">max_depth</span><span class="o">=</span><span class="mi">2</span><span class="p">)</span>
+</span></span><span id="__span-14-28"><a id="__codelineno-14-28" name="__codelineno-14-28" href="#__codelineno-14-28"></a><span class="c1"># a</span>
+</span><span id="__span-14-29"><a id="__codelineno-14-29" name="__codelineno-14-29" href="#__codelineno-14-29"></a><span class="c1"># ├── b</span>
+</span><span id="__span-14-30"><a id="__codelineno-14-30" name="__codelineno-14-30" href="#__codelineno-14-30"></a><span class="c1"># └── c</span>
+</span><span id="__span-14-31"><a id="__codelineno-14-31" name="__codelineno-14-31" href="#__codelineno-14-31"></a>
+</span><span id="__span-14-32"><a id="__codelineno-14-32" name="__codelineno-14-32" href="#__codelineno-14-32"></a><span class="c1"># Print attributes</span>
+</span><span id="__span-14-33"><a id="__codelineno-14-33" name="__codelineno-14-33" href="#__codelineno-14-33"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;age&quot;</span><span class="p">])</span>
+</span></span><span id="__span-14-34"><a id="__codelineno-14-34" name="__codelineno-14-34" href="#__codelineno-14-34"></a><span class="c1"># a [age=90]</span>
+</span><span id="__span-14-35"><a id="__codelineno-14-35" name="__codelineno-14-35" href="#__codelineno-14-35"></a><span class="c1"># ├── b [age=65]</span>
+</span><span id="__span-14-36"><a id="__codelineno-14-36" name="__codelineno-14-36" href="#__codelineno-14-36"></a><span class="c1"># │   ├── d [age=40]</span>
+</span><span id="__span-14-37"><a id="__codelineno-14-37" name="__codelineno-14-37" href="#__codelineno-14-37"></a><span class="c1"># │   └── e [age=35]</span>
+</span><span id="__span-14-38"><a id="__codelineno-14-38" name="__codelineno-14-38" href="#__codelineno-14-38"></a><span class="c1"># └── c [age=60]</span>
+</span><span id="__span-14-39"><a id="__codelineno-14-39" name="__codelineno-14-39" href="#__codelineno-14-39"></a>
+</span><span id="__span-14-40"><a id="__codelineno-14-40" name="__codelineno-14-40" href="#__codelineno-14-40"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;age&quot;</span><span class="p">],</span> <span class="n">attr_bracket</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;*(&quot;</span><span class="p">,</span> <span class="s2">&quot;)&quot;</span><span class="p">])</span>
+</span></span><span id="__span-14-41"><a id="__codelineno-14-41" name="__codelineno-14-41" href="#__codelineno-14-41"></a><span class="c1"># a *(age=90)</span>
+</span><span id="__span-14-42"><a id="__codelineno-14-42" name="__codelineno-14-42" href="#__codelineno-14-42"></a><span class="c1"># ├── b *(age=65)</span>
+</span><span id="__span-14-43"><a id="__codelineno-14-43" name="__codelineno-14-43" href="#__codelineno-14-43"></a><span class="c1"># │   ├── d *(age=40)</span>
+</span><span id="__span-14-44"><a id="__codelineno-14-44" name="__codelineno-14-44" href="#__codelineno-14-44"></a><span class="c1"># │   └── e *(age=35)</span>
+</span><span id="__span-14-45"><a id="__codelineno-14-45" name="__codelineno-14-45" href="#__codelineno-14-45"></a><span class="c1"># └── c *(age=60)</span>
+</span><span id="__span-14-46"><a id="__codelineno-14-46" name="__codelineno-14-46" href="#__codelineno-14-46"></a>
+</span><span id="__span-14-47"><a id="__codelineno-14-47" name="__codelineno-14-47" href="#__codelineno-14-47"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">all_attrs</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
+</span></span><span id="__span-14-48"><a id="__codelineno-14-48" name="__codelineno-14-48" href="#__codelineno-14-48"></a><span class="c1"># a [age=90, gender=F]</span>
+</span><span id="__span-14-49"><a id="__codelineno-14-49" name="__codelineno-14-49" href="#__codelineno-14-49"></a><span class="c1"># ├── b [age=65, gender=M]</span>
+</span><span id="__span-14-50"><a id="__codelineno-14-50" name="__codelineno-14-50" href="#__codelineno-14-50"></a><span class="c1"># │   ├── d [age=40, gender=F]</span>
+</span><span id="__span-14-51"><a id="__codelineno-14-51" name="__codelineno-14-51" href="#__codelineno-14-51"></a><span class="c1"># │   └── e [age=35, gender=M]</span>
+</span><span id="__span-14-52"><a id="__codelineno-14-52" name="__codelineno-14-52" href="#__codelineno-14-52"></a><span class="c1"># └── c [age=60, gender=M]</span>
+</span><span id="__span-14-53"><a id="__codelineno-14-53" name="__codelineno-14-53" href="#__codelineno-14-53"></a>
+</span><span id="__span-14-54"><a id="__codelineno-14-54" name="__codelineno-14-54" href="#__codelineno-14-54"></a><span class="c1"># Available styles</span>
+</span><span id="__span-14-55"><a id="__codelineno-14-55" name="__codelineno-14-55" href="#__codelineno-14-55"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">style</span><span class="o">=</span><span class="s2">&quot;ansi&quot;</span><span class="p">)</span>
+</span></span><span id="__span-14-56"><a id="__codelineno-14-56" name="__codelineno-14-56" href="#__codelineno-14-56"></a><span class="c1"># a</span>
+</span><span id="__span-14-57"><a id="__codelineno-14-57" name="__codelineno-14-57" href="#__codelineno-14-57"></a><span class="c1"># |-- b</span>
+</span><span id="__span-14-58"><a id="__codelineno-14-58" name="__codelineno-14-58" href="#__codelineno-14-58"></a><span class="c1"># |   |-- d</span>
+</span><span id="__span-14-59"><a id="__codelineno-14-59" name="__codelineno-14-59" href="#__codelineno-14-59"></a><span class="c1"># |   `-- e</span>
+</span><span id="__span-14-60"><a id="__codelineno-14-60" name="__codelineno-14-60" href="#__codelineno-14-60"></a><span class="c1"># `-- c</span>
+</span><span id="__span-14-61"><a id="__codelineno-14-61" name="__codelineno-14-61" href="#__codelineno-14-61"></a>
+</span><span id="__span-14-62"><a id="__codelineno-14-62" name="__codelineno-14-62" href="#__codelineno-14-62"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">style</span><span class="o">=</span><span class="s2">&quot;ascii&quot;</span><span class="p">)</span>
+</span></span><span id="__span-14-63"><a id="__codelineno-14-63" name="__codelineno-14-63" href="#__codelineno-14-63"></a><span class="c1"># a</span>
+</span><span id="__span-14-64"><a id="__codelineno-14-64" name="__codelineno-14-64" href="#__codelineno-14-64"></a><span class="c1"># |-- b</span>
+</span><span id="__span-14-65"><a id="__codelineno-14-65" name="__codelineno-14-65" href="#__codelineno-14-65"></a><span class="c1"># |   |-- d</span>
+</span><span id="__span-14-66"><a id="__codelineno-14-66" name="__codelineno-14-66" href="#__codelineno-14-66"></a><span class="c1"># |   +-- e</span>
+</span><span id="__span-14-67"><a id="__codelineno-14-67" name="__codelineno-14-67" href="#__codelineno-14-67"></a><span class="c1"># +-- c</span>
+</span><span id="__span-14-68"><a id="__codelineno-14-68" name="__codelineno-14-68" href="#__codelineno-14-68"></a>
+</span><span id="__span-14-69"><a id="__codelineno-14-69" name="__codelineno-14-69" href="#__codelineno-14-69"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">style</span><span class="o">=</span><span class="s2">&quot;const&quot;</span><span class="p">)</span>
+</span></span><span id="__span-14-70"><a id="__codelineno-14-70" name="__codelineno-14-70" href="#__codelineno-14-70"></a><span class="c1"># a</span>
+</span><span id="__span-14-71"><a id="__codelineno-14-71" name="__codelineno-14-71" href="#__codelineno-14-71"></a><span class="c1"># ├── b</span>
+</span><span id="__span-14-72"><a id="__codelineno-14-72" name="__codelineno-14-72" href="#__codelineno-14-72"></a><span class="c1"># │   ├── d</span>
+</span><span id="__span-14-73"><a id="__codelineno-14-73" name="__codelineno-14-73" href="#__codelineno-14-73"></a><span class="c1"># │   └── e</span>
+</span><span id="__span-14-74"><a id="__codelineno-14-74" name="__codelineno-14-74" href="#__codelineno-14-74"></a><span class="c1"># └── c</span>
+</span><span id="__span-14-75"><a id="__codelineno-14-75" name="__codelineno-14-75" href="#__codelineno-14-75"></a>
+</span><span id="__span-14-76"><a id="__codelineno-14-76" name="__codelineno-14-76" href="#__codelineno-14-76"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">style</span><span class="o">=</span><span class="s2">&quot;const_bold&quot;</span><span class="p">)</span>
+</span></span><span id="__span-14-77"><a id="__codelineno-14-77" name="__codelineno-14-77" href="#__codelineno-14-77"></a><span class="c1"># a</span>
+</span><span id="__span-14-78"><a id="__codelineno-14-78" name="__codelineno-14-78" href="#__codelineno-14-78"></a><span class="c1"># ┣━━ b</span>
+</span><span id="__span-14-79"><a id="__codelineno-14-79" name="__codelineno-14-79" href="#__codelineno-14-79"></a><span class="c1"># ┃   ┣━━ d</span>
+</span><span id="__span-14-80"><a id="__codelineno-14-80" name="__codelineno-14-80" href="#__codelineno-14-80"></a><span class="c1"># ┃   ┗━━ e</span>
+</span><span id="__span-14-81"><a id="__codelineno-14-81" name="__codelineno-14-81" href="#__codelineno-14-81"></a><span class="c1"># ┗━━ c</span>
+</span><span id="__span-14-82"><a id="__codelineno-14-82" name="__codelineno-14-82" href="#__codelineno-14-82"></a>
+</span><span id="__span-14-83"><a id="__codelineno-14-83" name="__codelineno-14-83" href="#__codelineno-14-83"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">style</span><span class="o">=</span><span class="s2">&quot;rounded&quot;</span><span class="p">)</span>
+</span></span><span id="__span-14-84"><a id="__codelineno-14-84" name="__codelineno-14-84" href="#__codelineno-14-84"></a><span class="c1"># a</span>
+</span><span id="__span-14-85"><a id="__codelineno-14-85" name="__codelineno-14-85" href="#__codelineno-14-85"></a><span class="c1"># ├── b</span>
+</span><span id="__span-14-86"><a id="__codelineno-14-86" name="__codelineno-14-86" href="#__codelineno-14-86"></a><span class="c1"># │   ├── d</span>
+</span><span id="__span-14-87"><a id="__codelineno-14-87" name="__codelineno-14-87" href="#__codelineno-14-87"></a><span class="c1"># │   ╰── e</span>
+</span><span id="__span-14-88"><a id="__codelineno-14-88" name="__codelineno-14-88" href="#__codelineno-14-88"></a><span class="c1"># ╰── c</span>
+</span><span id="__span-14-89"><a id="__codelineno-14-89" name="__codelineno-14-89" href="#__codelineno-14-89"></a>
+</span><span id="__span-14-90"><a id="__codelineno-14-90" name="__codelineno-14-90" href="#__codelineno-14-90"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">style</span><span class="o">=</span><span class="s2">&quot;double&quot;</span><span class="p">)</span>
+</span></span><span id="__span-14-91"><a id="__codelineno-14-91" name="__codelineno-14-91" href="#__codelineno-14-91"></a><span class="c1"># a</span>
+</span><span id="__span-14-92"><a id="__codelineno-14-92" name="__codelineno-14-92" href="#__codelineno-14-92"></a><span class="c1"># ╠══ b</span>
+</span><span id="__span-14-93"><a id="__codelineno-14-93" name="__codelineno-14-93" href="#__codelineno-14-93"></a><span class="c1"># ║   ╠══ d</span>
+</span><span id="__span-14-94"><a id="__codelineno-14-94" name="__codelineno-14-94" href="#__codelineno-14-94"></a><span class="c1"># ║   ╚══ e</span>
+</span><span id="__span-14-95"><a id="__codelineno-14-95" name="__codelineno-14-95" href="#__codelineno-14-95"></a><span class="c1"># ╚══ c</span>
+</span><span id="__span-14-96"><a id="__codelineno-14-96" name="__codelineno-14-96" href="#__codelineno-14-96"></a>
+</span><span id="__span-14-97"><a id="__codelineno-14-97" name="__codelineno-14-97" href="#__codelineno-14-97"></a><span class="hll"><span class="n">print_tree</span><span class="p">(</span>
+</span></span><span id="__span-14-98"><a id="__codelineno-14-98" name="__codelineno-14-98" href="#__codelineno-14-98"></a><span class="hll">    <span class="n">root</span><span class="p">,</span>
+</span></span><span id="__span-14-99"><a id="__codelineno-14-99" name="__codelineno-14-99" href="#__codelineno-14-99"></a><span class="hll">    <span class="n">style</span><span class="o">=</span><span class="s2">&quot;custom&quot;</span><span class="p">,</span>
+</span></span><span id="__span-14-100"><a id="__codelineno-14-100" name="__codelineno-14-100" href="#__codelineno-14-100"></a><span class="hll">    <span class="n">custom_style</span><span class="o">=</span><span class="p">(</span><span class="s2">&quot;│  &quot;</span><span class="p">,</span> <span class="s2">&quot;├→ &quot;</span><span class="p">,</span> <span class="s2">&quot;╰→ &quot;</span><span class="p">),</span>
+</span></span><span id="__span-14-101"><a id="__codelineno-14-101" name="__codelineno-14-101" href="#__codelineno-14-101"></a><span class="hll"><span class="p">)</span>
+</span></span><span id="__span-14-102"><a id="__codelineno-14-102" name="__codelineno-14-102" href="#__codelineno-14-102"></a><span class="c1"># a</span>
+</span><span id="__span-14-103"><a id="__codelineno-14-103" name="__codelineno-14-103" href="#__codelineno-14-103"></a><span class="c1"># ├→ b</span>
+</span><span id="__span-14-104"><a id="__codelineno-14-104" name="__codelineno-14-104" href="#__codelineno-14-104"></a><span class="c1"># │  ├→ d</span>
+</span><span id="__span-14-105"><a id="__codelineno-14-105" name="__codelineno-14-105" href="#__codelineno-14-105"></a><span class="c1"># │  ╰→ e</span>
+</span><span id="__span-14-106"><a id="__codelineno-14-106" name="__codelineno-14-106" href="#__codelineno-14-106"></a><span class="c1"># ╰→ c</span>
 </span></code></pre></div>
 <ol>
 <li>Alternatively, <code>root.show()</code> can be used</li>
@@ -2968,25 +3011,25 @@ <h2 id="print-tree">Print Tree</h2>
 <h2 id="tree-attributes-and-operations">Tree Attributes and Operations</h2>
 <p>Note that using <code>BaseNode</code> or <code>Node</code> as superclass inherits the default class attributes (properties)
 and operations (methods).</p>
-<div class="language-python highlight"><pre><span></span><code><span id="__span-13-1"><a id="__codelineno-13-1" name="__codelineno-13-1" href="#__codelineno-13-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">str_to_tree</span>
-</span><span id="__span-13-2"><a id="__codelineno-13-2" name="__codelineno-13-2" href="#__codelineno-13-2"></a>
-</span><span id="__span-13-3"><a id="__codelineno-13-3" name="__codelineno-13-3" href="#__codelineno-13-3"></a><span class="c1"># Initialize tree</span>
-</span><span id="__span-13-4"><a id="__codelineno-13-4" name="__codelineno-13-4" href="#__codelineno-13-4"></a><span class="n">tree_str</span> <span class="o">=</span> <span class="s2">&quot;&quot;&quot;</span>
-</span><span id="__span-13-5"><a id="__codelineno-13-5" name="__codelineno-13-5" href="#__codelineno-13-5"></a><span class="s2">a</span>
-</span><span id="__span-13-6"><a id="__codelineno-13-6" name="__codelineno-13-6" href="#__codelineno-13-6"></a><span class="s2">├── b</span>
-</span><span id="__span-13-7"><a id="__codelineno-13-7" name="__codelineno-13-7" href="#__codelineno-13-7"></a><span class="s2">│   ├── d</span>
-</span><span id="__span-13-8"><a id="__codelineno-13-8" name="__codelineno-13-8" href="#__codelineno-13-8"></a><span class="s2">│   ├── e</span>
-</span><span id="__span-13-9"><a id="__codelineno-13-9" name="__codelineno-13-9" href="#__codelineno-13-9"></a><span class="s2">│   └── f</span>
-</span><span id="__span-13-10"><a id="__codelineno-13-10" name="__codelineno-13-10" href="#__codelineno-13-10"></a><span class="s2">│       ├── h</span>
-</span><span id="__span-13-11"><a id="__codelineno-13-11" name="__codelineno-13-11" href="#__codelineno-13-11"></a><span class="s2">│       └── i</span>
-</span><span id="__span-13-12"><a id="__codelineno-13-12" name="__codelineno-13-12" href="#__codelineno-13-12"></a><span class="s2">└── c</span>
-</span><span id="__span-13-13"><a id="__codelineno-13-13" name="__codelineno-13-13" href="#__codelineno-13-13"></a><span class="s2">    └── g</span>
-</span><span id="__span-13-14"><a id="__codelineno-13-14" name="__codelineno-13-14" href="#__codelineno-13-14"></a><span class="s2">&quot;&quot;&quot;</span>
-</span><span id="__span-13-15"><a id="__codelineno-13-15" name="__codelineno-13-15" href="#__codelineno-13-15"></a><span class="n">root</span> <span class="o">=</span> <span class="n">str_to_tree</span><span class="p">(</span><span class="n">tree_str</span><span class="p">)</span>
-</span><span id="__span-13-16"><a id="__codelineno-13-16" name="__codelineno-13-16" href="#__codelineno-13-16"></a>
-</span><span id="__span-13-17"><a id="__codelineno-13-17" name="__codelineno-13-17" href="#__codelineno-13-17"></a><span class="c1"># Accessing children</span>
-</span><span id="__span-13-18"><a id="__codelineno-13-18" name="__codelineno-13-18" href="#__codelineno-13-18"></a><span class="n">node_b</span> <span class="o">=</span> <span class="n">root</span><span class="p">[</span><span class="s2">&quot;b&quot;</span><span class="p">]</span>
-</span><span id="__span-13-19"><a id="__codelineno-13-19" name="__codelineno-13-19" href="#__codelineno-13-19"></a><span class="n">node_e</span> <span class="o">=</span> <span class="n">root</span><span class="p">[</span><span class="s2">&quot;b&quot;</span><span class="p">][</span><span class="s2">&quot;e&quot;</span><span class="p">]</span>
+<div class="language-python highlight"><pre><span></span><code><span id="__span-15-1"><a id="__codelineno-15-1" name="__codelineno-15-1" href="#__codelineno-15-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">str_to_tree</span>
+</span><span id="__span-15-2"><a id="__codelineno-15-2" name="__codelineno-15-2" href="#__codelineno-15-2"></a>
+</span><span id="__span-15-3"><a id="__codelineno-15-3" name="__codelineno-15-3" href="#__codelineno-15-3"></a><span class="c1"># Initialize tree</span>
+</span><span id="__span-15-4"><a id="__codelineno-15-4" name="__codelineno-15-4" href="#__codelineno-15-4"></a><span class="n">tree_str</span> <span class="o">=</span> <span class="s2">&quot;&quot;&quot;</span>
+</span><span id="__span-15-5"><a id="__codelineno-15-5" name="__codelineno-15-5" href="#__codelineno-15-5"></a><span class="s2">a</span>
+</span><span id="__span-15-6"><a id="__codelineno-15-6" name="__codelineno-15-6" href="#__codelineno-15-6"></a><span class="s2">├── b</span>
+</span><span id="__span-15-7"><a id="__codelineno-15-7" name="__codelineno-15-7" href="#__codelineno-15-7"></a><span class="s2">│   ├── d</span>
+</span><span id="__span-15-8"><a id="__codelineno-15-8" name="__codelineno-15-8" href="#__codelineno-15-8"></a><span class="s2">│   ├── e</span>
+</span><span id="__span-15-9"><a id="__codelineno-15-9" name="__codelineno-15-9" href="#__codelineno-15-9"></a><span class="s2">│   └── f</span>
+</span><span id="__span-15-10"><a id="__codelineno-15-10" name="__codelineno-15-10" href="#__codelineno-15-10"></a><span class="s2">│       ├── h</span>
+</span><span id="__span-15-11"><a id="__codelineno-15-11" name="__codelineno-15-11" href="#__codelineno-15-11"></a><span class="s2">│       └── i</span>
+</span><span id="__span-15-12"><a id="__codelineno-15-12" name="__codelineno-15-12" href="#__codelineno-15-12"></a><span class="s2">└── c</span>
+</span><span id="__span-15-13"><a id="__codelineno-15-13" name="__codelineno-15-13" href="#__codelineno-15-13"></a><span class="s2">    └── g</span>
+</span><span id="__span-15-14"><a id="__codelineno-15-14" name="__codelineno-15-14" href="#__codelineno-15-14"></a><span class="s2">&quot;&quot;&quot;</span>
+</span><span id="__span-15-15"><a id="__codelineno-15-15" name="__codelineno-15-15" href="#__codelineno-15-15"></a><span class="n">root</span> <span class="o">=</span> <span class="n">str_to_tree</span><span class="p">(</span><span class="n">tree_str</span><span class="p">)</span>
+</span><span id="__span-15-16"><a id="__codelineno-15-16" name="__codelineno-15-16" href="#__codelineno-15-16"></a>
+</span><span id="__span-15-17"><a id="__codelineno-15-17" name="__codelineno-15-17" href="#__codelineno-15-17"></a><span class="c1"># Accessing children</span>
+</span><span id="__span-15-18"><a id="__codelineno-15-18" name="__codelineno-15-18" href="#__codelineno-15-18"></a><span class="n">node_b</span> <span class="o">=</span> <span class="n">root</span><span class="p">[</span><span class="s2">&quot;b&quot;</span><span class="p">]</span>
+</span><span id="__span-15-19"><a id="__codelineno-15-19" name="__codelineno-15-19" href="#__codelineno-15-19"></a><span class="n">node_e</span> <span class="o">=</span> <span class="n">root</span><span class="p">[</span><span class="s2">&quot;b&quot;</span><span class="p">][</span><span class="s2">&quot;e&quot;</span><span class="p">]</span>
 </span></code></pre></div>
 <p>Below are the tables of attributes available to <code>BaseNode</code> and <code>Node</code> classes.</p>
 <table>
@@ -3160,123 +3203,123 @@ <h2 id="tree-attributes-and-operations">Tree Attributes and Operations</h2>
 </table>
 <h2 id="traverse-tree">Traverse Tree</h2>
 <p>Tree can be traversed using the following traversal methods.</p>
-<div class="language-python highlight"><pre><span></span><code><span id="__span-14-1"><a id="__codelineno-14-1" name="__codelineno-14-1" href="#__codelineno-14-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="p">(</span>
-</span><span id="__span-14-2"><a id="__codelineno-14-2" name="__codelineno-14-2" href="#__codelineno-14-2"></a>    <span class="n">Node</span><span class="p">,</span>
-</span><span id="__span-14-3"><a id="__codelineno-14-3" name="__codelineno-14-3" href="#__codelineno-14-3"></a>    <span class="n">levelorder_iter</span><span class="p">,</span>
-</span><span id="__span-14-4"><a id="__codelineno-14-4" name="__codelineno-14-4" href="#__codelineno-14-4"></a>    <span class="n">levelordergroup_iter</span><span class="p">,</span>
-</span><span id="__span-14-5"><a id="__codelineno-14-5" name="__codelineno-14-5" href="#__codelineno-14-5"></a>    <span class="n">postorder_iter</span><span class="p">,</span>
-</span><span id="__span-14-6"><a id="__codelineno-14-6" name="__codelineno-14-6" href="#__codelineno-14-6"></a>    <span class="n">preorder_iter</span><span class="p">,</span>
-</span><span id="__span-14-7"><a id="__codelineno-14-7" name="__codelineno-14-7" href="#__codelineno-14-7"></a>    <span class="n">zigzag_iter</span><span class="p">,</span>
-</span><span id="__span-14-8"><a id="__codelineno-14-8" name="__codelineno-14-8" href="#__codelineno-14-8"></a>    <span class="n">zigzaggroup_iter</span><span class="p">,</span>
-</span><span id="__span-14-9"><a id="__codelineno-14-9" name="__codelineno-14-9" href="#__codelineno-14-9"></a><span class="p">)</span>
-</span><span id="__span-14-10"><a id="__codelineno-14-10" name="__codelineno-14-10" href="#__codelineno-14-10"></a>
-</span><span id="__span-14-11"><a id="__codelineno-14-11" name="__codelineno-14-11" href="#__codelineno-14-11"></a><span class="n">root</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">)</span>
-</span><span id="__span-14-12"><a id="__codelineno-14-12" name="__codelineno-14-12" href="#__codelineno-14-12"></a><span class="n">b</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
-</span><span id="__span-14-13"><a id="__codelineno-14-13" name="__codelineno-14-13" href="#__codelineno-14-13"></a><span class="n">c</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
-</span><span id="__span-14-14"><a id="__codelineno-14-14" name="__codelineno-14-14" href="#__codelineno-14-14"></a><span class="n">d</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;d&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
-</span><span id="__span-14-15"><a id="__codelineno-14-15" name="__codelineno-14-15" href="#__codelineno-14-15"></a><span class="n">e</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;e&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
-</span><span id="__span-14-16"><a id="__codelineno-14-16" name="__codelineno-14-16" href="#__codelineno-14-16"></a><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
-</span><span id="__span-14-17"><a id="__codelineno-14-17" name="__codelineno-14-17" href="#__codelineno-14-17"></a><span class="c1"># a</span>
-</span><span id="__span-14-18"><a id="__codelineno-14-18" name="__codelineno-14-18" href="#__codelineno-14-18"></a><span class="c1"># ├── b</span>
-</span><span id="__span-14-19"><a id="__codelineno-14-19" name="__codelineno-14-19" href="#__codelineno-14-19"></a><span class="c1"># │   ├── d</span>
-</span><span id="__span-14-20"><a id="__codelineno-14-20" name="__codelineno-14-20" href="#__codelineno-14-20"></a><span class="c1"># │   └── e</span>
-</span><span id="__span-14-21"><a id="__codelineno-14-21" name="__codelineno-14-21" href="#__codelineno-14-21"></a><span class="c1"># └── c</span>
-</span><span id="__span-14-22"><a id="__codelineno-14-22" name="__codelineno-14-22" href="#__codelineno-14-22"></a>
-</span><span id="__span-14-23"><a id="__codelineno-14-23" name="__codelineno-14-23" href="#__codelineno-14-23"></a><span class="hll"><span class="p">[</span><span class="n">node</span><span class="o">.</span><span class="n">name</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">preorder_iter</span><span class="p">(</span><span class="n">root</span><span class="p">)]</span>
-</span></span><span id="__span-14-24"><a id="__codelineno-14-24" name="__codelineno-14-24" href="#__codelineno-14-24"></a><span class="c1"># [&#39;a&#39;, &#39;b&#39;, &#39;d&#39;, &#39;e&#39;, &#39;c&#39;]</span>
-</span><span id="__span-14-25"><a id="__codelineno-14-25" name="__codelineno-14-25" href="#__codelineno-14-25"></a>
-</span><span id="__span-14-26"><a id="__codelineno-14-26" name="__codelineno-14-26" href="#__codelineno-14-26"></a><span class="hll"><span class="p">[</span><span class="n">node</span><span class="o">.</span><span class="n">name</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">postorder_iter</span><span class="p">(</span><span class="n">root</span><span class="p">)]</span>
-</span></span><span id="__span-14-27"><a id="__codelineno-14-27" name="__codelineno-14-27" href="#__codelineno-14-27"></a><span class="c1"># [&#39;d&#39;, &#39;e&#39;, &#39;b&#39;, &#39;c&#39;, &#39;a&#39;]</span>
-</span><span id="__span-14-28"><a id="__codelineno-14-28" name="__codelineno-14-28" href="#__codelineno-14-28"></a>
-</span><span id="__span-14-29"><a id="__codelineno-14-29" name="__codelineno-14-29" href="#__codelineno-14-29"></a><span class="hll"><span class="p">[</span><span class="n">node</span><span class="o">.</span><span class="n">name</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">levelorder_iter</span><span class="p">(</span><span class="n">root</span><span class="p">)]</span>
-</span></span><span id="__span-14-30"><a id="__codelineno-14-30" name="__codelineno-14-30" href="#__codelineno-14-30"></a><span class="c1"># [&#39;a&#39;, &#39;b&#39;, &#39;c&#39;, &#39;d&#39;, &#39;e&#39;]</span>
-</span><span id="__span-14-31"><a id="__codelineno-14-31" name="__codelineno-14-31" href="#__codelineno-14-31"></a>
-</span><span id="__span-14-32"><a id="__codelineno-14-32" name="__codelineno-14-32" href="#__codelineno-14-32"></a><span class="hll"><span class="p">[[</span><span class="n">node</span><span class="o">.</span><span class="n">name</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">node_group</span><span class="p">]</span> <span class="k">for</span> <span class="n">node_group</span> <span class="ow">in</span> <span class="n">levelordergroup_iter</span><span class="p">(</span><span class="n">root</span><span class="p">)]</span>
-</span></span><span id="__span-14-33"><a id="__codelineno-14-33" name="__codelineno-14-33" href="#__codelineno-14-33"></a><span class="c1"># [[&#39;a&#39;], [&#39;b&#39;, &#39;c&#39;], [&#39;d&#39;, &#39;e&#39;]]</span>
-</span><span id="__span-14-34"><a id="__codelineno-14-34" name="__codelineno-14-34" href="#__codelineno-14-34"></a>
-</span><span id="__span-14-35"><a id="__codelineno-14-35" name="__codelineno-14-35" href="#__codelineno-14-35"></a><span class="hll"><span class="p">[</span><span class="n">node</span><span class="o">.</span><span class="n">name</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">zigzag_iter</span><span class="p">(</span><span class="n">root</span><span class="p">)]</span>
-</span></span><span id="__span-14-36"><a id="__codelineno-14-36" name="__codelineno-14-36" href="#__codelineno-14-36"></a><span class="c1"># [&#39;a&#39;, &#39;c&#39;, &#39;b&#39;, &#39;d&#39;, &#39;e&#39;]</span>
-</span><span id="__span-14-37"><a id="__codelineno-14-37" name="__codelineno-14-37" href="#__codelineno-14-37"></a>
-</span><span id="__span-14-38"><a id="__codelineno-14-38" name="__codelineno-14-38" href="#__codelineno-14-38"></a><span class="hll"><span class="p">[[</span><span class="n">node</span><span class="o">.</span><span class="n">name</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">node_group</span><span class="p">]</span> <span class="k">for</span> <span class="n">node_group</span> <span class="ow">in</span> <span class="n">zigzaggroup_iter</span><span class="p">(</span><span class="n">root</span><span class="p">)]</span>
-</span></span><span id="__span-14-39"><a id="__codelineno-14-39" name="__codelineno-14-39" href="#__codelineno-14-39"></a><span class="c1"># [[&#39;a&#39;], [&#39;c&#39;, &#39;b&#39;], [&#39;d&#39;, &#39;e&#39;]]</span>
+<div class="language-python highlight"><pre><span></span><code><span id="__span-16-1"><a id="__codelineno-16-1" name="__codelineno-16-1" href="#__codelineno-16-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="p">(</span>
+</span><span id="__span-16-2"><a id="__codelineno-16-2" name="__codelineno-16-2" href="#__codelineno-16-2"></a>    <span class="n">Node</span><span class="p">,</span>
+</span><span id="__span-16-3"><a id="__codelineno-16-3" name="__codelineno-16-3" href="#__codelineno-16-3"></a>    <span class="n">levelorder_iter</span><span class="p">,</span>
+</span><span id="__span-16-4"><a id="__codelineno-16-4" name="__codelineno-16-4" href="#__codelineno-16-4"></a>    <span class="n">levelordergroup_iter</span><span class="p">,</span>
+</span><span id="__span-16-5"><a id="__codelineno-16-5" name="__codelineno-16-5" href="#__codelineno-16-5"></a>    <span class="n">postorder_iter</span><span class="p">,</span>
+</span><span id="__span-16-6"><a id="__codelineno-16-6" name="__codelineno-16-6" href="#__codelineno-16-6"></a>    <span class="n">preorder_iter</span><span class="p">,</span>
+</span><span id="__span-16-7"><a id="__codelineno-16-7" name="__codelineno-16-7" href="#__codelineno-16-7"></a>    <span class="n">zigzag_iter</span><span class="p">,</span>
+</span><span id="__span-16-8"><a id="__codelineno-16-8" name="__codelineno-16-8" href="#__codelineno-16-8"></a>    <span class="n">zigzaggroup_iter</span><span class="p">,</span>
+</span><span id="__span-16-9"><a id="__codelineno-16-9" name="__codelineno-16-9" href="#__codelineno-16-9"></a><span class="p">)</span>
+</span><span id="__span-16-10"><a id="__codelineno-16-10" name="__codelineno-16-10" href="#__codelineno-16-10"></a>
+</span><span id="__span-16-11"><a id="__codelineno-16-11" name="__codelineno-16-11" href="#__codelineno-16-11"></a><span class="n">root</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">)</span>
+</span><span id="__span-16-12"><a id="__codelineno-16-12" name="__codelineno-16-12" href="#__codelineno-16-12"></a><span class="n">b</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
+</span><span id="__span-16-13"><a id="__codelineno-16-13" name="__codelineno-16-13" href="#__codelineno-16-13"></a><span class="n">c</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
+</span><span id="__span-16-14"><a id="__codelineno-16-14" name="__codelineno-16-14" href="#__codelineno-16-14"></a><span class="n">d</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;d&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
+</span><span id="__span-16-15"><a id="__codelineno-16-15" name="__codelineno-16-15" href="#__codelineno-16-15"></a><span class="n">e</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;e&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
+</span><span id="__span-16-16"><a id="__codelineno-16-16" name="__codelineno-16-16" href="#__codelineno-16-16"></a><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
+</span><span id="__span-16-17"><a id="__codelineno-16-17" name="__codelineno-16-17" href="#__codelineno-16-17"></a><span class="c1"># a</span>
+</span><span id="__span-16-18"><a id="__codelineno-16-18" name="__codelineno-16-18" href="#__codelineno-16-18"></a><span class="c1"># ├── b</span>
+</span><span id="__span-16-19"><a id="__codelineno-16-19" name="__codelineno-16-19" href="#__codelineno-16-19"></a><span class="c1"># │   ├── d</span>
+</span><span id="__span-16-20"><a id="__codelineno-16-20" name="__codelineno-16-20" href="#__codelineno-16-20"></a><span class="c1"># │   └── e</span>
+</span><span id="__span-16-21"><a id="__codelineno-16-21" name="__codelineno-16-21" href="#__codelineno-16-21"></a><span class="c1"># └── c</span>
+</span><span id="__span-16-22"><a id="__codelineno-16-22" name="__codelineno-16-22" href="#__codelineno-16-22"></a>
+</span><span id="__span-16-23"><a id="__codelineno-16-23" name="__codelineno-16-23" href="#__codelineno-16-23"></a><span class="hll"><span class="p">[</span><span class="n">node</span><span class="o">.</span><span class="n">name</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">preorder_iter</span><span class="p">(</span><span class="n">root</span><span class="p">)]</span>
+</span></span><span id="__span-16-24"><a id="__codelineno-16-24" name="__codelineno-16-24" href="#__codelineno-16-24"></a><span class="c1"># [&#39;a&#39;, &#39;b&#39;, &#39;d&#39;, &#39;e&#39;, &#39;c&#39;]</span>
+</span><span id="__span-16-25"><a id="__codelineno-16-25" name="__codelineno-16-25" href="#__codelineno-16-25"></a>
+</span><span id="__span-16-26"><a id="__codelineno-16-26" name="__codelineno-16-26" href="#__codelineno-16-26"></a><span class="hll"><span class="p">[</span><span class="n">node</span><span class="o">.</span><span class="n">name</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">postorder_iter</span><span class="p">(</span><span class="n">root</span><span class="p">)]</span>
+</span></span><span id="__span-16-27"><a id="__codelineno-16-27" name="__codelineno-16-27" href="#__codelineno-16-27"></a><span class="c1"># [&#39;d&#39;, &#39;e&#39;, &#39;b&#39;, &#39;c&#39;, &#39;a&#39;]</span>
+</span><span id="__span-16-28"><a id="__codelineno-16-28" name="__codelineno-16-28" href="#__codelineno-16-28"></a>
+</span><span id="__span-16-29"><a id="__codelineno-16-29" name="__codelineno-16-29" href="#__codelineno-16-29"></a><span class="hll"><span class="p">[</span><span class="n">node</span><span class="o">.</span><span class="n">name</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">levelorder_iter</span><span class="p">(</span><span class="n">root</span><span class="p">)]</span>
+</span></span><span id="__span-16-30"><a id="__codelineno-16-30" name="__codelineno-16-30" href="#__codelineno-16-30"></a><span class="c1"># [&#39;a&#39;, &#39;b&#39;, &#39;c&#39;, &#39;d&#39;, &#39;e&#39;]</span>
+</span><span id="__span-16-31"><a id="__codelineno-16-31" name="__codelineno-16-31" href="#__codelineno-16-31"></a>
+</span><span id="__span-16-32"><a id="__codelineno-16-32" name="__codelineno-16-32" href="#__codelineno-16-32"></a><span class="hll"><span class="p">[[</span><span class="n">node</span><span class="o">.</span><span class="n">name</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">node_group</span><span class="p">]</span> <span class="k">for</span> <span class="n">node_group</span> <span class="ow">in</span> <span class="n">levelordergroup_iter</span><span class="p">(</span><span class="n">root</span><span class="p">)]</span>
+</span></span><span id="__span-16-33"><a id="__codelineno-16-33" name="__codelineno-16-33" href="#__codelineno-16-33"></a><span class="c1"># [[&#39;a&#39;], [&#39;b&#39;, &#39;c&#39;], [&#39;d&#39;, &#39;e&#39;]]</span>
+</span><span id="__span-16-34"><a id="__codelineno-16-34" name="__codelineno-16-34" href="#__codelineno-16-34"></a>
+</span><span id="__span-16-35"><a id="__codelineno-16-35" name="__codelineno-16-35" href="#__codelineno-16-35"></a><span class="hll"><span class="p">[</span><span class="n">node</span><span class="o">.</span><span class="n">name</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">zigzag_iter</span><span class="p">(</span><span class="n">root</span><span class="p">)]</span>
+</span></span><span id="__span-16-36"><a id="__codelineno-16-36" name="__codelineno-16-36" href="#__codelineno-16-36"></a><span class="c1"># [&#39;a&#39;, &#39;c&#39;, &#39;b&#39;, &#39;d&#39;, &#39;e&#39;]</span>
+</span><span id="__span-16-37"><a id="__codelineno-16-37" name="__codelineno-16-37" href="#__codelineno-16-37"></a>
+</span><span id="__span-16-38"><a id="__codelineno-16-38" name="__codelineno-16-38" href="#__codelineno-16-38"></a><span class="hll"><span class="p">[[</span><span class="n">node</span><span class="o">.</span><span class="n">name</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">node_group</span><span class="p">]</span> <span class="k">for</span> <span class="n">node_group</span> <span class="ow">in</span> <span class="n">zigzaggroup_iter</span><span class="p">(</span><span class="n">root</span><span class="p">)]</span>
+</span></span><span id="__span-16-39"><a id="__codelineno-16-39" name="__codelineno-16-39" href="#__codelineno-16-39"></a><span class="c1"># [[&#39;a&#39;], [&#39;c&#39;, &#39;b&#39;], [&#39;d&#39;, &#39;e&#39;]]</span>
 </span></code></pre></div>
 <h2 id="modify-tree">Modify Tree</h2>
 <p>Nodes can be <mark>shifted</mark> (with or without replacement) or <mark>copied</mark> (without replacement)
 from one path to another, this changes the tree in-place.
 Nodes can also be copied (with or without replacement) <mark>between two different trees</mark>.</p>
-<div class="tabbed-set tabbed-alternate" data-tabs="6:1"><input checked="checked" id="__tabbed_6_1" name="__tabbed_6" type="radio" /><div class="tabbed-labels"><label for="__tabbed_6_1">Shift nodes</label></div>
+<div class="tabbed-set tabbed-alternate" data-tabs="7:1"><input checked="checked" id="__tabbed_7_1" name="__tabbed_7" type="radio" /><div class="tabbed-labels"><label for="__tabbed_7_1">Shift nodes</label></div>
 <div class="tabbed-content">
 <div class="tabbed-block"></div>
 </div>
 </div>
-<div class="language-python highlight"><pre><span></span><code><span id="__span-15-1"><a id="__codelineno-15-1" name="__codelineno-15-1" href="#__codelineno-15-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">list_to_tree</span><span class="p">,</span> <span class="n">shift_nodes</span><span class="p">,</span> <span class="n">shift_and_replace_nodes</span>
-</span><span id="__span-15-2"><a id="__codelineno-15-2" name="__codelineno-15-2" href="#__codelineno-15-2"></a>
-</span><span id="__span-15-3"><a id="__codelineno-15-3" name="__codelineno-15-3" href="#__codelineno-15-3"></a><span class="n">root</span> <span class="o">=</span> <span class="n">list_to_tree</span><span class="p">(</span>
-</span><span id="__span-15-4"><a id="__codelineno-15-4" name="__codelineno-15-4" href="#__codelineno-15-4"></a>    <span class="p">[</span><span class="s2">&quot;Downloads/Pictures&quot;</span><span class="p">,</span> <span class="s2">&quot;Downloads/photo1.jpg&quot;</span><span class="p">,</span> <span class="s2">&quot;Downloads/file1.doc&quot;</span><span class="p">]</span>
-</span><span id="__span-15-5"><a id="__codelineno-15-5" name="__codelineno-15-5" href="#__codelineno-15-5"></a><span class="p">)</span>
-</span><span id="__span-15-6"><a id="__codelineno-15-6" name="__codelineno-15-6" href="#__codelineno-15-6"></a><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
-</span><span id="__span-15-7"><a id="__codelineno-15-7" name="__codelineno-15-7" href="#__codelineno-15-7"></a><span class="c1"># Downloads</span>
-</span><span id="__span-15-8"><a id="__codelineno-15-8" name="__codelineno-15-8" href="#__codelineno-15-8"></a><span class="c1"># ├── Pictures</span>
-</span><span id="__span-15-9"><a id="__codelineno-15-9" name="__codelineno-15-9" href="#__codelineno-15-9"></a><span class="c1"># ├── photo1.jpg</span>
-</span><span id="__span-15-10"><a id="__codelineno-15-10" name="__codelineno-15-10" href="#__codelineno-15-10"></a><span class="c1"># └── file1.doc</span>
-</span><span id="__span-15-11"><a id="__codelineno-15-11" name="__codelineno-15-11" href="#__codelineno-15-11"></a>
-</span><span id="__span-15-12"><a id="__codelineno-15-12" name="__codelineno-15-12" href="#__codelineno-15-12"></a><span class="hll"><span class="n">shift_nodes</span><span class="p">(</span>
-</span></span><span id="__span-15-13"><a id="__codelineno-15-13" name="__codelineno-15-13" href="#__codelineno-15-13"></a><span class="hll">   <span class="n">tree</span><span class="o">=</span><span class="n">root</span><span class="p">,</span>
-</span></span><span id="__span-15-14"><a id="__codelineno-15-14" name="__codelineno-15-14" href="#__codelineno-15-14"></a><span class="hll">   <span class="n">from_paths</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;photo1.jpg&quot;</span><span class="p">,</span> <span class="s2">&quot;Downloads/file1.doc&quot;</span><span class="p">],</span>
-</span></span><span id="__span-15-15"><a id="__codelineno-15-15" name="__codelineno-15-15" href="#__codelineno-15-15"></a><span class="hll">   <span class="n">to_paths</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;Downloads/Pictures/photo1.jpg&quot;</span><span class="p">,</span> <span class="s2">&quot;Downloads/Files/file1.doc&quot;</span><span class="p">],</span>
-</span></span><span id="__span-15-16"><a id="__codelineno-15-16" name="__codelineno-15-16" href="#__codelineno-15-16"></a><span class="hll"><span class="p">)</span>
-</span></span><span id="__span-15-17"><a id="__codelineno-15-17" name="__codelineno-15-17" href="#__codelineno-15-17"></a><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
-</span><span id="__span-15-18"><a id="__codelineno-15-18" name="__codelineno-15-18" href="#__codelineno-15-18"></a><span class="c1"># Downloads</span>
-</span><span id="__span-15-19"><a id="__codelineno-15-19" name="__codelineno-15-19" href="#__codelineno-15-19"></a><span class="c1"># ├── Pictures</span>
-</span><span id="__span-15-20"><a id="__codelineno-15-20" name="__codelineno-15-20" href="#__codelineno-15-20"></a><span class="c1"># │   └── photo1.jpg (1)</span>
-</span><span id="__span-15-21"><a id="__codelineno-15-21" name="__codelineno-15-21" href="#__codelineno-15-21"></a><span class="c1"># └── Files</span>
-</span><span id="__span-15-22"><a id="__codelineno-15-22" name="__codelineno-15-22" href="#__codelineno-15-22"></a><span class="c1">#     └── file1.doc (2)</span>
-</span><span id="__span-15-23"><a id="__codelineno-15-23" name="__codelineno-15-23" href="#__codelineno-15-23"></a>
-</span><span id="__span-15-24"><a id="__codelineno-15-24" name="__codelineno-15-24" href="#__codelineno-15-24"></a><span class="hll"><span class="n">shift_and_replace_nodes</span><span class="p">(</span>
-</span></span><span id="__span-15-25"><a id="__codelineno-15-25" name="__codelineno-15-25" href="#__codelineno-15-25"></a><span class="hll">   <span class="n">tree</span><span class="o">=</span><span class="n">root</span><span class="p">,</span>
-</span></span><span id="__span-15-26"><a id="__codelineno-15-26" name="__codelineno-15-26" href="#__codelineno-15-26"></a><span class="hll">   <span class="n">from_paths</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;Downloads/Files&quot;</span><span class="p">],</span>
-</span></span><span id="__span-15-27"><a id="__codelineno-15-27" name="__codelineno-15-27" href="#__codelineno-15-27"></a><span class="hll">   <span class="n">to_paths</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;Downloads/Pictures/photo1.jpg&quot;</span><span class="p">],</span>
-</span></span><span id="__span-15-28"><a id="__codelineno-15-28" name="__codelineno-15-28" href="#__codelineno-15-28"></a><span class="hll"><span class="p">)</span>
-</span></span><span id="__span-15-29"><a id="__codelineno-15-29" name="__codelineno-15-29" href="#__codelineno-15-29"></a><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
-</span><span id="__span-15-30"><a id="__codelineno-15-30" name="__codelineno-15-30" href="#__codelineno-15-30"></a><span class="c1"># Downloads</span>
-</span><span id="__span-15-31"><a id="__codelineno-15-31" name="__codelineno-15-31" href="#__codelineno-15-31"></a><span class="c1"># └── Pictures</span>
-</span><span id="__span-15-32"><a id="__codelineno-15-32" name="__codelineno-15-32" href="#__codelineno-15-32"></a><span class="c1">#     └── Files (3)</span>
-</span><span id="__span-15-33"><a id="__codelineno-15-33" name="__codelineno-15-33" href="#__codelineno-15-33"></a><span class="c1">#         └── file1.doc</span>
+<div class="language-python highlight"><pre><span></span><code><span id="__span-17-1"><a id="__codelineno-17-1" name="__codelineno-17-1" href="#__codelineno-17-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">list_to_tree</span><span class="p">,</span> <span class="n">shift_nodes</span><span class="p">,</span> <span class="n">shift_and_replace_nodes</span>
+</span><span id="__span-17-2"><a id="__codelineno-17-2" name="__codelineno-17-2" href="#__codelineno-17-2"></a>
+</span><span id="__span-17-3"><a id="__codelineno-17-3" name="__codelineno-17-3" href="#__codelineno-17-3"></a><span class="n">root</span> <span class="o">=</span> <span class="n">list_to_tree</span><span class="p">(</span>
+</span><span id="__span-17-4"><a id="__codelineno-17-4" name="__codelineno-17-4" href="#__codelineno-17-4"></a>    <span class="p">[</span><span class="s2">&quot;Downloads/Pictures&quot;</span><span class="p">,</span> <span class="s2">&quot;Downloads/photo1.jpg&quot;</span><span class="p">,</span> <span class="s2">&quot;Downloads/file1.doc&quot;</span><span class="p">]</span>
+</span><span id="__span-17-5"><a id="__codelineno-17-5" name="__codelineno-17-5" href="#__codelineno-17-5"></a><span class="p">)</span>
+</span><span id="__span-17-6"><a id="__codelineno-17-6" name="__codelineno-17-6" href="#__codelineno-17-6"></a><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
+</span><span id="__span-17-7"><a id="__codelineno-17-7" name="__codelineno-17-7" href="#__codelineno-17-7"></a><span class="c1"># Downloads</span>
+</span><span id="__span-17-8"><a id="__codelineno-17-8" name="__codelineno-17-8" href="#__codelineno-17-8"></a><span class="c1"># ├── Pictures</span>
+</span><span id="__span-17-9"><a id="__codelineno-17-9" name="__codelineno-17-9" href="#__codelineno-17-9"></a><span class="c1"># ├── photo1.jpg</span>
+</span><span id="__span-17-10"><a id="__codelineno-17-10" name="__codelineno-17-10" href="#__codelineno-17-10"></a><span class="c1"># └── file1.doc</span>
+</span><span id="__span-17-11"><a id="__codelineno-17-11" name="__codelineno-17-11" href="#__codelineno-17-11"></a>
+</span><span id="__span-17-12"><a id="__codelineno-17-12" name="__codelineno-17-12" href="#__codelineno-17-12"></a><span class="hll"><span class="n">shift_nodes</span><span class="p">(</span>
+</span></span><span id="__span-17-13"><a id="__codelineno-17-13" name="__codelineno-17-13" href="#__codelineno-17-13"></a><span class="hll">   <span class="n">tree</span><span class="o">=</span><span class="n">root</span><span class="p">,</span>
+</span></span><span id="__span-17-14"><a id="__codelineno-17-14" name="__codelineno-17-14" href="#__codelineno-17-14"></a><span class="hll">   <span class="n">from_paths</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;photo1.jpg&quot;</span><span class="p">,</span> <span class="s2">&quot;Downloads/file1.doc&quot;</span><span class="p">],</span>
+</span></span><span id="__span-17-15"><a id="__codelineno-17-15" name="__codelineno-17-15" href="#__codelineno-17-15"></a><span class="hll">   <span class="n">to_paths</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;Downloads/Pictures/photo1.jpg&quot;</span><span class="p">,</span> <span class="s2">&quot;Downloads/Files/file1.doc&quot;</span><span class="p">],</span>
+</span></span><span id="__span-17-16"><a id="__codelineno-17-16" name="__codelineno-17-16" href="#__codelineno-17-16"></a><span class="hll"><span class="p">)</span>
+</span></span><span id="__span-17-17"><a id="__codelineno-17-17" name="__codelineno-17-17" href="#__codelineno-17-17"></a><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
+</span><span id="__span-17-18"><a id="__codelineno-17-18" name="__codelineno-17-18" href="#__codelineno-17-18"></a><span class="c1"># Downloads</span>
+</span><span id="__span-17-19"><a id="__codelineno-17-19" name="__codelineno-17-19" href="#__codelineno-17-19"></a><span class="c1"># ├── Pictures</span>
+</span><span id="__span-17-20"><a id="__codelineno-17-20" name="__codelineno-17-20" href="#__codelineno-17-20"></a><span class="c1"># │   └── photo1.jpg (1)</span>
+</span><span id="__span-17-21"><a id="__codelineno-17-21" name="__codelineno-17-21" href="#__codelineno-17-21"></a><span class="c1"># └── Files</span>
+</span><span id="__span-17-22"><a id="__codelineno-17-22" name="__codelineno-17-22" href="#__codelineno-17-22"></a><span class="c1">#     └── file1.doc (2)</span>
+</span><span id="__span-17-23"><a id="__codelineno-17-23" name="__codelineno-17-23" href="#__codelineno-17-23"></a>
+</span><span id="__span-17-24"><a id="__codelineno-17-24" name="__codelineno-17-24" href="#__codelineno-17-24"></a><span class="hll"><span class="n">shift_and_replace_nodes</span><span class="p">(</span>
+</span></span><span id="__span-17-25"><a id="__codelineno-17-25" name="__codelineno-17-25" href="#__codelineno-17-25"></a><span class="hll">   <span class="n">tree</span><span class="o">=</span><span class="n">root</span><span class="p">,</span>
+</span></span><span id="__span-17-26"><a id="__codelineno-17-26" name="__codelineno-17-26" href="#__codelineno-17-26"></a><span class="hll">   <span class="n">from_paths</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;Downloads/Files&quot;</span><span class="p">],</span>
+</span></span><span id="__span-17-27"><a id="__codelineno-17-27" name="__codelineno-17-27" href="#__codelineno-17-27"></a><span class="hll">   <span class="n">to_paths</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;Downloads/Pictures/photo1.jpg&quot;</span><span class="p">],</span>
+</span></span><span id="__span-17-28"><a id="__codelineno-17-28" name="__codelineno-17-28" href="#__codelineno-17-28"></a><span class="hll"><span class="p">)</span>
+</span></span><span id="__span-17-29"><a id="__codelineno-17-29" name="__codelineno-17-29" href="#__codelineno-17-29"></a><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
+</span><span id="__span-17-30"><a id="__codelineno-17-30" name="__codelineno-17-30" href="#__codelineno-17-30"></a><span class="c1"># Downloads</span>
+</span><span id="__span-17-31"><a id="__codelineno-17-31" name="__codelineno-17-31" href="#__codelineno-17-31"></a><span class="c1"># └── Pictures</span>
+</span><span id="__span-17-32"><a id="__codelineno-17-32" name="__codelineno-17-32" href="#__codelineno-17-32"></a><span class="c1">#     └── Files (3)</span>
+</span><span id="__span-17-33"><a id="__codelineno-17-33" name="__codelineno-17-33" href="#__codelineno-17-33"></a><span class="c1">#         └── file1.doc</span>
 </span></code></pre></div>
 <ol>
 <li>The first shift to destination <code>Downloads/Pictures/photo1.jpg</code></li>
 <li>The second shift to destination <code>Downloads/Files/file1.doc</code>, this creates intermediate Node <code>Files</code> as well</li>
 <li>Shift and replace <code>photo1.jpg</code> with <code>Files</code> folder</li>
 </ol>
-<div class="tabbed-set tabbed-alternate" data-tabs="7:1"><input checked="checked" id="__tabbed_7_1" name="__tabbed_7" type="radio" /><div class="tabbed-labels"><label for="__tabbed_7_1">Copy nodes</label></div>
+<div class="tabbed-set tabbed-alternate" data-tabs="8:1"><input checked="checked" id="__tabbed_8_1" name="__tabbed_8" type="radio" /><div class="tabbed-labels"><label for="__tabbed_8_1">Copy nodes</label></div>
 <div class="tabbed-content">
 <div class="tabbed-block"></div>
 </div>
 </div>
-<div class="language-python highlight"><pre><span></span><code><span id="__span-16-1"><a id="__codelineno-16-1" name="__codelineno-16-1" href="#__codelineno-16-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">list_to_tree</span><span class="p">,</span> <span class="n">copy_nodes</span>
-</span><span id="__span-16-2"><a id="__codelineno-16-2" name="__codelineno-16-2" href="#__codelineno-16-2"></a>
-</span><span id="__span-16-3"><a id="__codelineno-16-3" name="__codelineno-16-3" href="#__codelineno-16-3"></a><span class="n">root</span> <span class="o">=</span> <span class="n">list_to_tree</span><span class="p">(</span>
-</span><span id="__span-16-4"><a id="__codelineno-16-4" name="__codelineno-16-4" href="#__codelineno-16-4"></a>    <span class="p">[</span><span class="s2">&quot;Downloads/Pictures&quot;</span><span class="p">,</span> <span class="s2">&quot;Downloads/photo1.jpg&quot;</span><span class="p">,</span> <span class="s2">&quot;Downloads/file1.doc&quot;</span><span class="p">]</span>
-</span><span id="__span-16-5"><a id="__codelineno-16-5" name="__codelineno-16-5" href="#__codelineno-16-5"></a><span class="p">)</span>
-</span><span id="__span-16-6"><a id="__codelineno-16-6" name="__codelineno-16-6" href="#__codelineno-16-6"></a><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
-</span><span id="__span-16-7"><a id="__codelineno-16-7" name="__codelineno-16-7" href="#__codelineno-16-7"></a><span class="c1"># Downloads</span>
-</span><span id="__span-16-8"><a id="__codelineno-16-8" name="__codelineno-16-8" href="#__codelineno-16-8"></a><span class="c1"># ├── Pictures</span>
-</span><span id="__span-16-9"><a id="__codelineno-16-9" name="__codelineno-16-9" href="#__codelineno-16-9"></a><span class="c1"># ├── photo1.jpg</span>
-</span><span id="__span-16-10"><a id="__codelineno-16-10" name="__codelineno-16-10" href="#__codelineno-16-10"></a><span class="c1"># └── file1.doc</span>
-</span><span id="__span-16-11"><a id="__codelineno-16-11" name="__codelineno-16-11" href="#__codelineno-16-11"></a>
-</span><span id="__span-16-12"><a id="__codelineno-16-12" name="__codelineno-16-12" href="#__codelineno-16-12"></a><span class="hll"><span class="n">copy_nodes</span><span class="p">(</span>
-</span></span><span id="__span-16-13"><a id="__codelineno-16-13" name="__codelineno-16-13" href="#__codelineno-16-13"></a><span class="hll">   <span class="n">tree</span><span class="o">=</span><span class="n">root</span><span class="p">,</span>
-</span></span><span id="__span-16-14"><a id="__codelineno-16-14" name="__codelineno-16-14" href="#__codelineno-16-14"></a><span class="hll">   <span class="n">from_paths</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;photo1.jpg&quot;</span><span class="p">,</span> <span class="s2">&quot;Downloads/file1.doc&quot;</span><span class="p">],</span>
-</span></span><span id="__span-16-15"><a id="__codelineno-16-15" name="__codelineno-16-15" href="#__codelineno-16-15"></a><span class="hll">   <span class="n">to_paths</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;Downloads/Pictures/photo1.jpg&quot;</span><span class="p">,</span> <span class="s2">&quot;Downloads/Files/file1.doc&quot;</span><span class="p">],</span>
-</span></span><span id="__span-16-16"><a id="__codelineno-16-16" name="__codelineno-16-16" href="#__codelineno-16-16"></a><span class="hll"><span class="p">)</span>
-</span></span><span id="__span-16-17"><a id="__codelineno-16-17" name="__codelineno-16-17" href="#__codelineno-16-17"></a><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
-</span><span id="__span-16-18"><a id="__codelineno-16-18" name="__codelineno-16-18" href="#__codelineno-16-18"></a><span class="c1"># Downloads</span>
-</span><span id="__span-16-19"><a id="__codelineno-16-19" name="__codelineno-16-19" href="#__codelineno-16-19"></a><span class="c1"># ├── Pictures</span>
-</span><span id="__span-16-20"><a id="__codelineno-16-20" name="__codelineno-16-20" href="#__codelineno-16-20"></a><span class="c1"># │   └── photo1.jpg (1)</span>
-</span><span id="__span-16-21"><a id="__codelineno-16-21" name="__codelineno-16-21" href="#__codelineno-16-21"></a><span class="c1"># ├── photo1.jpg (2)</span>
-</span><span id="__span-16-22"><a id="__codelineno-16-22" name="__codelineno-16-22" href="#__codelineno-16-22"></a><span class="c1"># ├── file1.doc (4)</span>
-</span><span id="__span-16-23"><a id="__codelineno-16-23" name="__codelineno-16-23" href="#__codelineno-16-23"></a><span class="c1"># └── Files</span>
-</span><span id="__span-16-24"><a id="__codelineno-16-24" name="__codelineno-16-24" href="#__codelineno-16-24"></a><span class="c1">#     └── file1.doc (3)</span>
+<div class="language-python highlight"><pre><span></span><code><span id="__span-18-1"><a id="__codelineno-18-1" name="__codelineno-18-1" href="#__codelineno-18-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">list_to_tree</span><span class="p">,</span> <span class="n">copy_nodes</span>
+</span><span id="__span-18-2"><a id="__codelineno-18-2" name="__codelineno-18-2" href="#__codelineno-18-2"></a>
+</span><span id="__span-18-3"><a id="__codelineno-18-3" name="__codelineno-18-3" href="#__codelineno-18-3"></a><span class="n">root</span> <span class="o">=</span> <span class="n">list_to_tree</span><span class="p">(</span>
+</span><span id="__span-18-4"><a id="__codelineno-18-4" name="__codelineno-18-4" href="#__codelineno-18-4"></a>    <span class="p">[</span><span class="s2">&quot;Downloads/Pictures&quot;</span><span class="p">,</span> <span class="s2">&quot;Downloads/photo1.jpg&quot;</span><span class="p">,</span> <span class="s2">&quot;Downloads/file1.doc&quot;</span><span class="p">]</span>
+</span><span id="__span-18-5"><a id="__codelineno-18-5" name="__codelineno-18-5" href="#__codelineno-18-5"></a><span class="p">)</span>
+</span><span id="__span-18-6"><a id="__codelineno-18-6" name="__codelineno-18-6" href="#__codelineno-18-6"></a><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
+</span><span id="__span-18-7"><a id="__codelineno-18-7" name="__codelineno-18-7" href="#__codelineno-18-7"></a><span class="c1"># Downloads</span>
+</span><span id="__span-18-8"><a id="__codelineno-18-8" name="__codelineno-18-8" href="#__codelineno-18-8"></a><span class="c1"># ├── Pictures</span>
+</span><span id="__span-18-9"><a id="__codelineno-18-9" name="__codelineno-18-9" href="#__codelineno-18-9"></a><span class="c1"># ├── photo1.jpg</span>
+</span><span id="__span-18-10"><a id="__codelineno-18-10" name="__codelineno-18-10" href="#__codelineno-18-10"></a><span class="c1"># └── file1.doc</span>
+</span><span id="__span-18-11"><a id="__codelineno-18-11" name="__codelineno-18-11" href="#__codelineno-18-11"></a>
+</span><span id="__span-18-12"><a id="__codelineno-18-12" name="__codelineno-18-12" href="#__codelineno-18-12"></a><span class="hll"><span class="n">copy_nodes</span><span class="p">(</span>
+</span></span><span id="__span-18-13"><a id="__codelineno-18-13" name="__codelineno-18-13" href="#__codelineno-18-13"></a><span class="hll">   <span class="n">tree</span><span class="o">=</span><span class="n">root</span><span class="p">,</span>
+</span></span><span id="__span-18-14"><a id="__codelineno-18-14" name="__codelineno-18-14" href="#__codelineno-18-14"></a><span class="hll">   <span class="n">from_paths</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;photo1.jpg&quot;</span><span class="p">,</span> <span class="s2">&quot;Downloads/file1.doc&quot;</span><span class="p">],</span>
+</span></span><span id="__span-18-15"><a id="__codelineno-18-15" name="__codelineno-18-15" href="#__codelineno-18-15"></a><span class="hll">   <span class="n">to_paths</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;Downloads/Pictures/photo1.jpg&quot;</span><span class="p">,</span> <span class="s2">&quot;Downloads/Files/file1.doc&quot;</span><span class="p">],</span>
+</span></span><span id="__span-18-16"><a id="__codelineno-18-16" name="__codelineno-18-16" href="#__codelineno-18-16"></a><span class="hll"><span class="p">)</span>
+</span></span><span id="__span-18-17"><a id="__codelineno-18-17" name="__codelineno-18-17" href="#__codelineno-18-17"></a><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
+</span><span id="__span-18-18"><a id="__codelineno-18-18" name="__codelineno-18-18" href="#__codelineno-18-18"></a><span class="c1"># Downloads</span>
+</span><span id="__span-18-19"><a id="__codelineno-18-19" name="__codelineno-18-19" href="#__codelineno-18-19"></a><span class="c1"># ├── Pictures</span>
+</span><span id="__span-18-20"><a id="__codelineno-18-20" name="__codelineno-18-20" href="#__codelineno-18-20"></a><span class="c1"># │   └── photo1.jpg (1)</span>
+</span><span id="__span-18-21"><a id="__codelineno-18-21" name="__codelineno-18-21" href="#__codelineno-18-21"></a><span class="c1"># ├── photo1.jpg (2)</span>
+</span><span id="__span-18-22"><a id="__codelineno-18-22" name="__codelineno-18-22" href="#__codelineno-18-22"></a><span class="c1"># ├── file1.doc (4)</span>
+</span><span id="__span-18-23"><a id="__codelineno-18-23" name="__codelineno-18-23" href="#__codelineno-18-23"></a><span class="c1"># └── Files</span>
+</span><span id="__span-18-24"><a id="__codelineno-18-24" name="__codelineno-18-24" href="#__codelineno-18-24"></a><span class="c1">#     └── file1.doc (3)</span>
 </span></code></pre></div>
 <ol>
 <li>The first copy to destination <code>Downloads/Pictures/photo1.jpg</code></li>
@@ -3284,66 +3327,66 @@ <h2 id="modify-tree">Modify Tree</h2>
 <li>The second copy to destination <code>Downloads/Files/file1.doc</code>, this creates intermediate Node <code>Files</code> as well</li>
 <li>Original <code>file1.doc</code> still remains</li>
 </ol>
-<div class="tabbed-set tabbed-alternate" data-tabs="8:1"><input checked="checked" id="__tabbed_8_1" name="__tabbed_8" type="radio" /><div class="tabbed-labels"><label for="__tabbed_8_1">Copy nodes between two trees</label></div>
+<div class="tabbed-set tabbed-alternate" data-tabs="9:1"><input checked="checked" id="__tabbed_9_1" name="__tabbed_9" type="radio" /><div class="tabbed-labels"><label for="__tabbed_9_1">Copy nodes between two trees</label></div>
 <div class="tabbed-content">
 <div class="tabbed-block"></div>
 </div>
 </div>
-<div class="language-python highlight"><pre><span></span><code><span id="__span-17-1"><a id="__codelineno-17-1" name="__codelineno-17-1" href="#__codelineno-17-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="p">(</span>
-</span><span id="__span-17-2"><a id="__codelineno-17-2" name="__codelineno-17-2" href="#__codelineno-17-2"></a>    <span class="n">Node</span><span class="p">,</span>
-</span><span id="__span-17-3"><a id="__codelineno-17-3" name="__codelineno-17-3" href="#__codelineno-17-3"></a>    <span class="n">copy_nodes_from_tree_to_tree</span><span class="p">,</span>
-</span><span id="__span-17-4"><a id="__codelineno-17-4" name="__codelineno-17-4" href="#__codelineno-17-4"></a>    <span class="n">copy_and_replace_nodes_from_tree_to_tree</span><span class="p">,</span>
-</span><span id="__span-17-5"><a id="__codelineno-17-5" name="__codelineno-17-5" href="#__codelineno-17-5"></a>    <span class="n">list_to_tree</span><span class="p">,</span>
-</span><span id="__span-17-6"><a id="__codelineno-17-6" name="__codelineno-17-6" href="#__codelineno-17-6"></a><span class="p">)</span>
-</span><span id="__span-17-7"><a id="__codelineno-17-7" name="__codelineno-17-7" href="#__codelineno-17-7"></a>
-</span><span id="__span-17-8"><a id="__codelineno-17-8" name="__codelineno-17-8" href="#__codelineno-17-8"></a><span class="n">root</span> <span class="o">=</span> <span class="n">list_to_tree</span><span class="p">(</span>
-</span><span id="__span-17-9"><a id="__codelineno-17-9" name="__codelineno-17-9" href="#__codelineno-17-9"></a>    <span class="p">[</span><span class="s2">&quot;Downloads/Pictures&quot;</span><span class="p">,</span> <span class="s2">&quot;Downloads/photo1.jpg&quot;</span><span class="p">,</span> <span class="s2">&quot;Downloads/file1.doc&quot;</span><span class="p">]</span>
-</span><span id="__span-17-10"><a id="__codelineno-17-10" name="__codelineno-17-10" href="#__codelineno-17-10"></a><span class="p">)</span>
-</span><span id="__span-17-11"><a id="__codelineno-17-11" name="__codelineno-17-11" href="#__codelineno-17-11"></a><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
-</span><span id="__span-17-12"><a id="__codelineno-17-12" name="__codelineno-17-12" href="#__codelineno-17-12"></a><span class="c1"># Downloads</span>
-</span><span id="__span-17-13"><a id="__codelineno-17-13" name="__codelineno-17-13" href="#__codelineno-17-13"></a><span class="c1"># ├── Pictures</span>
-</span><span id="__span-17-14"><a id="__codelineno-17-14" name="__codelineno-17-14" href="#__codelineno-17-14"></a><span class="c1"># ├── photo1.jpg</span>
-</span><span id="__span-17-15"><a id="__codelineno-17-15" name="__codelineno-17-15" href="#__codelineno-17-15"></a><span class="c1"># └── file1.doc</span>
-</span><span id="__span-17-16"><a id="__codelineno-17-16" name="__codelineno-17-16" href="#__codelineno-17-16"></a>
-</span><span id="__span-17-17"><a id="__codelineno-17-17" name="__codelineno-17-17" href="#__codelineno-17-17"></a><span class="n">root_other</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;Documents&quot;</span><span class="p">)</span>
-</span><span id="__span-17-18"><a id="__codelineno-17-18" name="__codelineno-17-18" href="#__codelineno-17-18"></a><span class="hll"><span class="n">copy_nodes_from_tree_to_tree</span><span class="p">(</span>
-</span></span><span id="__span-17-19"><a id="__codelineno-17-19" name="__codelineno-17-19" href="#__codelineno-17-19"></a><span class="hll">    <span class="n">from_tree</span><span class="o">=</span><span class="n">root</span><span class="p">,</span>
-</span></span><span id="__span-17-20"><a id="__codelineno-17-20" name="__codelineno-17-20" href="#__codelineno-17-20"></a><span class="hll">    <span class="n">to_tree</span><span class="o">=</span><span class="n">root_other</span><span class="p">,</span>
-</span></span><span id="__span-17-21"><a id="__codelineno-17-21" name="__codelineno-17-21" href="#__codelineno-17-21"></a><span class="hll">    <span class="n">from_paths</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;Downloads/Pictures&quot;</span><span class="p">,</span> <span class="s2">&quot;photo1.jpg&quot;</span><span class="p">,</span> <span class="s2">&quot;file1.doc&quot;</span><span class="p">],</span>
-</span></span><span id="__span-17-22"><a id="__codelineno-17-22" name="__codelineno-17-22" href="#__codelineno-17-22"></a><span class="hll">    <span class="n">to_paths</span><span class="o">=</span><span class="p">[</span>
-</span></span><span id="__span-17-23"><a id="__codelineno-17-23" name="__codelineno-17-23" href="#__codelineno-17-23"></a><span class="hll">        <span class="s2">&quot;Documents/Pictures&quot;</span><span class="p">,</span>
-</span></span><span id="__span-17-24"><a id="__codelineno-17-24" name="__codelineno-17-24" href="#__codelineno-17-24"></a><span class="hll">        <span class="s2">&quot;Documents/Pictures/photo1.jpg&quot;</span><span class="p">,</span>
-</span></span><span id="__span-17-25"><a id="__codelineno-17-25" name="__codelineno-17-25" href="#__codelineno-17-25"></a><span class="hll">        <span class="s2">&quot;Documents/Files/file1.doc&quot;</span><span class="p">,</span>
-</span></span><span id="__span-17-26"><a id="__codelineno-17-26" name="__codelineno-17-26" href="#__codelineno-17-26"></a><span class="hll">    <span class="p">],</span>
-</span></span><span id="__span-17-27"><a id="__codelineno-17-27" name="__codelineno-17-27" href="#__codelineno-17-27"></a><span class="hll"><span class="p">)</span>
-</span></span><span id="__span-17-28"><a id="__codelineno-17-28" name="__codelineno-17-28" href="#__codelineno-17-28"></a><span class="n">root_other</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
-</span><span id="__span-17-29"><a id="__codelineno-17-29" name="__codelineno-17-29" href="#__codelineno-17-29"></a><span class="c1"># Documents</span>
-</span><span id="__span-17-30"><a id="__codelineno-17-30" name="__codelineno-17-30" href="#__codelineno-17-30"></a><span class="c1"># ├── Pictures (1)</span>
-</span><span id="__span-17-31"><a id="__codelineno-17-31" name="__codelineno-17-31" href="#__codelineno-17-31"></a><span class="c1"># │   └── photo1.jpg (2)</span>
-</span><span id="__span-17-32"><a id="__codelineno-17-32" name="__codelineno-17-32" href="#__codelineno-17-32"></a><span class="c1"># └── Files</span>
-</span><span id="__span-17-33"><a id="__codelineno-17-33" name="__codelineno-17-33" href="#__codelineno-17-33"></a><span class="c1">#     └── file1.doc (3)</span>
-</span><span id="__span-17-34"><a id="__codelineno-17-34" name="__codelineno-17-34" href="#__codelineno-17-34"></a>
-</span><span id="__span-17-35"><a id="__codelineno-17-35" name="__codelineno-17-35" href="#__codelineno-17-35"></a><span class="n">root_other</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;Documents&quot;</span><span class="p">)</span>
-</span><span id="__span-17-36"><a id="__codelineno-17-36" name="__codelineno-17-36" href="#__codelineno-17-36"></a><span class="n">picture_folder</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;Pictures&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root_other</span><span class="p">)</span>
-</span><span id="__span-17-37"><a id="__codelineno-17-37" name="__codelineno-17-37" href="#__codelineno-17-37"></a><span class="n">photo2</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;photo2.jpg&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">picture_folder</span><span class="p">)</span>
-</span><span id="__span-17-38"><a id="__codelineno-17-38" name="__codelineno-17-38" href="#__codelineno-17-38"></a><span class="n">file2</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;file2.doc&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root_other</span><span class="p">)</span>
-</span><span id="__span-17-39"><a id="__codelineno-17-39" name="__codelineno-17-39" href="#__codelineno-17-39"></a><span class="n">root_other</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
-</span><span id="__span-17-40"><a id="__codelineno-17-40" name="__codelineno-17-40" href="#__codelineno-17-40"></a><span class="c1"># Documents</span>
-</span><span id="__span-17-41"><a id="__codelineno-17-41" name="__codelineno-17-41" href="#__codelineno-17-41"></a><span class="c1"># ├── Pictures</span>
-</span><span id="__span-17-42"><a id="__codelineno-17-42" name="__codelineno-17-42" href="#__codelineno-17-42"></a><span class="c1"># │   └── photo2.jpg</span>
-</span><span id="__span-17-43"><a id="__codelineno-17-43" name="__codelineno-17-43" href="#__codelineno-17-43"></a><span class="c1"># └── file2.doc</span>
-</span><span id="__span-17-44"><a id="__codelineno-17-44" name="__codelineno-17-44" href="#__codelineno-17-44"></a>
-</span><span id="__span-17-45"><a id="__codelineno-17-45" name="__codelineno-17-45" href="#__codelineno-17-45"></a><span class="hll"><span class="n">copy_and_replace_nodes_from_tree_to_tree</span><span class="p">(</span>
-</span></span><span id="__span-17-46"><a id="__codelineno-17-46" name="__codelineno-17-46" href="#__codelineno-17-46"></a><span class="hll">    <span class="n">from_tree</span><span class="o">=</span><span class="n">root</span><span class="p">,</span>
-</span></span><span id="__span-17-47"><a id="__codelineno-17-47" name="__codelineno-17-47" href="#__codelineno-17-47"></a><span class="hll">    <span class="n">to_tree</span><span class="o">=</span><span class="n">root_other</span><span class="p">,</span>
-</span></span><span id="__span-17-48"><a id="__codelineno-17-48" name="__codelineno-17-48" href="#__codelineno-17-48"></a><span class="hll">    <span class="n">from_paths</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;Downloads/photo1.jpg&quot;</span><span class="p">,</span> <span class="s2">&quot;Downloads/file1.doc&quot;</span><span class="p">],</span>
-</span></span><span id="__span-17-49"><a id="__codelineno-17-49" name="__codelineno-17-49" href="#__codelineno-17-49"></a><span class="hll">    <span class="n">to_paths</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;Documents/Pictures/photo2.jpg&quot;</span><span class="p">,</span> <span class="s2">&quot;Documents/file2.doc&quot;</span><span class="p">],</span>
-</span></span><span id="__span-17-50"><a id="__codelineno-17-50" name="__codelineno-17-50" href="#__codelineno-17-50"></a><span class="hll"><span class="p">)</span>
-</span></span><span id="__span-17-51"><a id="__codelineno-17-51" name="__codelineno-17-51" href="#__codelineno-17-51"></a><span class="n">root_other</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
-</span><span id="__span-17-52"><a id="__codelineno-17-52" name="__codelineno-17-52" href="#__codelineno-17-52"></a><span class="c1"># Documents</span>
-</span><span id="__span-17-53"><a id="__codelineno-17-53" name="__codelineno-17-53" href="#__codelineno-17-53"></a><span class="c1"># ├── Pictures</span>
-</span><span id="__span-17-54"><a id="__codelineno-17-54" name="__codelineno-17-54" href="#__codelineno-17-54"></a><span class="c1"># │   └── photo1.jpg (4)</span>
-</span><span id="__span-17-55"><a id="__codelineno-17-55" name="__codelineno-17-55" href="#__codelineno-17-55"></a><span class="c1"># └── file1.doc (5)</span>
+<div class="language-python highlight"><pre><span></span><code><span id="__span-19-1"><a id="__codelineno-19-1" name="__codelineno-19-1" href="#__codelineno-19-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="p">(</span>
+</span><span id="__span-19-2"><a id="__codelineno-19-2" name="__codelineno-19-2" href="#__codelineno-19-2"></a>    <span class="n">Node</span><span class="p">,</span>
+</span><span id="__span-19-3"><a id="__codelineno-19-3" name="__codelineno-19-3" href="#__codelineno-19-3"></a>    <span class="n">copy_nodes_from_tree_to_tree</span><span class="p">,</span>
+</span><span id="__span-19-4"><a id="__codelineno-19-4" name="__codelineno-19-4" href="#__codelineno-19-4"></a>    <span class="n">copy_and_replace_nodes_from_tree_to_tree</span><span class="p">,</span>
+</span><span id="__span-19-5"><a id="__codelineno-19-5" name="__codelineno-19-5" href="#__codelineno-19-5"></a>    <span class="n">list_to_tree</span><span class="p">,</span>
+</span><span id="__span-19-6"><a id="__codelineno-19-6" name="__codelineno-19-6" href="#__codelineno-19-6"></a><span class="p">)</span>
+</span><span id="__span-19-7"><a id="__codelineno-19-7" name="__codelineno-19-7" href="#__codelineno-19-7"></a>
+</span><span id="__span-19-8"><a id="__codelineno-19-8" name="__codelineno-19-8" href="#__codelineno-19-8"></a><span class="n">root</span> <span class="o">=</span> <span class="n">list_to_tree</span><span class="p">(</span>
+</span><span id="__span-19-9"><a id="__codelineno-19-9" name="__codelineno-19-9" href="#__codelineno-19-9"></a>    <span class="p">[</span><span class="s2">&quot;Downloads/Pictures&quot;</span><span class="p">,</span> <span class="s2">&quot;Downloads/photo1.jpg&quot;</span><span class="p">,</span> <span class="s2">&quot;Downloads/file1.doc&quot;</span><span class="p">]</span>
+</span><span id="__span-19-10"><a id="__codelineno-19-10" name="__codelineno-19-10" href="#__codelineno-19-10"></a><span class="p">)</span>
+</span><span id="__span-19-11"><a id="__codelineno-19-11" name="__codelineno-19-11" href="#__codelineno-19-11"></a><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
+</span><span id="__span-19-12"><a id="__codelineno-19-12" name="__codelineno-19-12" href="#__codelineno-19-12"></a><span class="c1"># Downloads</span>
+</span><span id="__span-19-13"><a id="__codelineno-19-13" name="__codelineno-19-13" href="#__codelineno-19-13"></a><span class="c1"># ├── Pictures</span>
+</span><span id="__span-19-14"><a id="__codelineno-19-14" name="__codelineno-19-14" href="#__codelineno-19-14"></a><span class="c1"># ├── photo1.jpg</span>
+</span><span id="__span-19-15"><a id="__codelineno-19-15" name="__codelineno-19-15" href="#__codelineno-19-15"></a><span class="c1"># └── file1.doc</span>
+</span><span id="__span-19-16"><a id="__codelineno-19-16" name="__codelineno-19-16" href="#__codelineno-19-16"></a>
+</span><span id="__span-19-17"><a id="__codelineno-19-17" name="__codelineno-19-17" href="#__codelineno-19-17"></a><span class="n">root_other</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;Documents&quot;</span><span class="p">)</span>
+</span><span id="__span-19-18"><a id="__codelineno-19-18" name="__codelineno-19-18" href="#__codelineno-19-18"></a><span class="hll"><span class="n">copy_nodes_from_tree_to_tree</span><span class="p">(</span>
+</span></span><span id="__span-19-19"><a id="__codelineno-19-19" name="__codelineno-19-19" href="#__codelineno-19-19"></a><span class="hll">    <span class="n">from_tree</span><span class="o">=</span><span class="n">root</span><span class="p">,</span>
+</span></span><span id="__span-19-20"><a id="__codelineno-19-20" name="__codelineno-19-20" href="#__codelineno-19-20"></a><span class="hll">    <span class="n">to_tree</span><span class="o">=</span><span class="n">root_other</span><span class="p">,</span>
+</span></span><span id="__span-19-21"><a id="__codelineno-19-21" name="__codelineno-19-21" href="#__codelineno-19-21"></a><span class="hll">    <span class="n">from_paths</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;Downloads/Pictures&quot;</span><span class="p">,</span> <span class="s2">&quot;photo1.jpg&quot;</span><span class="p">,</span> <span class="s2">&quot;file1.doc&quot;</span><span class="p">],</span>
+</span></span><span id="__span-19-22"><a id="__codelineno-19-22" name="__codelineno-19-22" href="#__codelineno-19-22"></a><span class="hll">    <span class="n">to_paths</span><span class="o">=</span><span class="p">[</span>
+</span></span><span id="__span-19-23"><a id="__codelineno-19-23" name="__codelineno-19-23" href="#__codelineno-19-23"></a><span class="hll">        <span class="s2">&quot;Documents/Pictures&quot;</span><span class="p">,</span>
+</span></span><span id="__span-19-24"><a id="__codelineno-19-24" name="__codelineno-19-24" href="#__codelineno-19-24"></a><span class="hll">        <span class="s2">&quot;Documents/Pictures/photo1.jpg&quot;</span><span class="p">,</span>
+</span></span><span id="__span-19-25"><a id="__codelineno-19-25" name="__codelineno-19-25" href="#__codelineno-19-25"></a><span class="hll">        <span class="s2">&quot;Documents/Files/file1.doc&quot;</span><span class="p">,</span>
+</span></span><span id="__span-19-26"><a id="__codelineno-19-26" name="__codelineno-19-26" href="#__codelineno-19-26"></a><span class="hll">    <span class="p">],</span>
+</span></span><span id="__span-19-27"><a id="__codelineno-19-27" name="__codelineno-19-27" href="#__codelineno-19-27"></a><span class="hll"><span class="p">)</span>
+</span></span><span id="__span-19-28"><a id="__codelineno-19-28" name="__codelineno-19-28" href="#__codelineno-19-28"></a><span class="n">root_other</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
+</span><span id="__span-19-29"><a id="__codelineno-19-29" name="__codelineno-19-29" href="#__codelineno-19-29"></a><span class="c1"># Documents</span>
+</span><span id="__span-19-30"><a id="__codelineno-19-30" name="__codelineno-19-30" href="#__codelineno-19-30"></a><span class="c1"># ├── Pictures (1)</span>
+</span><span id="__span-19-31"><a id="__codelineno-19-31" name="__codelineno-19-31" href="#__codelineno-19-31"></a><span class="c1"># │   └── photo1.jpg (2)</span>
+</span><span id="__span-19-32"><a id="__codelineno-19-32" name="__codelineno-19-32" href="#__codelineno-19-32"></a><span class="c1"># └── Files</span>
+</span><span id="__span-19-33"><a id="__codelineno-19-33" name="__codelineno-19-33" href="#__codelineno-19-33"></a><span class="c1">#     └── file1.doc (3)</span>
+</span><span id="__span-19-34"><a id="__codelineno-19-34" name="__codelineno-19-34" href="#__codelineno-19-34"></a>
+</span><span id="__span-19-35"><a id="__codelineno-19-35" name="__codelineno-19-35" href="#__codelineno-19-35"></a><span class="n">root_other</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;Documents&quot;</span><span class="p">)</span>
+</span><span id="__span-19-36"><a id="__codelineno-19-36" name="__codelineno-19-36" href="#__codelineno-19-36"></a><span class="n">picture_folder</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;Pictures&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root_other</span><span class="p">)</span>
+</span><span id="__span-19-37"><a id="__codelineno-19-37" name="__codelineno-19-37" href="#__codelineno-19-37"></a><span class="n">photo2</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;photo2.jpg&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">picture_folder</span><span class="p">)</span>
+</span><span id="__span-19-38"><a id="__codelineno-19-38" name="__codelineno-19-38" href="#__codelineno-19-38"></a><span class="n">file2</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;file2.doc&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root_other</span><span class="p">)</span>
+</span><span id="__span-19-39"><a id="__codelineno-19-39" name="__codelineno-19-39" href="#__codelineno-19-39"></a><span class="n">root_other</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
+</span><span id="__span-19-40"><a id="__codelineno-19-40" name="__codelineno-19-40" href="#__codelineno-19-40"></a><span class="c1"># Documents</span>
+</span><span id="__span-19-41"><a id="__codelineno-19-41" name="__codelineno-19-41" href="#__codelineno-19-41"></a><span class="c1"># ├── Pictures</span>
+</span><span id="__span-19-42"><a id="__codelineno-19-42" name="__codelineno-19-42" href="#__codelineno-19-42"></a><span class="c1"># │   └── photo2.jpg</span>
+</span><span id="__span-19-43"><a id="__codelineno-19-43" name="__codelineno-19-43" href="#__codelineno-19-43"></a><span class="c1"># └── file2.doc</span>
+</span><span id="__span-19-44"><a id="__codelineno-19-44" name="__codelineno-19-44" href="#__codelineno-19-44"></a>
+</span><span id="__span-19-45"><a id="__codelineno-19-45" name="__codelineno-19-45" href="#__codelineno-19-45"></a><span class="hll"><span class="n">copy_and_replace_nodes_from_tree_to_tree</span><span class="p">(</span>
+</span></span><span id="__span-19-46"><a id="__codelineno-19-46" name="__codelineno-19-46" href="#__codelineno-19-46"></a><span class="hll">    <span class="n">from_tree</span><span class="o">=</span><span class="n">root</span><span class="p">,</span>
+</span></span><span id="__span-19-47"><a id="__codelineno-19-47" name="__codelineno-19-47" href="#__codelineno-19-47"></a><span class="hll">    <span class="n">to_tree</span><span class="o">=</span><span class="n">root_other</span><span class="p">,</span>
+</span></span><span id="__span-19-48"><a id="__codelineno-19-48" name="__codelineno-19-48" href="#__codelineno-19-48"></a><span class="hll">    <span class="n">from_paths</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;Downloads/photo1.jpg&quot;</span><span class="p">,</span> <span class="s2">&quot;Downloads/file1.doc&quot;</span><span class="p">],</span>
+</span></span><span id="__span-19-49"><a id="__codelineno-19-49" name="__codelineno-19-49" href="#__codelineno-19-49"></a><span class="hll">    <span class="n">to_paths</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;Documents/Pictures/photo2.jpg&quot;</span><span class="p">,</span> <span class="s2">&quot;Documents/file2.doc&quot;</span><span class="p">],</span>
+</span></span><span id="__span-19-50"><a id="__codelineno-19-50" name="__codelineno-19-50" href="#__codelineno-19-50"></a><span class="hll"><span class="p">)</span>
+</span></span><span id="__span-19-51"><a id="__codelineno-19-51" name="__codelineno-19-51" href="#__codelineno-19-51"></a><span class="n">root_other</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
+</span><span id="__span-19-52"><a id="__codelineno-19-52" name="__codelineno-19-52" href="#__codelineno-19-52"></a><span class="c1"># Documents</span>
+</span><span id="__span-19-53"><a id="__codelineno-19-53" name="__codelineno-19-53" href="#__codelineno-19-53"></a><span class="c1"># ├── Pictures</span>
+</span><span id="__span-19-54"><a id="__codelineno-19-54" name="__codelineno-19-54" href="#__codelineno-19-54"></a><span class="c1"># │   └── photo1.jpg (4)</span>
+</span><span id="__span-19-55"><a id="__codelineno-19-55" name="__codelineno-19-55" href="#__codelineno-19-55"></a><span class="c1"># └── file1.doc (5)</span>
 </span></code></pre></div>
 <ol>
 <li>The first copy to destination <code>Documents/Pictures</code></li>
@@ -3356,90 +3399,90 @@ <h2 id="tree-search">Tree Search</h2>
 <p>One or multiple nodes can be searched based on name, path, attribute value, or user-defined condition.
 It is also possible to search for one or more child node(s) based on attributes, this search will be faster as
 it does not require traversing the whole tree to find the node(s).</p>
-<div class="tabbed-set tabbed-alternate" data-tabs="9:3"><input checked="checked" id="__tabbed_9_1" name="__tabbed_9" type="radio" /><input id="__tabbed_9_2" name="__tabbed_9" type="radio" /><input id="__tabbed_9_3" name="__tabbed_9" type="radio" /><div class="tabbed-labels"><label for="__tabbed_9_1">Find single node</label><label for="__tabbed_9_2">Find multiple nodes</label><label for="__tabbed_9_3">Find child nodes</label></div>
+<div class="tabbed-set tabbed-alternate" data-tabs="10:3"><input checked="checked" id="__tabbed_10_1" name="__tabbed_10" type="radio" /><input id="__tabbed_10_2" name="__tabbed_10" type="radio" /><input id="__tabbed_10_3" name="__tabbed_10" type="radio" /><div class="tabbed-labels"><label for="__tabbed_10_1">Find single node</label><label for="__tabbed_10_2">Find multiple nodes</label><label for="__tabbed_10_3">Find child nodes</label></div>
 <div class="tabbed-content">
 <div class="tabbed-block">
-<div class="language-python highlight"><pre><span></span><code><span id="__span-18-1"><a id="__codelineno-18-1" name="__codelineno-18-1" href="#__codelineno-18-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">Node</span><span class="p">,</span> <span class="n">find</span><span class="p">,</span> <span class="n">find_name</span><span class="p">,</span> <span class="n">find_path</span><span class="p">,</span> <span class="n">find_relative_path</span><span class="p">,</span> <span class="n">find_full_path</span><span class="p">,</span> <span class="n">find_attr</span>
-</span><span id="__span-18-2"><a id="__codelineno-18-2" name="__codelineno-18-2" href="#__codelineno-18-2"></a><span class="n">root</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">90</span><span class="p">)</span>
-</span><span id="__span-18-3"><a id="__codelineno-18-3" name="__codelineno-18-3" href="#__codelineno-18-3"></a><span class="n">b</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">65</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
-</span><span id="__span-18-4"><a id="__codelineno-18-4" name="__codelineno-18-4" href="#__codelineno-18-4"></a><span class="n">c</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">60</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
-</span><span id="__span-18-5"><a id="__codelineno-18-5" name="__codelineno-18-5" href="#__codelineno-18-5"></a><span class="n">d</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;d&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">40</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">c</span><span class="p">)</span>
-</span><span id="__span-18-6"><a id="__codelineno-18-6" name="__codelineno-18-6" href="#__codelineno-18-6"></a><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">(</span><span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;age&quot;</span><span class="p">])</span>
-</span><span id="__span-18-7"><a id="__codelineno-18-7" name="__codelineno-18-7" href="#__codelineno-18-7"></a><span class="c1"># a [age=90]</span>
-</span><span id="__span-18-8"><a id="__codelineno-18-8" name="__codelineno-18-8" href="#__codelineno-18-8"></a><span class="c1"># ├── b [age=65]</span>
-</span><span id="__span-18-9"><a id="__codelineno-18-9" name="__codelineno-18-9" href="#__codelineno-18-9"></a><span class="c1"># └── c [age=60]</span>
-</span><span id="__span-18-10"><a id="__codelineno-18-10" name="__codelineno-18-10" href="#__codelineno-18-10"></a><span class="c1">#     └── d [age=40]</span>
-</span><span id="__span-18-11"><a id="__codelineno-18-11" name="__codelineno-18-11" href="#__codelineno-18-11"></a>
-</span><span id="__span-18-12"><a id="__codelineno-18-12" name="__codelineno-18-12" href="#__codelineno-18-12"></a><span class="hll"><span class="n">find</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="k">lambda</span> <span class="n">node</span><span class="p">:</span> <span class="n">node</span><span class="o">.</span><span class="n">age</span> <span class="o">==</span> <span class="mi">60</span><span class="p">)</span>
-</span></span><span id="__span-18-13"><a id="__codelineno-18-13" name="__codelineno-18-13" href="#__codelineno-18-13"></a><span class="c1"># Node(/a/c, age=60)</span>
-</span><span id="__span-18-14"><a id="__codelineno-18-14" name="__codelineno-18-14" href="#__codelineno-18-14"></a>
-</span><span id="__span-18-15"><a id="__codelineno-18-15" name="__codelineno-18-15" href="#__codelineno-18-15"></a><span class="hll"><span class="n">find_name</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="s2">&quot;d&quot;</span><span class="p">)</span>
-</span></span><span id="__span-18-16"><a id="__codelineno-18-16" name="__codelineno-18-16" href="#__codelineno-18-16"></a><span class="c1"># Node(/a/c/d, age=40)</span>
-</span><span id="__span-18-17"><a id="__codelineno-18-17" name="__codelineno-18-17" href="#__codelineno-18-17"></a>
-</span><span id="__span-18-18"><a id="__codelineno-18-18" name="__codelineno-18-18" href="#__codelineno-18-18"></a><span class="hll"><span class="n">find_relative_path</span><span class="p">(</span><span class="n">c</span><span class="p">,</span> <span class="s2">&quot;../b&quot;</span><span class="p">)</span>  <span class="c1"># relative path</span>
-</span></span><span id="__span-18-19"><a id="__codelineno-18-19" name="__codelineno-18-19" href="#__codelineno-18-19"></a><span class="c1"># (Node(/a/b, age=65),)</span>
-</span><span id="__span-18-20"><a id="__codelineno-18-20" name="__codelineno-18-20" href="#__codelineno-18-20"></a>
-</span><span id="__span-18-21"><a id="__codelineno-18-21" name="__codelineno-18-21" href="#__codelineno-18-21"></a><span class="hll"><span class="n">find_path</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="s2">&quot;/c/d&quot;</span><span class="p">)</span>  <span class="c1"># partial path</span>
-</span></span><span id="__span-18-22"><a id="__codelineno-18-22" name="__codelineno-18-22" href="#__codelineno-18-22"></a><span class="c1"># Node(/a/c/d, age=40)</span>
-</span><span id="__span-18-23"><a id="__codelineno-18-23" name="__codelineno-18-23" href="#__codelineno-18-23"></a>
-</span><span id="__span-18-24"><a id="__codelineno-18-24" name="__codelineno-18-24" href="#__codelineno-18-24"></a><span class="hll"><span class="n">find_full_path</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="s2">&quot;a/c/d&quot;</span><span class="p">)</span>  <span class="c1"># full path</span>
-</span></span><span id="__span-18-25"><a id="__codelineno-18-25" name="__codelineno-18-25" href="#__codelineno-18-25"></a><span class="c1"># Node(/a/c/d, age=40)</span>
-</span><span id="__span-18-26"><a id="__codelineno-18-26" name="__codelineno-18-26" href="#__codelineno-18-26"></a>
-</span><span id="__span-18-27"><a id="__codelineno-18-27" name="__codelineno-18-27" href="#__codelineno-18-27"></a><span class="hll"><span class="n">find_attr</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="s2">&quot;age&quot;</span><span class="p">,</span> <span class="mi">40</span><span class="p">)</span>
-</span></span><span id="__span-18-28"><a id="__codelineno-18-28" name="__codelineno-18-28" href="#__codelineno-18-28"></a><span class="c1"># Node(/a/c/d, age=40)</span>
-</span></code></pre></div>
-</div>
-<div class="tabbed-block">
-<div class="language-python highlight"><pre><span></span><code><span id="__span-19-1"><a id="__codelineno-19-1" name="__codelineno-19-1" href="#__codelineno-19-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">Node</span><span class="p">,</span> <span class="n">findall</span><span class="p">,</span> <span class="n">find_names</span><span class="p">,</span> <span class="n">find_relative_path</span><span class="p">,</span> <span class="n">find_paths</span><span class="p">,</span> <span class="n">find_attrs</span>
-</span><span id="__span-19-2"><a id="__codelineno-19-2" name="__codelineno-19-2" href="#__codelineno-19-2"></a><span class="n">root</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">90</span><span class="p">)</span>
-</span><span id="__span-19-3"><a id="__codelineno-19-3" name="__codelineno-19-3" href="#__codelineno-19-3"></a><span class="n">b</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">65</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
-</span><span id="__span-19-4"><a id="__codelineno-19-4" name="__codelineno-19-4" href="#__codelineno-19-4"></a><span class="n">c</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">60</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
-</span><span id="__span-19-5"><a id="__codelineno-19-5" name="__codelineno-19-5" href="#__codelineno-19-5"></a><span class="n">d</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">40</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">c</span><span class="p">)</span>
-</span><span id="__span-19-6"><a id="__codelineno-19-6" name="__codelineno-19-6" href="#__codelineno-19-6"></a><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">(</span><span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;age&quot;</span><span class="p">])</span>
-</span><span id="__span-19-7"><a id="__codelineno-19-7" name="__codelineno-19-7" href="#__codelineno-19-7"></a><span class="c1"># a [age=90]</span>
-</span><span id="__span-19-8"><a id="__codelineno-19-8" name="__codelineno-19-8" href="#__codelineno-19-8"></a><span class="c1"># ├── b [age=65]</span>
-</span><span id="__span-19-9"><a id="__codelineno-19-9" name="__codelineno-19-9" href="#__codelineno-19-9"></a><span class="c1"># └── c [age=60]</span>
-</span><span id="__span-19-10"><a id="__codelineno-19-10" name="__codelineno-19-10" href="#__codelineno-19-10"></a><span class="c1">#     └── c [age=40]</span>
-</span><span id="__span-19-11"><a id="__codelineno-19-11" name="__codelineno-19-11" href="#__codelineno-19-11"></a>
-</span><span id="__span-19-12"><a id="__codelineno-19-12" name="__codelineno-19-12" href="#__codelineno-19-12"></a><span class="hll"><span class="n">findall</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="k">lambda</span> <span class="n">node</span><span class="p">:</span> <span class="n">node</span><span class="o">.</span><span class="n">age</span> <span class="o">&gt;=</span> <span class="mi">65</span><span class="p">)</span>
-</span></span><span id="__span-19-13"><a id="__codelineno-19-13" name="__codelineno-19-13" href="#__codelineno-19-13"></a><span class="c1"># (Node(/a, age=90), Node(/a/b, age=65))</span>
-</span><span id="__span-19-14"><a id="__codelineno-19-14" name="__codelineno-19-14" href="#__codelineno-19-14"></a>
-</span><span id="__span-19-15"><a id="__codelineno-19-15" name="__codelineno-19-15" href="#__codelineno-19-15"></a><span class="hll"><span class="n">find_names</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="s2">&quot;c&quot;</span><span class="p">)</span>
-</span></span><span id="__span-19-16"><a id="__codelineno-19-16" name="__codelineno-19-16" href="#__codelineno-19-16"></a><span class="c1"># (Node(/a/c, age=60), Node(/a/c/c, age=40))</span>
-</span><span id="__span-19-17"><a id="__codelineno-19-17" name="__codelineno-19-17" href="#__codelineno-19-17"></a>
-</span><span id="__span-19-18"><a id="__codelineno-19-18" name="__codelineno-19-18" href="#__codelineno-19-18"></a><span class="hll"><span class="n">find_relative_path</span><span class="p">(</span><span class="n">c</span><span class="p">,</span> <span class="s2">&quot;../*&quot;</span><span class="p">)</span>  <span class="c1"># relative path</span>
-</span></span><span id="__span-19-19"><a id="__codelineno-19-19" name="__codelineno-19-19" href="#__codelineno-19-19"></a><span class="c1"># (Node(/a/b, age=65), Node(/a/c, age=60))</span>
-</span><span id="__span-19-20"><a id="__codelineno-19-20" name="__codelineno-19-20" href="#__codelineno-19-20"></a>
-</span><span id="__span-19-21"><a id="__codelineno-19-21" name="__codelineno-19-21" href="#__codelineno-19-21"></a><span class="hll"><span class="n">find_paths</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="s2">&quot;/c&quot;</span><span class="p">)</span>  <span class="c1"># partial path</span>
-</span></span><span id="__span-19-22"><a id="__codelineno-19-22" name="__codelineno-19-22" href="#__codelineno-19-22"></a><span class="c1"># (Node(/a/c, age=60), Node(/a/c/c, age=40))</span>
-</span><span id="__span-19-23"><a id="__codelineno-19-23" name="__codelineno-19-23" href="#__codelineno-19-23"></a>
-</span><span id="__span-19-24"><a id="__codelineno-19-24" name="__codelineno-19-24" href="#__codelineno-19-24"></a><span class="hll"><span class="n">find_attrs</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="s2">&quot;age&quot;</span><span class="p">,</span> <span class="mi">40</span><span class="p">)</span>
-</span></span><span id="__span-19-25"><a id="__codelineno-19-25" name="__codelineno-19-25" href="#__codelineno-19-25"></a><span class="c1"># (Node(/a/c/c, age=40),)</span>
-</span></code></pre></div>
-</div>
-<div class="tabbed-block">
-<div class="language-python highlight"><pre><span></span><code><span id="__span-20-1"><a id="__codelineno-20-1" name="__codelineno-20-1" href="#__codelineno-20-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">Node</span><span class="p">,</span> <span class="n">find_children</span><span class="p">,</span> <span class="n">find_child</span><span class="p">,</span> <span class="n">find_child_by_name</span>
+<div class="language-python highlight"><pre><span></span><code><span id="__span-20-1"><a id="__codelineno-20-1" name="__codelineno-20-1" href="#__codelineno-20-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">Node</span><span class="p">,</span> <span class="n">find</span><span class="p">,</span> <span class="n">find_name</span><span class="p">,</span> <span class="n">find_path</span><span class="p">,</span> <span class="n">find_relative_path</span><span class="p">,</span> <span class="n">find_full_path</span><span class="p">,</span> <span class="n">find_attr</span>
 </span><span id="__span-20-2"><a id="__codelineno-20-2" name="__codelineno-20-2" href="#__codelineno-20-2"></a><span class="n">root</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">90</span><span class="p">)</span>
 </span><span id="__span-20-3"><a id="__codelineno-20-3" name="__codelineno-20-3" href="#__codelineno-20-3"></a><span class="n">b</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">65</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
 </span><span id="__span-20-4"><a id="__codelineno-20-4" name="__codelineno-20-4" href="#__codelineno-20-4"></a><span class="n">c</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">60</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
-</span><span id="__span-20-5"><a id="__codelineno-20-5" name="__codelineno-20-5" href="#__codelineno-20-5"></a><span class="n">d</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">40</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">c</span><span class="p">)</span>
+</span><span id="__span-20-5"><a id="__codelineno-20-5" name="__codelineno-20-5" href="#__codelineno-20-5"></a><span class="n">d</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;d&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">40</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">c</span><span class="p">)</span>
 </span><span id="__span-20-6"><a id="__codelineno-20-6" name="__codelineno-20-6" href="#__codelineno-20-6"></a><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">(</span><span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;age&quot;</span><span class="p">])</span>
 </span><span id="__span-20-7"><a id="__codelineno-20-7" name="__codelineno-20-7" href="#__codelineno-20-7"></a><span class="c1"># a [age=90]</span>
 </span><span id="__span-20-8"><a id="__codelineno-20-8" name="__codelineno-20-8" href="#__codelineno-20-8"></a><span class="c1"># ├── b [age=65]</span>
 </span><span id="__span-20-9"><a id="__codelineno-20-9" name="__codelineno-20-9" href="#__codelineno-20-9"></a><span class="c1"># └── c [age=60]</span>
-</span><span id="__span-20-10"><a id="__codelineno-20-10" name="__codelineno-20-10" href="#__codelineno-20-10"></a><span class="c1">#     └── c [age=40]</span>
+</span><span id="__span-20-10"><a id="__codelineno-20-10" name="__codelineno-20-10" href="#__codelineno-20-10"></a><span class="c1">#     └── d [age=40]</span>
 </span><span id="__span-20-11"><a id="__codelineno-20-11" name="__codelineno-20-11" href="#__codelineno-20-11"></a>
-</span><span id="__span-20-12"><a id="__codelineno-20-12" name="__codelineno-20-12" href="#__codelineno-20-12"></a><span class="hll"><span class="n">find_children</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="k">lambda</span> <span class="n">node</span><span class="p">:</span> <span class="n">node</span><span class="o">.</span><span class="n">age</span> <span class="o">&gt;=</span> <span class="mi">60</span><span class="p">)</span>
-</span></span><span id="__span-20-13"><a id="__codelineno-20-13" name="__codelineno-20-13" href="#__codelineno-20-13"></a><span class="c1"># (Node(/a/b, age=65), Node(/a/c, age=60))</span>
+</span><span id="__span-20-12"><a id="__codelineno-20-12" name="__codelineno-20-12" href="#__codelineno-20-12"></a><span class="hll"><span class="n">find</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="k">lambda</span> <span class="n">node</span><span class="p">:</span> <span class="n">node</span><span class="o">.</span><span class="n">age</span> <span class="o">==</span> <span class="mi">60</span><span class="p">)</span>
+</span></span><span id="__span-20-13"><a id="__codelineno-20-13" name="__codelineno-20-13" href="#__codelineno-20-13"></a><span class="c1"># Node(/a/c, age=60)</span>
 </span><span id="__span-20-14"><a id="__codelineno-20-14" name="__codelineno-20-14" href="#__codelineno-20-14"></a>
-</span><span id="__span-20-15"><a id="__codelineno-20-15" name="__codelineno-20-15" href="#__codelineno-20-15"></a><span class="hll"><span class="n">find_child</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="k">lambda</span> <span class="n">node</span><span class="p">:</span> <span class="n">node</span><span class="o">.</span><span class="n">name</span> <span class="o">==</span> <span class="s2">&quot;c&quot;</span><span class="p">)</span>
-</span></span><span id="__span-20-16"><a id="__codelineno-20-16" name="__codelineno-20-16" href="#__codelineno-20-16"></a><span class="c1"># Node(/a/c, age=60)</span>
+</span><span id="__span-20-15"><a id="__codelineno-20-15" name="__codelineno-20-15" href="#__codelineno-20-15"></a><span class="hll"><span class="n">find_name</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="s2">&quot;d&quot;</span><span class="p">)</span>
+</span></span><span id="__span-20-16"><a id="__codelineno-20-16" name="__codelineno-20-16" href="#__codelineno-20-16"></a><span class="c1"># Node(/a/c/d, age=40)</span>
 </span><span id="__span-20-17"><a id="__codelineno-20-17" name="__codelineno-20-17" href="#__codelineno-20-17"></a>
-</span><span id="__span-20-18"><a id="__codelineno-20-18" name="__codelineno-20-18" href="#__codelineno-20-18"></a><span class="hll"><span class="n">find_child_by_name</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="s2">&quot;c&quot;</span><span class="p">)</span>
-</span></span><span id="__span-20-19"><a id="__codelineno-20-19" name="__codelineno-20-19" href="#__codelineno-20-19"></a><span class="c1"># Node(/a/c, age=60)</span>
+</span><span id="__span-20-18"><a id="__codelineno-20-18" name="__codelineno-20-18" href="#__codelineno-20-18"></a><span class="hll"><span class="n">find_relative_path</span><span class="p">(</span><span class="n">c</span><span class="p">,</span> <span class="s2">&quot;../b&quot;</span><span class="p">)</span>  <span class="c1"># relative path</span>
+</span></span><span id="__span-20-19"><a id="__codelineno-20-19" name="__codelineno-20-19" href="#__codelineno-20-19"></a><span class="c1"># (Node(/a/b, age=65),)</span>
 </span><span id="__span-20-20"><a id="__codelineno-20-20" name="__codelineno-20-20" href="#__codelineno-20-20"></a>
-</span><span id="__span-20-21"><a id="__codelineno-20-21" name="__codelineno-20-21" href="#__codelineno-20-21"></a><span class="hll"><span class="n">find_child_by_name</span><span class="p">(</span><span class="n">c</span><span class="p">,</span> <span class="s2">&quot;c&quot;</span><span class="p">)</span>
-</span></span><span id="__span-20-22"><a id="__codelineno-20-22" name="__codelineno-20-22" href="#__codelineno-20-22"></a><span class="c1"># Node(/a/c/c, age=40)</span>
+</span><span id="__span-20-21"><a id="__codelineno-20-21" name="__codelineno-20-21" href="#__codelineno-20-21"></a><span class="hll"><span class="n">find_path</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="s2">&quot;/c/d&quot;</span><span class="p">)</span>  <span class="c1"># partial path</span>
+</span></span><span id="__span-20-22"><a id="__codelineno-20-22" name="__codelineno-20-22" href="#__codelineno-20-22"></a><span class="c1"># Node(/a/c/d, age=40)</span>
+</span><span id="__span-20-23"><a id="__codelineno-20-23" name="__codelineno-20-23" href="#__codelineno-20-23"></a>
+</span><span id="__span-20-24"><a id="__codelineno-20-24" name="__codelineno-20-24" href="#__codelineno-20-24"></a><span class="hll"><span class="n">find_full_path</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="s2">&quot;a/c/d&quot;</span><span class="p">)</span>  <span class="c1"># full path</span>
+</span></span><span id="__span-20-25"><a id="__codelineno-20-25" name="__codelineno-20-25" href="#__codelineno-20-25"></a><span class="c1"># Node(/a/c/d, age=40)</span>
+</span><span id="__span-20-26"><a id="__codelineno-20-26" name="__codelineno-20-26" href="#__codelineno-20-26"></a>
+</span><span id="__span-20-27"><a id="__codelineno-20-27" name="__codelineno-20-27" href="#__codelineno-20-27"></a><span class="hll"><span class="n">find_attr</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="s2">&quot;age&quot;</span><span class="p">,</span> <span class="mi">40</span><span class="p">)</span>
+</span></span><span id="__span-20-28"><a id="__codelineno-20-28" name="__codelineno-20-28" href="#__codelineno-20-28"></a><span class="c1"># Node(/a/c/d, age=40)</span>
+</span></code></pre></div>
+</div>
+<div class="tabbed-block">
+<div class="language-python highlight"><pre><span></span><code><span id="__span-21-1"><a id="__codelineno-21-1" name="__codelineno-21-1" href="#__codelineno-21-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">Node</span><span class="p">,</span> <span class="n">findall</span><span class="p">,</span> <span class="n">find_names</span><span class="p">,</span> <span class="n">find_relative_path</span><span class="p">,</span> <span class="n">find_paths</span><span class="p">,</span> <span class="n">find_attrs</span>
+</span><span id="__span-21-2"><a id="__codelineno-21-2" name="__codelineno-21-2" href="#__codelineno-21-2"></a><span class="n">root</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">90</span><span class="p">)</span>
+</span><span id="__span-21-3"><a id="__codelineno-21-3" name="__codelineno-21-3" href="#__codelineno-21-3"></a><span class="n">b</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">65</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
+</span><span id="__span-21-4"><a id="__codelineno-21-4" name="__codelineno-21-4" href="#__codelineno-21-4"></a><span class="n">c</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">60</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
+</span><span id="__span-21-5"><a id="__codelineno-21-5" name="__codelineno-21-5" href="#__codelineno-21-5"></a><span class="n">d</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">40</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">c</span><span class="p">)</span>
+</span><span id="__span-21-6"><a id="__codelineno-21-6" name="__codelineno-21-6" href="#__codelineno-21-6"></a><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">(</span><span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;age&quot;</span><span class="p">])</span>
+</span><span id="__span-21-7"><a id="__codelineno-21-7" name="__codelineno-21-7" href="#__codelineno-21-7"></a><span class="c1"># a [age=90]</span>
+</span><span id="__span-21-8"><a id="__codelineno-21-8" name="__codelineno-21-8" href="#__codelineno-21-8"></a><span class="c1"># ├── b [age=65]</span>
+</span><span id="__span-21-9"><a id="__codelineno-21-9" name="__codelineno-21-9" href="#__codelineno-21-9"></a><span class="c1"># └── c [age=60]</span>
+</span><span id="__span-21-10"><a id="__codelineno-21-10" name="__codelineno-21-10" href="#__codelineno-21-10"></a><span class="c1">#     └── c [age=40]</span>
+</span><span id="__span-21-11"><a id="__codelineno-21-11" name="__codelineno-21-11" href="#__codelineno-21-11"></a>
+</span><span id="__span-21-12"><a id="__codelineno-21-12" name="__codelineno-21-12" href="#__codelineno-21-12"></a><span class="hll"><span class="n">findall</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="k">lambda</span> <span class="n">node</span><span class="p">:</span> <span class="n">node</span><span class="o">.</span><span class="n">age</span> <span class="o">&gt;=</span> <span class="mi">65</span><span class="p">)</span>
+</span></span><span id="__span-21-13"><a id="__codelineno-21-13" name="__codelineno-21-13" href="#__codelineno-21-13"></a><span class="c1"># (Node(/a, age=90), Node(/a/b, age=65))</span>
+</span><span id="__span-21-14"><a id="__codelineno-21-14" name="__codelineno-21-14" href="#__codelineno-21-14"></a>
+</span><span id="__span-21-15"><a id="__codelineno-21-15" name="__codelineno-21-15" href="#__codelineno-21-15"></a><span class="hll"><span class="n">find_names</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="s2">&quot;c&quot;</span><span class="p">)</span>
+</span></span><span id="__span-21-16"><a id="__codelineno-21-16" name="__codelineno-21-16" href="#__codelineno-21-16"></a><span class="c1"># (Node(/a/c, age=60), Node(/a/c/c, age=40))</span>
+</span><span id="__span-21-17"><a id="__codelineno-21-17" name="__codelineno-21-17" href="#__codelineno-21-17"></a>
+</span><span id="__span-21-18"><a id="__codelineno-21-18" name="__codelineno-21-18" href="#__codelineno-21-18"></a><span class="hll"><span class="n">find_relative_path</span><span class="p">(</span><span class="n">c</span><span class="p">,</span> <span class="s2">&quot;../*&quot;</span><span class="p">)</span>  <span class="c1"># relative path</span>
+</span></span><span id="__span-21-19"><a id="__codelineno-21-19" name="__codelineno-21-19" href="#__codelineno-21-19"></a><span class="c1"># (Node(/a/b, age=65), Node(/a/c, age=60))</span>
+</span><span id="__span-21-20"><a id="__codelineno-21-20" name="__codelineno-21-20" href="#__codelineno-21-20"></a>
+</span><span id="__span-21-21"><a id="__codelineno-21-21" name="__codelineno-21-21" href="#__codelineno-21-21"></a><span class="hll"><span class="n">find_paths</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="s2">&quot;/c&quot;</span><span class="p">)</span>  <span class="c1"># partial path</span>
+</span></span><span id="__span-21-22"><a id="__codelineno-21-22" name="__codelineno-21-22" href="#__codelineno-21-22"></a><span class="c1"># (Node(/a/c, age=60), Node(/a/c/c, age=40))</span>
+</span><span id="__span-21-23"><a id="__codelineno-21-23" name="__codelineno-21-23" href="#__codelineno-21-23"></a>
+</span><span id="__span-21-24"><a id="__codelineno-21-24" name="__codelineno-21-24" href="#__codelineno-21-24"></a><span class="hll"><span class="n">find_attrs</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="s2">&quot;age&quot;</span><span class="p">,</span> <span class="mi">40</span><span class="p">)</span>
+</span></span><span id="__span-21-25"><a id="__codelineno-21-25" name="__codelineno-21-25" href="#__codelineno-21-25"></a><span class="c1"># (Node(/a/c/c, age=40),)</span>
+</span></code></pre></div>
+</div>
+<div class="tabbed-block">
+<div class="language-python highlight"><pre><span></span><code><span id="__span-22-1"><a id="__codelineno-22-1" name="__codelineno-22-1" href="#__codelineno-22-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">Node</span><span class="p">,</span> <span class="n">find_children</span><span class="p">,</span> <span class="n">find_child</span><span class="p">,</span> <span class="n">find_child_by_name</span>
+</span><span id="__span-22-2"><a id="__codelineno-22-2" name="__codelineno-22-2" href="#__codelineno-22-2"></a><span class="n">root</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">90</span><span class="p">)</span>
+</span><span id="__span-22-3"><a id="__codelineno-22-3" name="__codelineno-22-3" href="#__codelineno-22-3"></a><span class="n">b</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">65</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
+</span><span id="__span-22-4"><a id="__codelineno-22-4" name="__codelineno-22-4" href="#__codelineno-22-4"></a><span class="n">c</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">60</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
+</span><span id="__span-22-5"><a id="__codelineno-22-5" name="__codelineno-22-5" href="#__codelineno-22-5"></a><span class="n">d</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">40</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">c</span><span class="p">)</span>
+</span><span id="__span-22-6"><a id="__codelineno-22-6" name="__codelineno-22-6" href="#__codelineno-22-6"></a><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">(</span><span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;age&quot;</span><span class="p">])</span>
+</span><span id="__span-22-7"><a id="__codelineno-22-7" name="__codelineno-22-7" href="#__codelineno-22-7"></a><span class="c1"># a [age=90]</span>
+</span><span id="__span-22-8"><a id="__codelineno-22-8" name="__codelineno-22-8" href="#__codelineno-22-8"></a><span class="c1"># ├── b [age=65]</span>
+</span><span id="__span-22-9"><a id="__codelineno-22-9" name="__codelineno-22-9" href="#__codelineno-22-9"></a><span class="c1"># └── c [age=60]</span>
+</span><span id="__span-22-10"><a id="__codelineno-22-10" name="__codelineno-22-10" href="#__codelineno-22-10"></a><span class="c1">#     └── c [age=40]</span>
+</span><span id="__span-22-11"><a id="__codelineno-22-11" name="__codelineno-22-11" href="#__codelineno-22-11"></a>
+</span><span id="__span-22-12"><a id="__codelineno-22-12" name="__codelineno-22-12" href="#__codelineno-22-12"></a><span class="hll"><span class="n">find_children</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="k">lambda</span> <span class="n">node</span><span class="p">:</span> <span class="n">node</span><span class="o">.</span><span class="n">age</span> <span class="o">&gt;=</span> <span class="mi">60</span><span class="p">)</span>
+</span></span><span id="__span-22-13"><a id="__codelineno-22-13" name="__codelineno-22-13" href="#__codelineno-22-13"></a><span class="c1"># (Node(/a/b, age=65), Node(/a/c, age=60))</span>
+</span><span id="__span-22-14"><a id="__codelineno-22-14" name="__codelineno-22-14" href="#__codelineno-22-14"></a>
+</span><span id="__span-22-15"><a id="__codelineno-22-15" name="__codelineno-22-15" href="#__codelineno-22-15"></a><span class="hll"><span class="n">find_child</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="k">lambda</span> <span class="n">node</span><span class="p">:</span> <span class="n">node</span><span class="o">.</span><span class="n">name</span> <span class="o">==</span> <span class="s2">&quot;c&quot;</span><span class="p">)</span>
+</span></span><span id="__span-22-16"><a id="__codelineno-22-16" name="__codelineno-22-16" href="#__codelineno-22-16"></a><span class="c1"># Node(/a/c, age=60)</span>
+</span><span id="__span-22-17"><a id="__codelineno-22-17" name="__codelineno-22-17" href="#__codelineno-22-17"></a>
+</span><span id="__span-22-18"><a id="__codelineno-22-18" name="__codelineno-22-18" href="#__codelineno-22-18"></a><span class="hll"><span class="n">find_child_by_name</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="s2">&quot;c&quot;</span><span class="p">)</span>
+</span></span><span id="__span-22-19"><a id="__codelineno-22-19" name="__codelineno-22-19" href="#__codelineno-22-19"></a><span class="c1"># Node(/a/c, age=60)</span>
+</span><span id="__span-22-20"><a id="__codelineno-22-20" name="__codelineno-22-20" href="#__codelineno-22-20"></a>
+</span><span id="__span-22-21"><a id="__codelineno-22-21" name="__codelineno-22-21" href="#__codelineno-22-21"></a><span class="hll"><span class="n">find_child_by_name</span><span class="p">(</span><span class="n">c</span><span class="p">,</span> <span class="s2">&quot;c&quot;</span><span class="p">)</span>
+</span></span><span id="__span-22-22"><a id="__codelineno-22-22" name="__codelineno-22-22" href="#__codelineno-22-22"></a><span class="c1"># Node(/a/c/c, age=40)</span>
 </span></code></pre></div>
 </div>
 </div>
@@ -3447,61 +3490,16 @@ <h2 id="tree-search">Tree Search</h2>
 <h2 id="helper-utility">Helper Utility</h2>
 <p>There following are helper functions for</p>
 <h3 id="1-cloning-tree-to-another-node-type">1. Cloning tree to another Node type</h3>
-<div class="language-python highlight"><pre><span></span><code><span id="__span-21-1"><a id="__codelineno-21-1" name="__codelineno-21-1" href="#__codelineno-21-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">BaseNode</span><span class="p">,</span> <span class="n">Node</span><span class="p">,</span> <span class="n">clone_tree</span>
-</span><span id="__span-21-2"><a id="__codelineno-21-2" name="__codelineno-21-2" href="#__codelineno-21-2"></a>
-</span><span id="__span-21-3"><a id="__codelineno-21-3" name="__codelineno-21-3" href="#__codelineno-21-3"></a><span class="c1"># Cloning tree from `BaseNode` to `Node` type</span>
-</span><span id="__span-21-4"><a id="__codelineno-21-4" name="__codelineno-21-4" href="#__codelineno-21-4"></a><span class="hll"><span class="n">root</span> <span class="o">=</span> <span class="n">BaseNode</span><span class="p">(</span><span class="n">name</span><span class="o">=</span><span class="s2">&quot;a&quot;</span><span class="p">)</span>
-</span></span><span id="__span-21-5"><a id="__codelineno-21-5" name="__codelineno-21-5" href="#__codelineno-21-5"></a><span class="n">b</span> <span class="o">=</span> <span class="n">BaseNode</span><span class="p">(</span><span class="n">name</span><span class="o">=</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
-</span><span id="__span-21-6"><a id="__codelineno-21-6" name="__codelineno-21-6" href="#__codelineno-21-6"></a><span class="n">clone_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">Node</span><span class="p">)</span>
-</span><span id="__span-21-7"><a id="__codelineno-21-7" name="__codelineno-21-7" href="#__codelineno-21-7"></a><span class="c1"># Node(/a, )</span>
-</span></code></pre></div>
-<h3 id="2-getting-subtree-smaller-tree-with-different-root">2. Getting subtree (smaller tree with different root)</h3>
-<div class="language-python highlight"><pre><span></span><code><span id="__span-22-1"><a id="__codelineno-22-1" name="__codelineno-22-1" href="#__codelineno-22-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">str_to_tree</span><span class="p">,</span> <span class="n">get_subtree</span>
-</span><span id="__span-22-2"><a id="__codelineno-22-2" name="__codelineno-22-2" href="#__codelineno-22-2"></a>
-</span><span id="__span-22-3"><a id="__codelineno-22-3" name="__codelineno-22-3" href="#__codelineno-22-3"></a><span class="n">root</span> <span class="o">=</span> <span class="n">str_to_tree</span><span class="p">(</span><span class="s2">&quot;&quot;&quot;</span>
-</span><span id="__span-22-4"><a id="__codelineno-22-4" name="__codelineno-22-4" href="#__codelineno-22-4"></a><span class="s2">a</span>
-</span><span id="__span-22-5"><a id="__codelineno-22-5" name="__codelineno-22-5" href="#__codelineno-22-5"></a><span class="s2">├── b</span>
-</span><span id="__span-22-6"><a id="__codelineno-22-6" name="__codelineno-22-6" href="#__codelineno-22-6"></a><span class="s2">│   ├── d</span>
-</span><span id="__span-22-7"><a id="__codelineno-22-7" name="__codelineno-22-7" href="#__codelineno-22-7"></a><span class="s2">│   └── e</span>
-</span><span id="__span-22-8"><a id="__codelineno-22-8" name="__codelineno-22-8" href="#__codelineno-22-8"></a><span class="s2">└── c</span>
-</span><span id="__span-22-9"><a id="__codelineno-22-9" name="__codelineno-22-9" href="#__codelineno-22-9"></a><span class="s2">    └── f</span>
-</span><span id="__span-22-10"><a id="__codelineno-22-10" name="__codelineno-22-10" href="#__codelineno-22-10"></a><span class="s2">&quot;&quot;&quot;</span><span class="p">)</span>
-</span><span id="__span-22-11"><a id="__codelineno-22-11" name="__codelineno-22-11" href="#__codelineno-22-11"></a>
-</span><span id="__span-22-12"><a id="__codelineno-22-12" name="__codelineno-22-12" href="#__codelineno-22-12"></a><span class="c1"># Getting subtree with root b</span>
-</span><span id="__span-22-13"><a id="__codelineno-22-13" name="__codelineno-22-13" href="#__codelineno-22-13"></a><span class="hll"><span class="n">root_subtree</span> <span class="o">=</span> <span class="n">get_subtree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="s2">&quot;b&quot;</span><span class="p">)</span>
-</span></span><span id="__span-22-14"><a id="__codelineno-22-14" name="__codelineno-22-14" href="#__codelineno-22-14"></a><span class="n">root_subtree</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
-</span><span id="__span-22-15"><a id="__codelineno-22-15" name="__codelineno-22-15" href="#__codelineno-22-15"></a><span class="c1"># b</span>
-</span><span id="__span-22-16"><a id="__codelineno-22-16" name="__codelineno-22-16" href="#__codelineno-22-16"></a><span class="c1"># ├── d</span>
-</span><span id="__span-22-17"><a id="__codelineno-22-17" name="__codelineno-22-17" href="#__codelineno-22-17"></a><span class="c1"># └── e</span>
-</span></code></pre></div>
-<h3 id="3-pruning-tree-smaller-tree-with-same-root">3. Pruning tree (smaller tree with same root)</h3>
-<div class="language-python highlight"><pre><span></span><code><span id="__span-23-1"><a id="__codelineno-23-1" name="__codelineno-23-1" href="#__codelineno-23-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">str_to_tree</span><span class="p">,</span> <span class="n">prune_tree</span>
+<div class="language-python highlight"><pre><span></span><code><span id="__span-23-1"><a id="__codelineno-23-1" name="__codelineno-23-1" href="#__codelineno-23-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">BaseNode</span><span class="p">,</span> <span class="n">Node</span><span class="p">,</span> <span class="n">clone_tree</span>
 </span><span id="__span-23-2"><a id="__codelineno-23-2" name="__codelineno-23-2" href="#__codelineno-23-2"></a>
-</span><span id="__span-23-3"><a id="__codelineno-23-3" name="__codelineno-23-3" href="#__codelineno-23-3"></a><span class="n">root</span> <span class="o">=</span> <span class="n">str_to_tree</span><span class="p">(</span><span class="s2">&quot;&quot;&quot;</span>
-</span><span id="__span-23-4"><a id="__codelineno-23-4" name="__codelineno-23-4" href="#__codelineno-23-4"></a><span class="s2">a</span>
-</span><span id="__span-23-5"><a id="__codelineno-23-5" name="__codelineno-23-5" href="#__codelineno-23-5"></a><span class="s2">├── b</span>
-</span><span id="__span-23-6"><a id="__codelineno-23-6" name="__codelineno-23-6" href="#__codelineno-23-6"></a><span class="s2">│   ├── d</span>
-</span><span id="__span-23-7"><a id="__codelineno-23-7" name="__codelineno-23-7" href="#__codelineno-23-7"></a><span class="s2">│   └── e</span>
-</span><span id="__span-23-8"><a id="__codelineno-23-8" name="__codelineno-23-8" href="#__codelineno-23-8"></a><span class="s2">└── c</span>
-</span><span id="__span-23-9"><a id="__codelineno-23-9" name="__codelineno-23-9" href="#__codelineno-23-9"></a><span class="s2">    └── f</span>
-</span><span id="__span-23-10"><a id="__codelineno-23-10" name="__codelineno-23-10" href="#__codelineno-23-10"></a><span class="s2">&quot;&quot;&quot;</span><span class="p">)</span>
-</span><span id="__span-23-11"><a id="__codelineno-23-11" name="__codelineno-23-11" href="#__codelineno-23-11"></a>
-</span><span id="__span-23-12"><a id="__codelineno-23-12" name="__codelineno-23-12" href="#__codelineno-23-12"></a><span class="c1"># Prune tree to only path a/b</span>
-</span><span id="__span-23-13"><a id="__codelineno-23-13" name="__codelineno-23-13" href="#__codelineno-23-13"></a><span class="hll"><span class="n">root_pruned</span> <span class="o">=</span> <span class="n">prune_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="s2">&quot;a/b&quot;</span><span class="p">)</span>
-</span></span><span id="__span-23-14"><a id="__codelineno-23-14" name="__codelineno-23-14" href="#__codelineno-23-14"></a><span class="n">root_pruned</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
-</span><span id="__span-23-15"><a id="__codelineno-23-15" name="__codelineno-23-15" href="#__codelineno-23-15"></a><span class="c1"># a</span>
-</span><span id="__span-23-16"><a id="__codelineno-23-16" name="__codelineno-23-16" href="#__codelineno-23-16"></a><span class="c1"># └── b</span>
-</span><span id="__span-23-17"><a id="__codelineno-23-17" name="__codelineno-23-17" href="#__codelineno-23-17"></a><span class="c1">#     ├── d</span>
-</span><span id="__span-23-18"><a id="__codelineno-23-18" name="__codelineno-23-18" href="#__codelineno-23-18"></a><span class="c1">#     └── e</span>
-</span><span id="__span-23-19"><a id="__codelineno-23-19" name="__codelineno-23-19" href="#__codelineno-23-19"></a>
-</span><span id="__span-23-20"><a id="__codelineno-23-20" name="__codelineno-23-20" href="#__codelineno-23-20"></a><span class="c1"># Prune tree to exactly path a/b</span>
-</span><span id="__span-23-21"><a id="__codelineno-23-21" name="__codelineno-23-21" href="#__codelineno-23-21"></a><span class="hll"><span class="n">root_pruned</span> <span class="o">=</span> <span class="n">prune_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="s2">&quot;a/b&quot;</span><span class="p">,</span> <span class="n">exact</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
-</span></span><span id="__span-23-22"><a id="__codelineno-23-22" name="__codelineno-23-22" href="#__codelineno-23-22"></a><span class="n">root_pruned</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
-</span><span id="__span-23-23"><a id="__codelineno-23-23" name="__codelineno-23-23" href="#__codelineno-23-23"></a><span class="c1"># a</span>
-</span><span id="__span-23-24"><a id="__codelineno-23-24" name="__codelineno-23-24" href="#__codelineno-23-24"></a><span class="c1"># └── b</span>
+</span><span id="__span-23-3"><a id="__codelineno-23-3" name="__codelineno-23-3" href="#__codelineno-23-3"></a><span class="c1"># Cloning tree from `BaseNode` to `Node` type</span>
+</span><span id="__span-23-4"><a id="__codelineno-23-4" name="__codelineno-23-4" href="#__codelineno-23-4"></a><span class="hll"><span class="n">root</span> <span class="o">=</span> <span class="n">BaseNode</span><span class="p">(</span><span class="n">name</span><span class="o">=</span><span class="s2">&quot;a&quot;</span><span class="p">)</span>
+</span></span><span id="__span-23-5"><a id="__codelineno-23-5" name="__codelineno-23-5" href="#__codelineno-23-5"></a><span class="n">b</span> <span class="o">=</span> <span class="n">BaseNode</span><span class="p">(</span><span class="n">name</span><span class="o">=</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
+</span><span id="__span-23-6"><a id="__codelineno-23-6" name="__codelineno-23-6" href="#__codelineno-23-6"></a><span class="n">clone_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">Node</span><span class="p">)</span>
+</span><span id="__span-23-7"><a id="__codelineno-23-7" name="__codelineno-23-7" href="#__codelineno-23-7"></a><span class="c1"># Node(/a, )</span>
 </span></code></pre></div>
-<h3 id="4-getting-difference-between-two-trees">4. Getting difference between two trees</h3>
-<div class="language-python highlight"><pre><span></span><code><span id="__span-24-1"><a id="__codelineno-24-1" name="__codelineno-24-1" href="#__codelineno-24-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">str_to_tree</span><span class="p">,</span> <span class="n">get_tree_diff</span>
+<h3 id="2-getting-subtree-smaller-tree-with-different-root">2. Getting subtree (smaller tree with different root)</h3>
+<div class="language-python highlight"><pre><span></span><code><span id="__span-24-1"><a id="__codelineno-24-1" name="__codelineno-24-1" href="#__codelineno-24-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">str_to_tree</span><span class="p">,</span> <span class="n">get_subtree</span>
 </span><span id="__span-24-2"><a id="__codelineno-24-2" name="__codelineno-24-2" href="#__codelineno-24-2"></a>
 </span><span id="__span-24-3"><a id="__codelineno-24-3" name="__codelineno-24-3" href="#__codelineno-24-3"></a><span class="n">root</span> <span class="o">=</span> <span class="n">str_to_tree</span><span class="p">(</span><span class="s2">&quot;&quot;&quot;</span>
 </span><span id="__span-24-4"><a id="__codelineno-24-4" name="__codelineno-24-4" href="#__codelineno-24-4"></a><span class="s2">a</span>
@@ -3512,33 +3510,78 @@ <h3 id="4-getting-difference-between-two-trees">4. Getting difference between tw
 </span><span id="__span-24-9"><a id="__codelineno-24-9" name="__codelineno-24-9" href="#__codelineno-24-9"></a><span class="s2">    └── f</span>
 </span><span id="__span-24-10"><a id="__codelineno-24-10" name="__codelineno-24-10" href="#__codelineno-24-10"></a><span class="s2">&quot;&quot;&quot;</span><span class="p">)</span>
 </span><span id="__span-24-11"><a id="__codelineno-24-11" name="__codelineno-24-11" href="#__codelineno-24-11"></a>
-</span><span id="__span-24-12"><a id="__codelineno-24-12" name="__codelineno-24-12" href="#__codelineno-24-12"></a><span class="c1"># Get difference between two trees</span>
-</span><span id="__span-24-13"><a id="__codelineno-24-13" name="__codelineno-24-13" href="#__codelineno-24-13"></a><span class="n">root_other</span> <span class="o">=</span> <span class="n">str_to_tree</span><span class="p">(</span><span class="s2">&quot;&quot;&quot;</span>
-</span><span id="__span-24-14"><a id="__codelineno-24-14" name="__codelineno-24-14" href="#__codelineno-24-14"></a><span class="s2">a</span>
-</span><span id="__span-24-15"><a id="__codelineno-24-15" name="__codelineno-24-15" href="#__codelineno-24-15"></a><span class="s2">├── b</span>
-</span><span id="__span-24-16"><a id="__codelineno-24-16" name="__codelineno-24-16" href="#__codelineno-24-16"></a><span class="s2">│   └── d</span>
-</span><span id="__span-24-17"><a id="__codelineno-24-17" name="__codelineno-24-17" href="#__codelineno-24-17"></a><span class="s2">└── c</span>
-</span><span id="__span-24-18"><a id="__codelineno-24-18" name="__codelineno-24-18" href="#__codelineno-24-18"></a><span class="s2">    └── g</span>
-</span><span id="__span-24-19"><a id="__codelineno-24-19" name="__codelineno-24-19" href="#__codelineno-24-19"></a><span class="s2">&quot;&quot;&quot;</span><span class="p">)</span>
-</span><span id="__span-24-20"><a id="__codelineno-24-20" name="__codelineno-24-20" href="#__codelineno-24-20"></a>
-</span><span id="__span-24-21"><a id="__codelineno-24-21" name="__codelineno-24-21" href="#__codelineno-24-21"></a><span class="n">tree_diff</span> <span class="o">=</span> <span class="n">get_tree_diff</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">root_other</span><span class="p">)</span>
-</span><span id="__span-24-22"><a id="__codelineno-24-22" name="__codelineno-24-22" href="#__codelineno-24-22"></a><span class="hll"><span class="n">tree_diff</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
-</span></span><span id="__span-24-23"><a id="__codelineno-24-23" name="__codelineno-24-23" href="#__codelineno-24-23"></a><span class="c1"># a</span>
-</span><span id="__span-24-24"><a id="__codelineno-24-24" name="__codelineno-24-24" href="#__codelineno-24-24"></a><span class="c1"># ├── b</span>
-</span><span id="__span-24-25"><a id="__codelineno-24-25" name="__codelineno-24-25" href="#__codelineno-24-25"></a><span class="c1"># │   └── e (-)</span>
-</span><span id="__span-24-26"><a id="__codelineno-24-26" name="__codelineno-24-26" href="#__codelineno-24-26"></a><span class="c1"># └── c</span>
-</span><span id="__span-24-27"><a id="__codelineno-24-27" name="__codelineno-24-27" href="#__codelineno-24-27"></a><span class="c1">#     ├── f (-)</span>
-</span><span id="__span-24-28"><a id="__codelineno-24-28" name="__codelineno-24-28" href="#__codelineno-24-28"></a><span class="c1">#     └── g (+)</span>
-</span><span id="__span-24-29"><a id="__codelineno-24-29" name="__codelineno-24-29" href="#__codelineno-24-29"></a>
-</span><span id="__span-24-30"><a id="__codelineno-24-30" name="__codelineno-24-30" href="#__codelineno-24-30"></a><span class="n">tree_diff</span> <span class="o">=</span> <span class="n">get_tree_diff</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">root_other</span><span class="p">,</span> <span class="n">only_diff</span><span class="o">=</span><span class="kc">False</span><span class="p">)</span>
-</span><span id="__span-24-31"><a id="__codelineno-24-31" name="__codelineno-24-31" href="#__codelineno-24-31"></a><span class="hll"><span class="n">tree_diff</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
-</span></span><span id="__span-24-32"><a id="__codelineno-24-32" name="__codelineno-24-32" href="#__codelineno-24-32"></a><span class="c1"># a</span>
-</span><span id="__span-24-33"><a id="__codelineno-24-33" name="__codelineno-24-33" href="#__codelineno-24-33"></a><span class="c1"># ├── b</span>
-</span><span id="__span-24-34"><a id="__codelineno-24-34" name="__codelineno-24-34" href="#__codelineno-24-34"></a><span class="c1"># │   ├── d</span>
-</span><span id="__span-24-35"><a id="__codelineno-24-35" name="__codelineno-24-35" href="#__codelineno-24-35"></a><span class="c1"># │   └── e (-)</span>
-</span><span id="__span-24-36"><a id="__codelineno-24-36" name="__codelineno-24-36" href="#__codelineno-24-36"></a><span class="c1"># └── c</span>
-</span><span id="__span-24-37"><a id="__codelineno-24-37" name="__codelineno-24-37" href="#__codelineno-24-37"></a><span class="c1">#     ├── f (-)</span>
-</span><span id="__span-24-38"><a id="__codelineno-24-38" name="__codelineno-24-38" href="#__codelineno-24-38"></a><span class="c1">#     └── g (+)</span>
+</span><span id="__span-24-12"><a id="__codelineno-24-12" name="__codelineno-24-12" href="#__codelineno-24-12"></a><span class="c1"># Getting subtree with root b</span>
+</span><span id="__span-24-13"><a id="__codelineno-24-13" name="__codelineno-24-13" href="#__codelineno-24-13"></a><span class="hll"><span class="n">root_subtree</span> <span class="o">=</span> <span class="n">get_subtree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="s2">&quot;b&quot;</span><span class="p">)</span>
+</span></span><span id="__span-24-14"><a id="__codelineno-24-14" name="__codelineno-24-14" href="#__codelineno-24-14"></a><span class="n">root_subtree</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
+</span><span id="__span-24-15"><a id="__codelineno-24-15" name="__codelineno-24-15" href="#__codelineno-24-15"></a><span class="c1"># b</span>
+</span><span id="__span-24-16"><a id="__codelineno-24-16" name="__codelineno-24-16" href="#__codelineno-24-16"></a><span class="c1"># ├── d</span>
+</span><span id="__span-24-17"><a id="__codelineno-24-17" name="__codelineno-24-17" href="#__codelineno-24-17"></a><span class="c1"># └── e</span>
+</span></code></pre></div>
+<h3 id="3-pruning-tree-smaller-tree-with-same-root">3. Pruning tree (smaller tree with same root)</h3>
+<div class="language-python highlight"><pre><span></span><code><span id="__span-25-1"><a id="__codelineno-25-1" name="__codelineno-25-1" href="#__codelineno-25-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">str_to_tree</span><span class="p">,</span> <span class="n">prune_tree</span>
+</span><span id="__span-25-2"><a id="__codelineno-25-2" name="__codelineno-25-2" href="#__codelineno-25-2"></a>
+</span><span id="__span-25-3"><a id="__codelineno-25-3" name="__codelineno-25-3" href="#__codelineno-25-3"></a><span class="n">root</span> <span class="o">=</span> <span class="n">str_to_tree</span><span class="p">(</span><span class="s2">&quot;&quot;&quot;</span>
+</span><span id="__span-25-4"><a id="__codelineno-25-4" name="__codelineno-25-4" href="#__codelineno-25-4"></a><span class="s2">a</span>
+</span><span id="__span-25-5"><a id="__codelineno-25-5" name="__codelineno-25-5" href="#__codelineno-25-5"></a><span class="s2">├── b</span>
+</span><span id="__span-25-6"><a id="__codelineno-25-6" name="__codelineno-25-6" href="#__codelineno-25-6"></a><span class="s2">│   ├── d</span>
+</span><span id="__span-25-7"><a id="__codelineno-25-7" name="__codelineno-25-7" href="#__codelineno-25-7"></a><span class="s2">│   └── e</span>
+</span><span id="__span-25-8"><a id="__codelineno-25-8" name="__codelineno-25-8" href="#__codelineno-25-8"></a><span class="s2">└── c</span>
+</span><span id="__span-25-9"><a id="__codelineno-25-9" name="__codelineno-25-9" href="#__codelineno-25-9"></a><span class="s2">    └── f</span>
+</span><span id="__span-25-10"><a id="__codelineno-25-10" name="__codelineno-25-10" href="#__codelineno-25-10"></a><span class="s2">&quot;&quot;&quot;</span><span class="p">)</span>
+</span><span id="__span-25-11"><a id="__codelineno-25-11" name="__codelineno-25-11" href="#__codelineno-25-11"></a>
+</span><span id="__span-25-12"><a id="__codelineno-25-12" name="__codelineno-25-12" href="#__codelineno-25-12"></a><span class="c1"># Prune tree to only path a/b</span>
+</span><span id="__span-25-13"><a id="__codelineno-25-13" name="__codelineno-25-13" href="#__codelineno-25-13"></a><span class="hll"><span class="n">root_pruned</span> <span class="o">=</span> <span class="n">prune_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="s2">&quot;a/b&quot;</span><span class="p">)</span>
+</span></span><span id="__span-25-14"><a id="__codelineno-25-14" name="__codelineno-25-14" href="#__codelineno-25-14"></a><span class="n">root_pruned</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
+</span><span id="__span-25-15"><a id="__codelineno-25-15" name="__codelineno-25-15" href="#__codelineno-25-15"></a><span class="c1"># a</span>
+</span><span id="__span-25-16"><a id="__codelineno-25-16" name="__codelineno-25-16" href="#__codelineno-25-16"></a><span class="c1"># └── b</span>
+</span><span id="__span-25-17"><a id="__codelineno-25-17" name="__codelineno-25-17" href="#__codelineno-25-17"></a><span class="c1">#     ├── d</span>
+</span><span id="__span-25-18"><a id="__codelineno-25-18" name="__codelineno-25-18" href="#__codelineno-25-18"></a><span class="c1">#     └── e</span>
+</span><span id="__span-25-19"><a id="__codelineno-25-19" name="__codelineno-25-19" href="#__codelineno-25-19"></a>
+</span><span id="__span-25-20"><a id="__codelineno-25-20" name="__codelineno-25-20" href="#__codelineno-25-20"></a><span class="c1"># Prune tree to exactly path a/b</span>
+</span><span id="__span-25-21"><a id="__codelineno-25-21" name="__codelineno-25-21" href="#__codelineno-25-21"></a><span class="hll"><span class="n">root_pruned</span> <span class="o">=</span> <span class="n">prune_tree</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="s2">&quot;a/b&quot;</span><span class="p">,</span> <span class="n">exact</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
+</span></span><span id="__span-25-22"><a id="__codelineno-25-22" name="__codelineno-25-22" href="#__codelineno-25-22"></a><span class="n">root_pruned</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
+</span><span id="__span-25-23"><a id="__codelineno-25-23" name="__codelineno-25-23" href="#__codelineno-25-23"></a><span class="c1"># a</span>
+</span><span id="__span-25-24"><a id="__codelineno-25-24" name="__codelineno-25-24" href="#__codelineno-25-24"></a><span class="c1"># └── b</span>
+</span></code></pre></div>
+<h3 id="4-getting-difference-between-two-trees">4. Getting difference between two trees</h3>
+<div class="language-python highlight"><pre><span></span><code><span id="__span-26-1"><a id="__codelineno-26-1" name="__codelineno-26-1" href="#__codelineno-26-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">str_to_tree</span><span class="p">,</span> <span class="n">get_tree_diff</span>
+</span><span id="__span-26-2"><a id="__codelineno-26-2" name="__codelineno-26-2" href="#__codelineno-26-2"></a>
+</span><span id="__span-26-3"><a id="__codelineno-26-3" name="__codelineno-26-3" href="#__codelineno-26-3"></a><span class="n">root</span> <span class="o">=</span> <span class="n">str_to_tree</span><span class="p">(</span><span class="s2">&quot;&quot;&quot;</span>
+</span><span id="__span-26-4"><a id="__codelineno-26-4" name="__codelineno-26-4" href="#__codelineno-26-4"></a><span class="s2">a</span>
+</span><span id="__span-26-5"><a id="__codelineno-26-5" name="__codelineno-26-5" href="#__codelineno-26-5"></a><span class="s2">├── b</span>
+</span><span id="__span-26-6"><a id="__codelineno-26-6" name="__codelineno-26-6" href="#__codelineno-26-6"></a><span class="s2">│   ├── d</span>
+</span><span id="__span-26-7"><a id="__codelineno-26-7" name="__codelineno-26-7" href="#__codelineno-26-7"></a><span class="s2">│   └── e</span>
+</span><span id="__span-26-8"><a id="__codelineno-26-8" name="__codelineno-26-8" href="#__codelineno-26-8"></a><span class="s2">└── c</span>
+</span><span id="__span-26-9"><a id="__codelineno-26-9" name="__codelineno-26-9" href="#__codelineno-26-9"></a><span class="s2">    └── f</span>
+</span><span id="__span-26-10"><a id="__codelineno-26-10" name="__codelineno-26-10" href="#__codelineno-26-10"></a><span class="s2">&quot;&quot;&quot;</span><span class="p">)</span>
+</span><span id="__span-26-11"><a id="__codelineno-26-11" name="__codelineno-26-11" href="#__codelineno-26-11"></a>
+</span><span id="__span-26-12"><a id="__codelineno-26-12" name="__codelineno-26-12" href="#__codelineno-26-12"></a><span class="c1"># Get difference between two trees</span>
+</span><span id="__span-26-13"><a id="__codelineno-26-13" name="__codelineno-26-13" href="#__codelineno-26-13"></a><span class="n">root_other</span> <span class="o">=</span> <span class="n">str_to_tree</span><span class="p">(</span><span class="s2">&quot;&quot;&quot;</span>
+</span><span id="__span-26-14"><a id="__codelineno-26-14" name="__codelineno-26-14" href="#__codelineno-26-14"></a><span class="s2">a</span>
+</span><span id="__span-26-15"><a id="__codelineno-26-15" name="__codelineno-26-15" href="#__codelineno-26-15"></a><span class="s2">├── b</span>
+</span><span id="__span-26-16"><a id="__codelineno-26-16" name="__codelineno-26-16" href="#__codelineno-26-16"></a><span class="s2">│   └── d</span>
+</span><span id="__span-26-17"><a id="__codelineno-26-17" name="__codelineno-26-17" href="#__codelineno-26-17"></a><span class="s2">└── c</span>
+</span><span id="__span-26-18"><a id="__codelineno-26-18" name="__codelineno-26-18" href="#__codelineno-26-18"></a><span class="s2">    └── g</span>
+</span><span id="__span-26-19"><a id="__codelineno-26-19" name="__codelineno-26-19" href="#__codelineno-26-19"></a><span class="s2">&quot;&quot;&quot;</span><span class="p">)</span>
+</span><span id="__span-26-20"><a id="__codelineno-26-20" name="__codelineno-26-20" href="#__codelineno-26-20"></a>
+</span><span id="__span-26-21"><a id="__codelineno-26-21" name="__codelineno-26-21" href="#__codelineno-26-21"></a><span class="n">tree_diff</span> <span class="o">=</span> <span class="n">get_tree_diff</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">root_other</span><span class="p">)</span>
+</span><span id="__span-26-22"><a id="__codelineno-26-22" name="__codelineno-26-22" href="#__codelineno-26-22"></a><span class="hll"><span class="n">tree_diff</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
+</span></span><span id="__span-26-23"><a id="__codelineno-26-23" name="__codelineno-26-23" href="#__codelineno-26-23"></a><span class="c1"># a</span>
+</span><span id="__span-26-24"><a id="__codelineno-26-24" name="__codelineno-26-24" href="#__codelineno-26-24"></a><span class="c1"># ├── b</span>
+</span><span id="__span-26-25"><a id="__codelineno-26-25" name="__codelineno-26-25" href="#__codelineno-26-25"></a><span class="c1"># │   └── e (-)</span>
+</span><span id="__span-26-26"><a id="__codelineno-26-26" name="__codelineno-26-26" href="#__codelineno-26-26"></a><span class="c1"># └── c</span>
+</span><span id="__span-26-27"><a id="__codelineno-26-27" name="__codelineno-26-27" href="#__codelineno-26-27"></a><span class="c1">#     ├── f (-)</span>
+</span><span id="__span-26-28"><a id="__codelineno-26-28" name="__codelineno-26-28" href="#__codelineno-26-28"></a><span class="c1">#     └── g (+)</span>
+</span><span id="__span-26-29"><a id="__codelineno-26-29" name="__codelineno-26-29" href="#__codelineno-26-29"></a>
+</span><span id="__span-26-30"><a id="__codelineno-26-30" name="__codelineno-26-30" href="#__codelineno-26-30"></a><span class="n">tree_diff</span> <span class="o">=</span> <span class="n">get_tree_diff</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">root_other</span><span class="p">,</span> <span class="n">only_diff</span><span class="o">=</span><span class="kc">False</span><span class="p">)</span>
+</span><span id="__span-26-31"><a id="__codelineno-26-31" name="__codelineno-26-31" href="#__codelineno-26-31"></a><span class="hll"><span class="n">tree_diff</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
+</span></span><span id="__span-26-32"><a id="__codelineno-26-32" name="__codelineno-26-32" href="#__codelineno-26-32"></a><span class="c1"># a</span>
+</span><span id="__span-26-33"><a id="__codelineno-26-33" name="__codelineno-26-33" href="#__codelineno-26-33"></a><span class="c1"># ├── b</span>
+</span><span id="__span-26-34"><a id="__codelineno-26-34" name="__codelineno-26-34" href="#__codelineno-26-34"></a><span class="c1"># │   ├── d</span>
+</span><span id="__span-26-35"><a id="__codelineno-26-35" name="__codelineno-26-35" href="#__codelineno-26-35"></a><span class="c1"># │   └── e (-)</span>
+</span><span id="__span-26-36"><a id="__codelineno-26-36" name="__codelineno-26-36" href="#__codelineno-26-36"></a><span class="c1"># └── c</span>
+</span><span id="__span-26-37"><a id="__codelineno-26-37" name="__codelineno-26-37" href="#__codelineno-26-37"></a><span class="c1">#     ├── f (-)</span>
+</span><span id="__span-26-38"><a id="__codelineno-26-38" name="__codelineno-26-38" href="#__codelineno-26-38"></a><span class="c1">#     └── g (+)</span>
 </span></code></pre></div>
 <h2 id="export-tree">Export Tree</h2>
 <p>Tree can be exported to other data types:</p>
@@ -3546,121 +3589,146 @@ <h2 id="export-tree">Export Tree</h2>
 <li>Newick string notation</li>
 <li>Nested dictionary (flat structure and recursive structure)</li>
 <li>pandas DataFrame</li>
+<li>polars DataFrame</li>
 <li>Dot (can save to .dot, .png, .svg, .jpeg files)</li>
 <li>Pillow (can save to .png, .jpg)</li>
 <li>Mermaid Flowchart (can display on .md)</li>
 </ol>
-<div class="language-python highlight"><pre><span></span><code><span id="__span-25-1"><a id="__codelineno-25-1" name="__codelineno-25-1" href="#__codelineno-25-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">Node</span>
-</span><span id="__span-25-2"><a id="__codelineno-25-2" name="__codelineno-25-2" href="#__codelineno-25-2"></a>
-</span><span id="__span-25-3"><a id="__codelineno-25-3" name="__codelineno-25-3" href="#__codelineno-25-3"></a><span class="n">root</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">90</span><span class="p">)</span>
-</span><span id="__span-25-4"><a id="__codelineno-25-4" name="__codelineno-25-4" href="#__codelineno-25-4"></a><span class="n">b</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">65</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
-</span><span id="__span-25-5"><a id="__codelineno-25-5" name="__codelineno-25-5" href="#__codelineno-25-5"></a><span class="n">c</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">60</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
-</span><span id="__span-25-6"><a id="__codelineno-25-6" name="__codelineno-25-6" href="#__codelineno-25-6"></a><span class="n">d</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;d&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">40</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
-</span><span id="__span-25-7"><a id="__codelineno-25-7" name="__codelineno-25-7" href="#__codelineno-25-7"></a><span class="n">e</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;e&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">35</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
-</span><span id="__span-25-8"><a id="__codelineno-25-8" name="__codelineno-25-8" href="#__codelineno-25-8"></a><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
-</span><span id="__span-25-9"><a id="__codelineno-25-9" name="__codelineno-25-9" href="#__codelineno-25-9"></a><span class="c1"># a</span>
-</span><span id="__span-25-10"><a id="__codelineno-25-10" name="__codelineno-25-10" href="#__codelineno-25-10"></a><span class="c1"># ├── b</span>
-</span><span id="__span-25-11"><a id="__codelineno-25-11" name="__codelineno-25-11" href="#__codelineno-25-11"></a><span class="c1"># │   ├── d</span>
-</span><span id="__span-25-12"><a id="__codelineno-25-12" name="__codelineno-25-12" href="#__codelineno-25-12"></a><span class="c1"># │   └── e</span>
-</span><span id="__span-25-13"><a id="__codelineno-25-13" name="__codelineno-25-13" href="#__codelineno-25-13"></a><span class="c1"># └── c</span>
-</span></code></pre></div>
-<div class="tabbed-set tabbed-alternate" data-tabs="10:7"><input checked="checked" id="__tabbed_10_1" name="__tabbed_10" type="radio" /><input id="__tabbed_10_2" name="__tabbed_10" type="radio" /><input id="__tabbed_10_3" name="__tabbed_10" type="radio" /><input id="__tabbed_10_4" name="__tabbed_10" type="radio" /><input id="__tabbed_10_5" name="__tabbed_10" type="radio" /><input id="__tabbed_10_6" name="__tabbed_10" type="radio" /><input id="__tabbed_10_7" name="__tabbed_10" type="radio" /><div class="tabbed-labels"><label for="__tabbed_10_1">Newick string notation</label><label for="__tabbed_10_2">Dictionary (flat structure)</label><label for="__tabbed_10_3">Dictionary (recursive structure)</label><label for="__tabbed_10_4">pandas DataFrame</label><label for="__tabbed_10_5">Dot</label><label for="__tabbed_10_6">Pillow</label><label for="__tabbed_10_7">Mermaid Flowchart</label></div>
-<div class="tabbed-content">
-<div class="tabbed-block">
-<div class="language-python highlight"><pre><span></span><code><span id="__span-26-1"><a id="__codelineno-26-1" name="__codelineno-26-1" href="#__codelineno-26-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">tree_to_newick</span>
-</span><span id="__span-26-2"><a id="__codelineno-26-2" name="__codelineno-26-2" href="#__codelineno-26-2"></a>
-</span><span id="__span-26-3"><a id="__codelineno-26-3" name="__codelineno-26-3" href="#__codelineno-26-3"></a><span class="hll"><span class="n">tree_to_newick</span><span class="p">(</span><span class="n">root</span><span class="p">)</span>
-</span></span><span id="__span-26-4"><a id="__codelineno-26-4" name="__codelineno-26-4" href="#__codelineno-26-4"></a><span class="c1"># &#39;((d,e)b,c)a&#39;</span>
-</span><span id="__span-26-5"><a id="__codelineno-26-5" name="__codelineno-26-5" href="#__codelineno-26-5"></a>
-</span><span id="__span-26-6"><a id="__codelineno-26-6" name="__codelineno-26-6" href="#__codelineno-26-6"></a><span class="hll"><span class="n">tree_to_newick</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;age&quot;</span><span class="p">])</span>
-</span></span><span id="__span-26-7"><a id="__codelineno-26-7" name="__codelineno-26-7" href="#__codelineno-26-7"></a><span class="c1"># &#39;((d[&amp;&amp;NHX:age=40],e[&amp;&amp;NHX:age=35])b[&amp;&amp;NHX:age=65],c[&amp;&amp;NHX:age=60])a[&amp;&amp;NHX:age=90]&#39;</span>
-</span></code></pre></div>
-</div>
-<div class="tabbed-block">
-<div class="language-python highlight"><pre><span></span><code><span id="__span-27-1"><a id="__codelineno-27-1" name="__codelineno-27-1" href="#__codelineno-27-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">tree_to_dict</span>
+<div class="language-python highlight"><pre><span></span><code><span id="__span-27-1"><a id="__codelineno-27-1" name="__codelineno-27-1" href="#__codelineno-27-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">Node</span>
 </span><span id="__span-27-2"><a id="__codelineno-27-2" name="__codelineno-27-2" href="#__codelineno-27-2"></a>
-</span><span id="__span-27-3"><a id="__codelineno-27-3" name="__codelineno-27-3" href="#__codelineno-27-3"></a><span class="hll"><span class="n">tree_to_dict</span><span class="p">(</span>
-</span></span><span id="__span-27-4"><a id="__codelineno-27-4" name="__codelineno-27-4" href="#__codelineno-27-4"></a><span class="hll">   <span class="n">root</span><span class="p">,</span>
-</span></span><span id="__span-27-5"><a id="__codelineno-27-5" name="__codelineno-27-5" href="#__codelineno-27-5"></a><span class="hll">   <span class="n">name_key</span><span class="o">=</span><span class="s2">&quot;name&quot;</span><span class="p">,</span>
-</span></span><span id="__span-27-6"><a id="__codelineno-27-6" name="__codelineno-27-6" href="#__codelineno-27-6"></a><span class="hll">   <span class="n">parent_key</span><span class="o">=</span><span class="s2">&quot;parent&quot;</span><span class="p">,</span>
-</span></span><span id="__span-27-7"><a id="__codelineno-27-7" name="__codelineno-27-7" href="#__codelineno-27-7"></a><span class="hll">   <span class="n">attr_dict</span><span class="o">=</span><span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="s2">&quot;person age&quot;</span><span class="p">}</span>
-</span></span><span id="__span-27-8"><a id="__codelineno-27-8" name="__codelineno-27-8" href="#__codelineno-27-8"></a><span class="hll"><span class="p">)</span>
-</span></span><span id="__span-27-9"><a id="__codelineno-27-9" name="__codelineno-27-9" href="#__codelineno-27-9"></a><span class="c1"># {</span>
-</span><span id="__span-27-10"><a id="__codelineno-27-10" name="__codelineno-27-10" href="#__codelineno-27-10"></a><span class="c1">#    &#39;/a&#39;: {&#39;name&#39;: &#39;a&#39;, &#39;parent&#39;: None, &#39;person age&#39;: 90},</span>
-</span><span id="__span-27-11"><a id="__codelineno-27-11" name="__codelineno-27-11" href="#__codelineno-27-11"></a><span class="c1">#    &#39;/a/b&#39;: {&#39;name&#39;: &#39;b&#39;, &#39;parent&#39;: &#39;a&#39;, &#39;person age&#39;: 65},</span>
-</span><span id="__span-27-12"><a id="__codelineno-27-12" name="__codelineno-27-12" href="#__codelineno-27-12"></a><span class="c1">#    &#39;/a/b/d&#39;: {&#39;name&#39;: &#39;d&#39;, &#39;parent&#39;: &#39;b&#39;, &#39;person age&#39;: 40},</span>
-</span><span id="__span-27-13"><a id="__codelineno-27-13" name="__codelineno-27-13" href="#__codelineno-27-13"></a><span class="c1">#    &#39;/a/b/e&#39;: {&#39;name&#39;: &#39;e&#39;, &#39;parent&#39;: &#39;b&#39;, &#39;person age&#39;: 35},</span>
-</span><span id="__span-27-14"><a id="__codelineno-27-14" name="__codelineno-27-14" href="#__codelineno-27-14"></a><span class="c1">#    &#39;/a/c&#39;: {&#39;name&#39;: &#39;c&#39;, &#39;parent&#39;: &#39;a&#39;, &#39;person age&#39;: 60}</span>
-</span><span id="__span-27-15"><a id="__codelineno-27-15" name="__codelineno-27-15" href="#__codelineno-27-15"></a><span class="c1"># }</span>
+</span><span id="__span-27-3"><a id="__codelineno-27-3" name="__codelineno-27-3" href="#__codelineno-27-3"></a><span class="n">root</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;a&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">90</span><span class="p">)</span>
+</span><span id="__span-27-4"><a id="__codelineno-27-4" name="__codelineno-27-4" href="#__codelineno-27-4"></a><span class="n">b</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;b&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">65</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
+</span><span id="__span-27-5"><a id="__codelineno-27-5" name="__codelineno-27-5" href="#__codelineno-27-5"></a><span class="n">c</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;c&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">60</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">root</span><span class="p">)</span>
+</span><span id="__span-27-6"><a id="__codelineno-27-6" name="__codelineno-27-6" href="#__codelineno-27-6"></a><span class="n">d</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;d&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">40</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
+</span><span id="__span-27-7"><a id="__codelineno-27-7" name="__codelineno-27-7" href="#__codelineno-27-7"></a><span class="n">e</span> <span class="o">=</span> <span class="n">Node</span><span class="p">(</span><span class="s2">&quot;e&quot;</span><span class="p">,</span> <span class="n">age</span><span class="o">=</span><span class="mi">35</span><span class="p">,</span> <span class="n">parent</span><span class="o">=</span><span class="n">b</span><span class="p">)</span>
+</span><span id="__span-27-8"><a id="__codelineno-27-8" name="__codelineno-27-8" href="#__codelineno-27-8"></a><span class="n">root</span><span class="o">.</span><span class="n">show</span><span class="p">()</span>
+</span><span id="__span-27-9"><a id="__codelineno-27-9" name="__codelineno-27-9" href="#__codelineno-27-9"></a><span class="c1"># a</span>
+</span><span id="__span-27-10"><a id="__codelineno-27-10" name="__codelineno-27-10" href="#__codelineno-27-10"></a><span class="c1"># ├── b</span>
+</span><span id="__span-27-11"><a id="__codelineno-27-11" name="__codelineno-27-11" href="#__codelineno-27-11"></a><span class="c1"># │   ├── d</span>
+</span><span id="__span-27-12"><a id="__codelineno-27-12" name="__codelineno-27-12" href="#__codelineno-27-12"></a><span class="c1"># │   └── e</span>
+</span><span id="__span-27-13"><a id="__codelineno-27-13" name="__codelineno-27-13" href="#__codelineno-27-13"></a><span class="c1"># └── c</span>
 </span></code></pre></div>
-</div>
+<div class="tabbed-set tabbed-alternate" data-tabs="11:8"><input checked="checked" id="__tabbed_11_1" name="__tabbed_11" type="radio" /><input id="__tabbed_11_2" name="__tabbed_11" type="radio" /><input id="__tabbed_11_3" name="__tabbed_11" type="radio" /><input id="__tabbed_11_4" name="__tabbed_11" type="radio" /><input id="__tabbed_11_5" name="__tabbed_11" type="radio" /><input id="__tabbed_11_6" name="__tabbed_11" type="radio" /><input id="__tabbed_11_7" name="__tabbed_11" type="radio" /><input id="__tabbed_11_8" name="__tabbed_11" type="radio" /><div class="tabbed-labels"><label for="__tabbed_11_1">Newick string notation</label><label for="__tabbed_11_2">Dictionary (flat structure)</label><label for="__tabbed_11_3">Dictionary (recursive structure)</label><label for="__tabbed_11_4">pandas DataFrame</label><label for="__tabbed_11_5">polars DataFrame</label><label for="__tabbed_11_6">Dot</label><label for="__tabbed_11_7">Pillow</label><label for="__tabbed_11_8">Mermaid Flowchart</label></div>
+<div class="tabbed-content">
 <div class="tabbed-block">
-<div class="language-python highlight"><pre><span></span><code><span id="__span-28-1"><a id="__codelineno-28-1" name="__codelineno-28-1" href="#__codelineno-28-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">tree_to_nested_dict</span>
+<div class="language-python highlight"><pre><span></span><code><span id="__span-28-1"><a id="__codelineno-28-1" name="__codelineno-28-1" href="#__codelineno-28-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">tree_to_newick</span>
 </span><span id="__span-28-2"><a id="__codelineno-28-2" name="__codelineno-28-2" href="#__codelineno-28-2"></a>
-</span><span id="__span-28-3"><a id="__codelineno-28-3" name="__codelineno-28-3" href="#__codelineno-28-3"></a><span class="hll"><span class="n">tree_to_nested_dict</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">all_attrs</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
-</span></span><span id="__span-28-4"><a id="__codelineno-28-4" name="__codelineno-28-4" href="#__codelineno-28-4"></a><span class="c1"># {</span>
-</span><span id="__span-28-5"><a id="__codelineno-28-5" name="__codelineno-28-5" href="#__codelineno-28-5"></a><span class="c1">#    &#39;name&#39;: &#39;a&#39;,</span>
-</span><span id="__span-28-6"><a id="__codelineno-28-6" name="__codelineno-28-6" href="#__codelineno-28-6"></a><span class="c1">#    &#39;age&#39;: 90,</span>
-</span><span id="__span-28-7"><a id="__codelineno-28-7" name="__codelineno-28-7" href="#__codelineno-28-7"></a><span class="c1">#    &#39;children&#39;: [</span>
-</span><span id="__span-28-8"><a id="__codelineno-28-8" name="__codelineno-28-8" href="#__codelineno-28-8"></a><span class="c1">#       {</span>
-</span><span id="__span-28-9"><a id="__codelineno-28-9" name="__codelineno-28-9" href="#__codelineno-28-9"></a><span class="c1">#          &#39;name&#39;: &#39;b&#39;,</span>
-</span><span id="__span-28-10"><a id="__codelineno-28-10" name="__codelineno-28-10" href="#__codelineno-28-10"></a><span class="c1">#          &#39;age&#39;: 65,</span>
-</span><span id="__span-28-11"><a id="__codelineno-28-11" name="__codelineno-28-11" href="#__codelineno-28-11"></a><span class="c1">#          &#39;children&#39;: [</span>
-</span><span id="__span-28-12"><a id="__codelineno-28-12" name="__codelineno-28-12" href="#__codelineno-28-12"></a><span class="c1">#             {</span>
-</span><span id="__span-28-13"><a id="__codelineno-28-13" name="__codelineno-28-13" href="#__codelineno-28-13"></a><span class="c1">#                &#39;name&#39;: &#39;d&#39;,</span>
-</span><span id="__span-28-14"><a id="__codelineno-28-14" name="__codelineno-28-14" href="#__codelineno-28-14"></a><span class="c1">#                &#39;age&#39;: 40</span>
-</span><span id="__span-28-15"><a id="__codelineno-28-15" name="__codelineno-28-15" href="#__codelineno-28-15"></a><span class="c1">#             },</span>
-</span><span id="__span-28-16"><a id="__codelineno-28-16" name="__codelineno-28-16" href="#__codelineno-28-16"></a><span class="c1">#             {</span>
-</span><span id="__span-28-17"><a id="__codelineno-28-17" name="__codelineno-28-17" href="#__codelineno-28-17"></a><span class="c1">#                &#39;name&#39;: &#39;e&#39;,</span>
-</span><span id="__span-28-18"><a id="__codelineno-28-18" name="__codelineno-28-18" href="#__codelineno-28-18"></a><span class="c1">#                &#39;age&#39;: 35</span>
-</span><span id="__span-28-19"><a id="__codelineno-28-19" name="__codelineno-28-19" href="#__codelineno-28-19"></a><span class="c1">#             }</span>
-</span><span id="__span-28-20"><a id="__codelineno-28-20" name="__codelineno-28-20" href="#__codelineno-28-20"></a><span class="c1">#          ]</span>
-</span><span id="__span-28-21"><a id="__codelineno-28-21" name="__codelineno-28-21" href="#__codelineno-28-21"></a><span class="c1">#       },</span>
-</span><span id="__span-28-22"><a id="__codelineno-28-22" name="__codelineno-28-22" href="#__codelineno-28-22"></a><span class="c1">#       {</span>
-</span><span id="__span-28-23"><a id="__codelineno-28-23" name="__codelineno-28-23" href="#__codelineno-28-23"></a><span class="c1">#          &#39;name&#39;: &#39;c&#39;,</span>
-</span><span id="__span-28-24"><a id="__codelineno-28-24" name="__codelineno-28-24" href="#__codelineno-28-24"></a><span class="c1">#          &#39;age&#39;: 60</span>
-</span><span id="__span-28-25"><a id="__codelineno-28-25" name="__codelineno-28-25" href="#__codelineno-28-25"></a><span class="c1">#       }</span>
-</span><span id="__span-28-26"><a id="__codelineno-28-26" name="__codelineno-28-26" href="#__codelineno-28-26"></a><span class="c1">#    ]</span>
-</span><span id="__span-28-27"><a id="__codelineno-28-27" name="__codelineno-28-27" href="#__codelineno-28-27"></a><span class="c1"># }</span>
+</span><span id="__span-28-3"><a id="__codelineno-28-3" name="__codelineno-28-3" href="#__codelineno-28-3"></a><span class="hll"><span class="n">tree_to_newick</span><span class="p">(</span><span class="n">root</span><span class="p">)</span>
+</span></span><span id="__span-28-4"><a id="__codelineno-28-4" name="__codelineno-28-4" href="#__codelineno-28-4"></a><span class="c1"># &#39;((d,e)b,c)a&#39;</span>
+</span><span id="__span-28-5"><a id="__codelineno-28-5" name="__codelineno-28-5" href="#__codelineno-28-5"></a>
+</span><span id="__span-28-6"><a id="__codelineno-28-6" name="__codelineno-28-6" href="#__codelineno-28-6"></a><span class="hll"><span class="n">tree_to_newick</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">attr_list</span><span class="o">=</span><span class="p">[</span><span class="s2">&quot;age&quot;</span><span class="p">])</span>
+</span></span><span id="__span-28-7"><a id="__codelineno-28-7" name="__codelineno-28-7" href="#__codelineno-28-7"></a><span class="c1"># &#39;((d[&amp;&amp;NHX:age=40],e[&amp;&amp;NHX:age=35])b[&amp;&amp;NHX:age=65],c[&amp;&amp;NHX:age=60])a[&amp;&amp;NHX:age=90]&#39;</span>
 </span></code></pre></div>
 </div>
 <div class="tabbed-block">
-<div class="language-python highlight"><pre><span></span><code><span id="__span-29-1"><a id="__codelineno-29-1" name="__codelineno-29-1" href="#__codelineno-29-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">tree_to_dataframe</span>
+<div class="language-python highlight"><pre><span></span><code><span id="__span-29-1"><a id="__codelineno-29-1" name="__codelineno-29-1" href="#__codelineno-29-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">tree_to_dict</span>
 </span><span id="__span-29-2"><a id="__codelineno-29-2" name="__codelineno-29-2" href="#__codelineno-29-2"></a>
-</span><span id="__span-29-3"><a id="__codelineno-29-3" name="__codelineno-29-3" href="#__codelineno-29-3"></a><span class="hll"><span class="n">tree_to_dataframe</span><span class="p">(</span>
+</span><span id="__span-29-3"><a id="__codelineno-29-3" name="__codelineno-29-3" href="#__codelineno-29-3"></a><span class="hll"><span class="n">tree_to_dict</span><span class="p">(</span>
 </span></span><span id="__span-29-4"><a id="__codelineno-29-4" name="__codelineno-29-4" href="#__codelineno-29-4"></a><span class="hll">   <span class="n">root</span><span class="p">,</span>
-</span></span><span id="__span-29-5"><a id="__codelineno-29-5" name="__codelineno-29-5" href="#__codelineno-29-5"></a><span class="hll">   <span class="n">name_col</span><span class="o">=</span><span class="s2">&quot;name&quot;</span><span class="p">,</span>
-</span></span><span id="__span-29-6"><a id="__codelineno-29-6" name="__codelineno-29-6" href="#__codelineno-29-6"></a><span class="hll">   <span class="n">parent_col</span><span class="o">=</span><span class="s2">&quot;parent&quot;</span><span class="p">,</span>
-</span></span><span id="__span-29-7"><a id="__codelineno-29-7" name="__codelineno-29-7" href="#__codelineno-29-7"></a><span class="hll">   <span class="n">path_col</span><span class="o">=</span><span class="s2">&quot;path&quot;</span><span class="p">,</span>
-</span></span><span id="__span-29-8"><a id="__codelineno-29-8" name="__codelineno-29-8" href="#__codelineno-29-8"></a><span class="hll">   <span class="n">attr_dict</span><span class="o">=</span><span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="s2">&quot;person age&quot;</span><span class="p">}</span>
-</span></span><span id="__span-29-9"><a id="__codelineno-29-9" name="__codelineno-29-9" href="#__codelineno-29-9"></a><span class="hll"><span class="p">)</span>
-</span></span><span id="__span-29-10"><a id="__codelineno-29-10" name="__codelineno-29-10" href="#__codelineno-29-10"></a><span class="c1">#      path name parent  person age</span>
-</span><span id="__span-29-11"><a id="__codelineno-29-11" name="__codelineno-29-11" href="#__codelineno-29-11"></a><span class="c1"># 0      /a    a   None          90</span>
-</span><span id="__span-29-12"><a id="__codelineno-29-12" name="__codelineno-29-12" href="#__codelineno-29-12"></a><span class="c1"># 1    /a/b    b      a          65</span>
-</span><span id="__span-29-13"><a id="__codelineno-29-13" name="__codelineno-29-13" href="#__codelineno-29-13"></a><span class="c1"># 2  /a/b/d    d      b          40</span>
-</span><span id="__span-29-14"><a id="__codelineno-29-14" name="__codelineno-29-14" href="#__codelineno-29-14"></a><span class="c1"># 3  /a/b/e    e      b          35</span>
-</span><span id="__span-29-15"><a id="__codelineno-29-15" name="__codelineno-29-15" href="#__codelineno-29-15"></a><span class="c1"># 4    /a/c    c      a          60</span>
+</span></span><span id="__span-29-5"><a id="__codelineno-29-5" name="__codelineno-29-5" href="#__codelineno-29-5"></a><span class="hll">   <span class="n">name_key</span><span class="o">=</span><span class="s2">&quot;name&quot;</span><span class="p">,</span>
+</span></span><span id="__span-29-6"><a id="__codelineno-29-6" name="__codelineno-29-6" href="#__codelineno-29-6"></a><span class="hll">   <span class="n">parent_key</span><span class="o">=</span><span class="s2">&quot;parent&quot;</span><span class="p">,</span>
+</span></span><span id="__span-29-7"><a id="__codelineno-29-7" name="__codelineno-29-7" href="#__codelineno-29-7"></a><span class="hll">   <span class="n">attr_dict</span><span class="o">=</span><span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="s2">&quot;person age&quot;</span><span class="p">}</span>
+</span></span><span id="__span-29-8"><a id="__codelineno-29-8" name="__codelineno-29-8" href="#__codelineno-29-8"></a><span class="hll"><span class="p">)</span>
+</span></span><span id="__span-29-9"><a id="__codelineno-29-9" name="__codelineno-29-9" href="#__codelineno-29-9"></a><span class="c1"># {</span>
+</span><span id="__span-29-10"><a id="__codelineno-29-10" name="__codelineno-29-10" href="#__codelineno-29-10"></a><span class="c1">#    &#39;/a&#39;: {&#39;name&#39;: &#39;a&#39;, &#39;parent&#39;: None, &#39;person age&#39;: 90},</span>
+</span><span id="__span-29-11"><a id="__codelineno-29-11" name="__codelineno-29-11" href="#__codelineno-29-11"></a><span class="c1">#    &#39;/a/b&#39;: {&#39;name&#39;: &#39;b&#39;, &#39;parent&#39;: &#39;a&#39;, &#39;person age&#39;: 65},</span>
+</span><span id="__span-29-12"><a id="__codelineno-29-12" name="__codelineno-29-12" href="#__codelineno-29-12"></a><span class="c1">#    &#39;/a/b/d&#39;: {&#39;name&#39;: &#39;d&#39;, &#39;parent&#39;: &#39;b&#39;, &#39;person age&#39;: 40},</span>
+</span><span id="__span-29-13"><a id="__codelineno-29-13" name="__codelineno-29-13" href="#__codelineno-29-13"></a><span class="c1">#    &#39;/a/b/e&#39;: {&#39;name&#39;: &#39;e&#39;, &#39;parent&#39;: &#39;b&#39;, &#39;person age&#39;: 35},</span>
+</span><span id="__span-29-14"><a id="__codelineno-29-14" name="__codelineno-29-14" href="#__codelineno-29-14"></a><span class="c1">#    &#39;/a/c&#39;: {&#39;name&#39;: &#39;c&#39;, &#39;parent&#39;: &#39;a&#39;, &#39;person age&#39;: 60}</span>
+</span><span id="__span-29-15"><a id="__codelineno-29-15" name="__codelineno-29-15" href="#__codelineno-29-15"></a><span class="c1"># }</span>
 </span></code></pre></div>
 </div>
 <div class="tabbed-block">
-<div class="language-python highlight"><pre><span></span><code><span id="__span-30-1"><a id="__codelineno-30-1" name="__codelineno-30-1" href="#__codelineno-30-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">tree_to_dot</span>
+<div class="language-python highlight"><pre><span></span><code><span id="__span-30-1"><a id="__codelineno-30-1" name="__codelineno-30-1" href="#__codelineno-30-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">tree_to_nested_dict</span>
 </span><span id="__span-30-2"><a id="__codelineno-30-2" name="__codelineno-30-2" href="#__codelineno-30-2"></a>
-</span><span id="__span-30-3"><a id="__codelineno-30-3" name="__codelineno-30-3" href="#__codelineno-30-3"></a><span class="hll"><span class="n">graph</span> <span class="o">=</span> <span class="n">tree_to_dot</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">node_colour</span><span class="o">=</span><span class="s2">&quot;gold&quot;</span><span class="p">)</span>
-</span></span><span id="__span-30-4"><a id="__codelineno-30-4" name="__codelineno-30-4" href="#__codelineno-30-4"></a><span class="n">graph</span><span class="o">.</span><span class="n">write_png</span><span class="p">(</span><span class="s2">&quot;assets/demo/dot.png&quot;</span><span class="p">)</span>
+</span><span id="__span-30-3"><a id="__codelineno-30-3" name="__codelineno-30-3" href="#__codelineno-30-3"></a><span class="hll"><span class="n">tree_to_nested_dict</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">all_attrs</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
+</span></span><span id="__span-30-4"><a id="__codelineno-30-4" name="__codelineno-30-4" href="#__codelineno-30-4"></a><span class="c1"># {</span>
+</span><span id="__span-30-5"><a id="__codelineno-30-5" name="__codelineno-30-5" href="#__codelineno-30-5"></a><span class="c1">#    &#39;name&#39;: &#39;a&#39;,</span>
+</span><span id="__span-30-6"><a id="__codelineno-30-6" name="__codelineno-30-6" href="#__codelineno-30-6"></a><span class="c1">#    &#39;age&#39;: 90,</span>
+</span><span id="__span-30-7"><a id="__codelineno-30-7" name="__codelineno-30-7" href="#__codelineno-30-7"></a><span class="c1">#    &#39;children&#39;: [</span>
+</span><span id="__span-30-8"><a id="__codelineno-30-8" name="__codelineno-30-8" href="#__codelineno-30-8"></a><span class="c1">#       {</span>
+</span><span id="__span-30-9"><a id="__codelineno-30-9" name="__codelineno-30-9" href="#__codelineno-30-9"></a><span class="c1">#          &#39;name&#39;: &#39;b&#39;,</span>
+</span><span id="__span-30-10"><a id="__codelineno-30-10" name="__codelineno-30-10" href="#__codelineno-30-10"></a><span class="c1">#          &#39;age&#39;: 65,</span>
+</span><span id="__span-30-11"><a id="__codelineno-30-11" name="__codelineno-30-11" href="#__codelineno-30-11"></a><span class="c1">#          &#39;children&#39;: [</span>
+</span><span id="__span-30-12"><a id="__codelineno-30-12" name="__codelineno-30-12" href="#__codelineno-30-12"></a><span class="c1">#             {</span>
+</span><span id="__span-30-13"><a id="__codelineno-30-13" name="__codelineno-30-13" href="#__codelineno-30-13"></a><span class="c1">#                &#39;name&#39;: &#39;d&#39;,</span>
+</span><span id="__span-30-14"><a id="__codelineno-30-14" name="__codelineno-30-14" href="#__codelineno-30-14"></a><span class="c1">#                &#39;age&#39;: 40</span>
+</span><span id="__span-30-15"><a id="__codelineno-30-15" name="__codelineno-30-15" href="#__codelineno-30-15"></a><span class="c1">#             },</span>
+</span><span id="__span-30-16"><a id="__codelineno-30-16" name="__codelineno-30-16" href="#__codelineno-30-16"></a><span class="c1">#             {</span>
+</span><span id="__span-30-17"><a id="__codelineno-30-17" name="__codelineno-30-17" href="#__codelineno-30-17"></a><span class="c1">#                &#39;name&#39;: &#39;e&#39;,</span>
+</span><span id="__span-30-18"><a id="__codelineno-30-18" name="__codelineno-30-18" href="#__codelineno-30-18"></a><span class="c1">#                &#39;age&#39;: 35</span>
+</span><span id="__span-30-19"><a id="__codelineno-30-19" name="__codelineno-30-19" href="#__codelineno-30-19"></a><span class="c1">#             }</span>
+</span><span id="__span-30-20"><a id="__codelineno-30-20" name="__codelineno-30-20" href="#__codelineno-30-20"></a><span class="c1">#          ]</span>
+</span><span id="__span-30-21"><a id="__codelineno-30-21" name="__codelineno-30-21" href="#__codelineno-30-21"></a><span class="c1">#       },</span>
+</span><span id="__span-30-22"><a id="__codelineno-30-22" name="__codelineno-30-22" href="#__codelineno-30-22"></a><span class="c1">#       {</span>
+</span><span id="__span-30-23"><a id="__codelineno-30-23" name="__codelineno-30-23" href="#__codelineno-30-23"></a><span class="c1">#          &#39;name&#39;: &#39;c&#39;,</span>
+</span><span id="__span-30-24"><a id="__codelineno-30-24" name="__codelineno-30-24" href="#__codelineno-30-24"></a><span class="c1">#          &#39;age&#39;: 60</span>
+</span><span id="__span-30-25"><a id="__codelineno-30-25" name="__codelineno-30-25" href="#__codelineno-30-25"></a><span class="c1">#       }</span>
+</span><span id="__span-30-26"><a id="__codelineno-30-26" name="__codelineno-30-26" href="#__codelineno-30-26"></a><span class="c1">#    ]</span>
+</span><span id="__span-30-27"><a id="__codelineno-30-27" name="__codelineno-30-27" href="#__codelineno-30-27"></a><span class="c1"># }</span>
 </span></code></pre></div>
 </div>
 <div class="tabbed-block">
-<div class="language-python highlight"><pre><span></span><code><span id="__span-31-1"><a id="__codelineno-31-1" name="__codelineno-31-1" href="#__codelineno-31-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">tree_to_pillow</span>
+<div class="language-python highlight"><pre><span></span><code><span id="__span-31-1"><a id="__codelineno-31-1" name="__codelineno-31-1" href="#__codelineno-31-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">tree_to_dataframe</span>
 </span><span id="__span-31-2"><a id="__codelineno-31-2" name="__codelineno-31-2" href="#__codelineno-31-2"></a>
-</span><span id="__span-31-3"><a id="__codelineno-31-3" name="__codelineno-31-3" href="#__codelineno-31-3"></a><span class="hll"><span class="n">pillow_image</span> <span class="o">=</span> <span class="n">tree_to_pillow</span><span class="p">(</span><span class="n">root</span><span class="p">)</span>
-</span></span><span id="__span-31-4"><a id="__codelineno-31-4" name="__codelineno-31-4" href="#__codelineno-31-4"></a><span class="n">pillow_image</span><span class="o">.</span><span class="n">save</span><span class="p">(</span><span class="s2">&quot;assets/demo/pillow.png&quot;</span><span class="p">)</span>
+</span><span id="__span-31-3"><a id="__codelineno-31-3" name="__codelineno-31-3" href="#__codelineno-31-3"></a><span class="hll"><span class="n">tree_to_dataframe</span><span class="p">(</span>
+</span></span><span id="__span-31-4"><a id="__codelineno-31-4" name="__codelineno-31-4" href="#__codelineno-31-4"></a><span class="hll">   <span class="n">root</span><span class="p">,</span>
+</span></span><span id="__span-31-5"><a id="__codelineno-31-5" name="__codelineno-31-5" href="#__codelineno-31-5"></a><span class="hll">   <span class="n">name_col</span><span class="o">=</span><span class="s2">&quot;name&quot;</span><span class="p">,</span>
+</span></span><span id="__span-31-6"><a id="__codelineno-31-6" name="__codelineno-31-6" href="#__codelineno-31-6"></a><span class="hll">   <span class="n">parent_col</span><span class="o">=</span><span class="s2">&quot;parent&quot;</span><span class="p">,</span>
+</span></span><span id="__span-31-7"><a id="__codelineno-31-7" name="__codelineno-31-7" href="#__codelineno-31-7"></a><span class="hll">   <span class="n">path_col</span><span class="o">=</span><span class="s2">&quot;path&quot;</span><span class="p">,</span>
+</span></span><span id="__span-31-8"><a id="__codelineno-31-8" name="__codelineno-31-8" href="#__codelineno-31-8"></a><span class="hll">   <span class="n">attr_dict</span><span class="o">=</span><span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="s2">&quot;person age&quot;</span><span class="p">}</span>
+</span></span><span id="__span-31-9"><a id="__codelineno-31-9" name="__codelineno-31-9" href="#__codelineno-31-9"></a><span class="hll"><span class="p">)</span>
+</span></span><span id="__span-31-10"><a id="__codelineno-31-10" name="__codelineno-31-10" href="#__codelineno-31-10"></a><span class="c1">#      path name parent  person age</span>
+</span><span id="__span-31-11"><a id="__codelineno-31-11" name="__codelineno-31-11" href="#__codelineno-31-11"></a><span class="c1"># 0      /a    a   None          90</span>
+</span><span id="__span-31-12"><a id="__codelineno-31-12" name="__codelineno-31-12" href="#__codelineno-31-12"></a><span class="c1"># 1    /a/b    b      a          65</span>
+</span><span id="__span-31-13"><a id="__codelineno-31-13" name="__codelineno-31-13" href="#__codelineno-31-13"></a><span class="c1"># 2  /a/b/d    d      b          40</span>
+</span><span id="__span-31-14"><a id="__codelineno-31-14" name="__codelineno-31-14" href="#__codelineno-31-14"></a><span class="c1"># 3  /a/b/e    e      b          35</span>
+</span><span id="__span-31-15"><a id="__codelineno-31-15" name="__codelineno-31-15" href="#__codelineno-31-15"></a><span class="c1"># 4    /a/c    c      a          60</span>
 </span></code></pre></div>
 </div>
 <div class="tabbed-block">
-<div class="language-python highlight"><pre><span></span><code><span id="__span-32-1"><a id="__codelineno-32-1" name="__codelineno-32-1" href="#__codelineno-32-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">tree_to_mermaid</span>
+<div class="language-python highlight"><pre><span></span><code><span id="__span-32-1"><a id="__codelineno-32-1" name="__codelineno-32-1" href="#__codelineno-32-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">tree_to_polars</span>
 </span><span id="__span-32-2"><a id="__codelineno-32-2" name="__codelineno-32-2" href="#__codelineno-32-2"></a>
-</span><span id="__span-32-3"><a id="__codelineno-32-3" name="__codelineno-32-3" href="#__codelineno-32-3"></a><span class="hll"><span class="n">mermaid_md</span> <span class="o">=</span> <span class="n">tree_to_mermaid</span><span class="p">(</span><span class="n">root</span><span class="p">)</span>
-</span></span><span id="__span-32-4"><a id="__codelineno-32-4" name="__codelineno-32-4" href="#__codelineno-32-4"></a><span class="nb">print</span><span class="p">(</span><span class="n">mermaid_md</span><span class="p">)</span>
+</span><span id="__span-32-3"><a id="__codelineno-32-3" name="__codelineno-32-3" href="#__codelineno-32-3"></a><span class="hll"><span class="n">tree_to_polars</span><span class="p">(</span>
+</span></span><span id="__span-32-4"><a id="__codelineno-32-4" name="__codelineno-32-4" href="#__codelineno-32-4"></a><span class="hll">   <span class="n">root</span><span class="p">,</span>
+</span></span><span id="__span-32-5"><a id="__codelineno-32-5" name="__codelineno-32-5" href="#__codelineno-32-5"></a><span class="hll">   <span class="n">name_col</span><span class="o">=</span><span class="s2">&quot;name&quot;</span><span class="p">,</span>
+</span></span><span id="__span-32-6"><a id="__codelineno-32-6" name="__codelineno-32-6" href="#__codelineno-32-6"></a><span class="hll">   <span class="n">parent_col</span><span class="o">=</span><span class="s2">&quot;parent&quot;</span><span class="p">,</span>
+</span></span><span id="__span-32-7"><a id="__codelineno-32-7" name="__codelineno-32-7" href="#__codelineno-32-7"></a><span class="hll">   <span class="n">path_col</span><span class="o">=</span><span class="s2">&quot;path&quot;</span><span class="p">,</span>
+</span></span><span id="__span-32-8"><a id="__codelineno-32-8" name="__codelineno-32-8" href="#__codelineno-32-8"></a><span class="hll">   <span class="n">attr_dict</span><span class="o">=</span><span class="p">{</span><span class="s2">&quot;age&quot;</span><span class="p">:</span> <span class="s2">&quot;person age&quot;</span><span class="p">}</span>
+</span></span><span id="__span-32-9"><a id="__codelineno-32-9" name="__codelineno-32-9" href="#__codelineno-32-9"></a><span class="hll"><span class="p">)</span>
+</span></span><span id="__span-32-10"><a id="__codelineno-32-10" name="__codelineno-32-10" href="#__codelineno-32-10"></a><span class="c1"># shape: (5, 4)</span>
+</span><span id="__span-32-11"><a id="__codelineno-32-11" name="__codelineno-32-11" href="#__codelineno-32-11"></a><span class="c1"># ┌────────┬──────┬────────┬────────────┐</span>
+</span><span id="__span-32-12"><a id="__codelineno-32-12" name="__codelineno-32-12" href="#__codelineno-32-12"></a><span class="c1"># │ path   ┆ name ┆ parent ┆ person age │</span>
+</span><span id="__span-32-13"><a id="__codelineno-32-13" name="__codelineno-32-13" href="#__codelineno-32-13"></a><span class="c1"># │ ---    ┆ ---  ┆ ---    ┆ ---        │</span>
+</span><span id="__span-32-14"><a id="__codelineno-32-14" name="__codelineno-32-14" href="#__codelineno-32-14"></a><span class="c1"># │ str    ┆ str  ┆ str    ┆ i64        │</span>
+</span><span id="__span-32-15"><a id="__codelineno-32-15" name="__codelineno-32-15" href="#__codelineno-32-15"></a><span class="c1"># ╞════════╪══════╪════════╪════════════╡</span>
+</span><span id="__span-32-16"><a id="__codelineno-32-16" name="__codelineno-32-16" href="#__codelineno-32-16"></a><span class="c1"># │ /a     ┆ a    ┆ null   ┆ 90         │</span>
+</span><span id="__span-32-17"><a id="__codelineno-32-17" name="__codelineno-32-17" href="#__codelineno-32-17"></a><span class="c1"># │ /a/b   ┆ b    ┆ a      ┆ 65         │</span>
+</span><span id="__span-32-18"><a id="__codelineno-32-18" name="__codelineno-32-18" href="#__codelineno-32-18"></a><span class="c1"># │ /a/b/d ┆ d    ┆ b      ┆ 40         │</span>
+</span><span id="__span-32-19"><a id="__codelineno-32-19" name="__codelineno-32-19" href="#__codelineno-32-19"></a><span class="c1"># │ /a/b/e ┆ e    ┆ b      ┆ 35         │</span>
+</span><span id="__span-32-20"><a id="__codelineno-32-20" name="__codelineno-32-20" href="#__codelineno-32-20"></a><span class="c1"># │ /a/c   ┆ c    ┆ a      ┆ 60         │</span>
+</span><span id="__span-32-21"><a id="__codelineno-32-21" name="__codelineno-32-21" href="#__codelineno-32-21"></a><span class="c1"># └────────┴──────┴────────┴────────────┘</span>
+</span></code></pre></div>
+</div>
+<div class="tabbed-block">
+<div class="language-python highlight"><pre><span></span><code><span id="__span-33-1"><a id="__codelineno-33-1" name="__codelineno-33-1" href="#__codelineno-33-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">tree_to_dot</span>
+</span><span id="__span-33-2"><a id="__codelineno-33-2" name="__codelineno-33-2" href="#__codelineno-33-2"></a>
+</span><span id="__span-33-3"><a id="__codelineno-33-3" name="__codelineno-33-3" href="#__codelineno-33-3"></a><span class="hll"><span class="n">graph</span> <span class="o">=</span> <span class="n">tree_to_dot</span><span class="p">(</span><span class="n">root</span><span class="p">,</span> <span class="n">node_colour</span><span class="o">=</span><span class="s2">&quot;gold&quot;</span><span class="p">)</span>
+</span></span><span id="__span-33-4"><a id="__codelineno-33-4" name="__codelineno-33-4" href="#__codelineno-33-4"></a><span class="n">graph</span><span class="o">.</span><span class="n">write_png</span><span class="p">(</span><span class="s2">&quot;assets/demo/dot.png&quot;</span><span class="p">)</span>
+</span></code></pre></div>
+</div>
+<div class="tabbed-block">
+<div class="language-python highlight"><pre><span></span><code><span id="__span-34-1"><a id="__codelineno-34-1" name="__codelineno-34-1" href="#__codelineno-34-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">tree_to_pillow</span>
+</span><span id="__span-34-2"><a id="__codelineno-34-2" name="__codelineno-34-2" href="#__codelineno-34-2"></a>
+</span><span id="__span-34-3"><a id="__codelineno-34-3" name="__codelineno-34-3" href="#__codelineno-34-3"></a><span class="hll"><span class="n">pillow_image</span> <span class="o">=</span> <span class="n">tree_to_pillow</span><span class="p">(</span><span class="n">root</span><span class="p">)</span>
+</span></span><span id="__span-34-4"><a id="__codelineno-34-4" name="__codelineno-34-4" href="#__codelineno-34-4"></a><span class="n">pillow_image</span><span class="o">.</span><span class="n">save</span><span class="p">(</span><span class="s2">&quot;assets/demo/pillow.png&quot;</span><span class="p">)</span>
+</span></code></pre></div>
+</div>
+<div class="tabbed-block">
+<div class="language-python highlight"><pre><span></span><code><span id="__span-35-1"><a id="__codelineno-35-1" name="__codelineno-35-1" href="#__codelineno-35-1"></a><span class="kn">from</span> <span class="nn">bigtree</span> <span class="kn">import</span> <span class="n">tree_to_mermaid</span>
+</span><span id="__span-35-2"><a id="__codelineno-35-2" name="__codelineno-35-2" href="#__codelineno-35-2"></a>
+</span><span id="__span-35-3"><a id="__codelineno-35-3" name="__codelineno-35-3" href="#__codelineno-35-3"></a><span class="hll"><span class="n">mermaid_md</span> <span class="o">=</span> <span class="n">tree_to_mermaid</span><span class="p">(</span><span class="n">root</span><span class="p">)</span>
+</span></span><span id="__span-35-4"><a id="__codelineno-35-4" name="__codelineno-35-4" href="#__codelineno-35-4"></a><span class="nb">print</span><span class="p">(</span><span class="n">mermaid_md</span><span class="p">)</span>
 </span></code></pre></div>
 </div>
 </div>
diff --git a/demo/workflow/index.html b/demo/workflow/index.html
index ce13cb3c..7ebaf990 100644
--- a/demo/workflow/index.html
+++ b/demo/workflow/index.html
@@ -17,7 +17,7 @@
         <link rel="prev" href="../dag/">
       
       
-        <link rel="next" href="../../resources/">
+        <link rel="next" href="../../resources/articles/">
       
       
       <link rel="icon" href="../../_static/favicon.ico">
@@ -291,7 +291,7 @@
     
     
       <li class="md-tabs__item md-tabs__item--active">
-        <a href="../" class="md-tabs__link">
+        <a href="../tree/" class="md-tabs__link">
           
   
     
@@ -881,10 +881,6 @@
     
       
         
-          
-        
-      
-        
       
         
       
@@ -910,24 +906,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" checked>
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="true">
           <label class="md-nav__title" for="__nav_2_1">
@@ -937,8 +925,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1098,10 +1084,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1121,24 +1103,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1148,8 +1122,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/home/index.html b/home/index.html
index 44e88ffa..75f6d967 100644
--- a/home/index.html
+++ b/home/index.html
@@ -289,7 +289,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../demo/" class="md-tabs__link">
+        <a href="../demo/tree/" class="md-tabs__link">
           
   
     
@@ -896,10 +896,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -924,24 +920,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -951,8 +939,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1054,10 +1040,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1074,24 +1056,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1101,8 +1075,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -2240,7 +2212,7 @@ <h1 id="documentation">🌳 Documentation</h1>
 <ul>
 <li><span class="twemoji lg middle"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="m15 19-6-2.11V5l6 2.11M20.5 3h-.16L15 5.1 9 3 3.36 4.9c-.21.07-.36.25-.36.48V20.5a.5.5 0 0 0 .5.5c.05 0 .11 0 .16-.03L9 18.9l6 2.1 5.64-1.9c.21-.1.36-.25.36-.48V3.5a.5.5 0 0 0-.5-.5Z"/></svg></span> <strong>Getting started</strong><hr />
 <p>View demonstration on how to use <a href="#"><code>bigtree</code></a></p>
-<p><a href="../demo/"><span class="twemoji"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M13.22 19.03a.75.75 0 0 1 0-1.06L18.19 13H3.75a.75.75 0 0 1 0-1.5h14.44l-4.97-4.97a.749.749 0 0 1 .326-1.275.749.749 0 0 1 .734.215l6.25 6.25a.75.75 0 0 1 0 1.06l-6.25 6.25a.75.75 0 0 1-1.06 0Z"/></svg></span> Reference</a></p>
+<p><a href="demo/index.md"><span class="twemoji"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M13.22 19.03a.75.75 0 0 1 0-1.06L18.19 13H3.75a.75.75 0 0 1 0-1.5h14.44l-4.97-4.97a.749.749 0 0 1 .326-1.275.749.749 0 0 1 .734.215l6.25 6.25a.75.75 0 0 1 0 1.06l-6.25 6.25a.75.75 0 0 1-1.06 0Z"/></svg></span> Reference</a></p>
 </li>
 </ul>
 <ul>
diff --git a/index.html b/index.html
index 8bb4151f..933d66bf 100644
--- a/index.html
+++ b/index.html
@@ -289,7 +289,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="demo/" class="md-tabs__link">
+        <a href="demo/tree/" class="md-tabs__link">
           
   
     
@@ -886,10 +886,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -914,24 +910,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -941,8 +929,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1044,10 +1030,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1064,24 +1046,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1091,8 +1065,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -2230,7 +2202,7 @@ <h1 id="documentation">🌳 Documentation</h1>
 <ul>
 <li><span class="twemoji lg middle"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="m15 19-6-2.11V5l6 2.11M20.5 3h-.16L15 5.1 9 3 3.36 4.9c-.21.07-.36.25-.36.48V20.5a.5.5 0 0 0 .5.5c.05 0 .11 0 .16-.03L9 18.9l6 2.1 5.64-1.9c.21-.1.36-.25.36-.48V3.5a.5.5 0 0 0-.5-.5Z"/></svg></span> <strong>Getting started</strong><hr />
 <p>View demonstration on how to use <a href="#"><code>bigtree</code></a></p>
-<p><a href="demo/"><span class="twemoji"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M13.22 19.03a.75.75 0 0 1 0-1.06L18.19 13H3.75a.75.75 0 0 1 0-1.5h14.44l-4.97-4.97a.749.749 0 0 1 .326-1.275.749.749 0 0 1 .734.215l6.25 6.25a.75.75 0 0 1 0 1.06l-6.25 6.25a.75.75 0 0 1-1.06 0Z"/></svg></span> Reference</a></p>
+<p><a href="demo/index.md"><span class="twemoji"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M13.22 19.03a.75.75 0 0 1 0-1.06L18.19 13H3.75a.75.75 0 0 1 0-1.5h14.44l-4.97-4.97a.749.749 0 0 1 .326-1.275.749.749 0 0 1 .734.215l6.25 6.25a.75.75 0 0 1 0 1.06l-6.25 6.25a.75.75 0 0 1-1.06 0Z"/></svg></span> Reference</a></p>
 </li>
 </ul>
 <ul>
diff --git a/install/index.html b/install/index.html
index 253a6743..ae75b952 100644
--- a/install/index.html
+++ b/install/index.html
@@ -289,7 +289,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../demo/" class="md-tabs__link">
+        <a href="../demo/tree/" class="md-tabs__link">
           
   
     
@@ -942,10 +942,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -970,24 +966,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -997,8 +985,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1100,10 +1086,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1120,24 +1102,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1147,8 +1121,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -2295,9 +2267,9 @@ <h2 id="installation-with-pip">Installation with pip</h2>
 <p>To install <code>bigtree</code>, run the following line in command prompt:</p>
 <div class="termy" data-termynal data-ty-macos data-ty-title="bash"><span data-ty="input" data-ty-prompt="$">pip install bigtree</span><span data-ty="progress"></span><span data-ty>Installed<br></span></div>
 
-<p>If tree needs to use pandas methods, it requires additional dependencies.
-Run the following line in command prompt:</p>
-<div class="termy" data-termynal data-ty-macos data-ty-title="bash"><span data-ty="input" data-ty-prompt="$">pip install 'bigtree[pandas]'</span><span data-ty></span></div>
+<p>If tree needs to use pandas or polars methods, it requires additional dependencies.
+Run the following lines in command prompt:</p>
+<div class="termy" data-termynal data-ty-macos data-ty-title="bash"><span data-ty="input" data-ty-prompt="$">pip install 'bigtree[pandas]'</span><span data-ty="input" data-ty-prompt="$">pip install 'bigtree[polars]'</span><span data-ty></span></div>
 
 <p>If tree needs to be exported to image, it requires additional dependencies.
 Run the following lines in command prompt:</p>
diff --git a/objects.inv b/objects.inv
index f94f3ba0a3f7887dbae48bc19c6a3d996383a228..9114e0c90668dcfed7d108eecb086985f54e4227 100644
GIT binary patch
delta 1494
zcmV;{1u6Q$4A%^hlYd+_xvo+>$GOeyRPAj~dskrzS=3-b0e0g2`T-<=3mQZ#dr2G%
zo<>d6yp5DC+Zjb^wPgcQC;zb#gEs2Wn2kJr+l%(V>E^G^c5L{1ZTNa=`1<8#^XDJi
z2&($wzx-FU)KMEwwBCHZKnMH%MD`!QoLTO#>U!Z80~q8?n}6Df`g+kB?hZp^m>9Bd
zs3kkVDYivY=j!M8f1*CHt!ErCeS7I0qPN75PLVxzH*PNl?l^h0Eo%%C>O38bQS@C3
z754skIn-?xzfWlUv1W!UVuZT8wX2DPVO+nS8|kYRf1$cuxMu~ec{ffo9dRb$k~4{o
zF<k}`<qQ`gnSYQmI}lBWX>OlFV@xbli%93{hy8FLAq9|%3=P$8MjehAqsnMf(xDCb
zCLh=IjJJvoC}V4cJfV%OrPA~$!)mE+tk1|`G#XE_EycT4W*4tr=_sS4?*=nKIwkh8
zypT`aQB(W7L<0(&GSFyD*PN0LWiBjBi7_1(v+SUbRDUC(I#X-5<!soY0Qcm*##^uM
zuUZl$nj|*88AKG$94NNyaVG&S()6@IHQJh*ZWG6IdXj!6Ba?~>)l%gJR;f_Chdr9S
z)GHB9a#QTQgaNa4Q!y$*pDbX)DkUEZYLx{@NU`K2<9Toi4^}VBsGx>ffQ6JyJ~Bbi
z<U`X`O@BT&N!u*If(j>}+3Q}sAu}QEw1^np*Yb&gj#>ij3^ESX1^HN5qUAHaP#dO$
z2TW#E{N*zN3AhxfQHiF<cBPk?*t``&6M2DaDp6@EVt4@;Kl_3zdjS&C+KI^MdF#w!
z>$TGZb2^0$Yw643?MtBR^YQOe0<4_VQINLHAb$apHl389Jo8|X;7q3_>9=%TifqfE
zL24}>1qiAvP%O=+gTOsM9Tne}b2$hxnw0A^a6mqWNuPI25l^atVa}xX%#Lshg$dwM
z1Bif<FAM;3E(nM!^Mu}DqE2E!`5A@)<v$33i+vE0v^9W~lpO(vKpO!_0E={x0PG+s
z{eNQ{2iQMeZYOkyt6>lV*1jMC-1X83vAPx{#J9`D?z*5qP@#f^r1}x2ltg2sHcaT7
zpblV4>4Jt-1q=Xcx@SPbn_#h5rXF6#B5hmWy`1E(*W1%2xMl{1fj=)k1pM?W)CvQC
zAmfeMFW-rbL=>DTy^bHA**Knf3XBzyZhy3ja^jKY_?w6*r*&*-YcF?a=j-b|Q&Xav
z{#sG^ALEyEq`1{$V{sejcM5U*bW6jX&%u^E^nRgZK;KyN3y*id{IGer4z<5Z2O4>u
z)c=@!-SDPk)l0<&0}cVioEWvssT9NMk#b+@@02)5l(U0b=Dhh&IkUJoh~a!6n12Z`
z)8@g#WoRBppkVe??Fnl!P&a7|2j>zP21zo`g9<y3<daqjsc=2_l*@4m&8MaDdaz^F
za4}HOJVfz(@00q<-Ml?u-hex5(T8p6I331MUCX+z1oVI9&&j-0hmu*dp~AXTIB3S}
z!H)hYvnF=N6qTGbw07m7uKlUnd4FX<gG;jExj2*+MkiFQd)Aqniydo9a6bII1Lx(7
z=t_y0T4kwD2F@{2?3B^BPhnP$T#gxC5MDTEzXdva-^C24^p71m=RtHa#n*N?l$5i9
zblUWwrU*2@9+!|%?#n^SXAI?j9He|GV|jO^C}Sd=mmof+AbDsvn?|0DynloN;r}FD
z$YVpm2@82wMY94jAiNfGrEpJ}F-IB>sfEA~w)>bS91n-#MahMU1hcyw>Somf8+O7~
zK#X_RU(r!Kliq~-)!AB3yGQ(WL%4gyJzox8n!esPO~F-v-*6vaVL-t8(`*~pL#Rx~
zu+dUZ4PD)g&+Ka(i98>}z)vTf@Z_5@q7?~o>6$^9>bsQxiJt-v#~hlELc7lQNw=I$
wj{LWF0htTZ;!~w!LNUWW=t>T`F|dwb6y1yCTBFzGNLQeyF6t}wH}AQ@xDox-kN^Mx

delta 1472
zcmV;x1wZ=N48aVLlYde*xvo+>$GOeyRPAj~dskrz+0<Y`0Z!ul`awwk7IY(8*-PSB
z;%R7_=53^G#MT+ktBvTHIfjpo>a8<}#y#odx4mi)l0W_Rv>9)Fx!m}2zVYSD^V6Sy
zY!ayINBHtz)$)PbNM`NR*E6*D-%sT5@ym%d{8e2pTw?%(Qh!)iJ5^sU4u-o!-#DTA
ztO2!b3pmB!fofd+{QghU2mbCE2Tb3dTgT`vbF4FL&xe8gOOX+yd)tb}5ur}gu^7eQ
zwK8$<kC$W3R`L6U_8)8ExM5D2o1tAy9GsB$<#dz1SP2)Z^MzYh)LL-kG}8%Z0xmg`
z#2C|M5LM0?B7Y<kGG+&6c|XnVLuibNWx6BLxccEg+(t+Nq+)%;?J%PQjyY$_Xj=2W
zjrb-X*X)FB4ev?%)+l`>>siaS+mUpu<+kxYW4*IvJR>%oZm7a9Ucb^wddJ@#Wq@=>
z?NfOnpSb0&4x=OkDxWgQXu{T#vyNmgJj<vt9Tu~Er+;3#B|>$swqheiza;_g*?Ud5
zUWdPG&4_54`Sj)pQ8aU4#CAtJ31pFGrv+-s*3>ji8qe8D`jzxd8?H>tO%Pb6LhTlI
zZ}MEPBs9rYvGW`U%+^iCD1<&)z=TywJ`~g{3y_dv$w#L1;1V9JUY1co4YL3XDVcmE
zLeJzwaet~NpNrBq3$UQV$!G5DPQ4K`A?>t?nB3R$iGYq;0_+?y4%7wtSXiRvGlNj;
zr-KJdW>Wm+GXV*>6lh6_Zb$9PATg<VD}*NT0=Ha~(lBCp0hd1ef+~9f64Kg8Wb(Xq
z=CJkB=#Dv^!p61q`SA8R()988cPRl@&Uh50ZGSUJfTYEf5Xv(T1_@3)4W-}kIE-w|
zph0R4j{*c$7ATcw@gQ)|$D`8QaxRA;Mp3yw0|(?|nDlwa6zQZI>E=vo&uj>%P?!K7
zHGl{x`N9Ao=YoKwGDoxq6E%tf<!2ZIl>Z<AF7`nLYHI)~m>mIzKpO!_0E={x0PG-`
z_J66318kozw-L?ZY8ZrowJ%5jcRd^-Ro8-q^md7CZVTE26)H$T)sHZxBpMU7A)+lp
z9l(^*1r4bR7y#6Cj{wA*V5wK8?q0@XZCl^GoHSgoH^*~u&2)?ce_DJ5_~})s6*_)L
zrt5Q9z7x5e_~76bki+;5mn<O5@mHQLr+;;#Z|fi%XXpRxEz@#ln%za2hacmYbELG@
zVq<9=r+4#c{B%vDozLEv4g7Y&P(a^A^NWt>f0e=#uR4YwbFac(HLP~ph~9x+05M0w
zeTbG~B!A^HRH0j=4w|H{on_9O|CD<A)*yxR!|Fl2=$QwLmq>XWMS|ILvuC2EK!07O
z1{&Ou6evhqNEuasC{p1n+;OSLz@JYh<Mn96s*$Sapm~TAcA*Dlle>)tz`TK>c(;d5
zX+H-{n7USUT?y#_%6gM|Z4M=~=0inv$9T|;*P{)?;aJW5j2W&aYkVE;3k+L_bDGo2
zfI5e=5x6vz6?&&kZFiz`wNzWtlz-qt_;&{>%NNmwk}$Q(Qk@K(Vxrh7qi-L=tQ@%<
zGrAzYa87=UGz`8=8OF3v9b)D|Y%wKNIW!bZ)s3f3NB>2j`SrMjL^7@cQa)oO;~603
zT^TFKS5DF=CS?iYQ_6_D`)1R~gOTSrApXB;3wffCIAJ00qG(n?MugWwu76g;GfT>z
z#zSf$@I!1rrU|FRQFu{H<r2X>T#hyKYC-f{HB>-CcHUpfUObZCl=;>93d{}<jq8TV
z;i2h#Ids1D<@#0(uKN3md;d_J02@woeO&jk;+Dcj%O!Vwbu%HeuWcmp#DxNnIG4#c
z<5a5<aXH)uVXE(1|EGQ`I5`}1Xdw#yI^Uy)oJ~&r|8D_VD%R3dwGqk)CqDQ}4!JV0
aj$aJltJk%9Z`mtffr?$!7wT^!g&~}49@T*W

diff --git a/others/index.html b/others/index.html
index cc097fdb..5b27da87 100644
--- a/others/index.html
+++ b/others/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../demo/" class="md-tabs__link">
+        <a href="../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/others/list_dir/index.html b/others/list_dir/index.html
index 0932bd4d..598dfde5 100644
--- a/others/list_dir/index.html
+++ b/others/list_dir/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../demo/" class="md-tabs__link">
+        <a href="../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/others/merging_trees/index.html b/others/merging_trees/index.html
index 4523b9d4..2525b9a2 100644
--- a/others/merging_trees/index.html
+++ b/others/merging_trees/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../demo/" class="md-tabs__link">
+        <a href="../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/others/nodes/index.html b/others/nodes/index.html
index 02f0827c..840cd61a 100644
--- a/others/nodes/index.html
+++ b/others/nodes/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../demo/" class="md-tabs__link">
+        <a href="../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/others/remove_checks/index.html b/others/remove_checks/index.html
index 30e193ab..8777be0b 100644
--- a/others/remove_checks/index.html
+++ b/others/remove_checks/index.html
@@ -287,7 +287,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../demo/" class="md-tabs__link">
+        <a href="../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -872,10 +872,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -900,24 +896,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -927,8 +915,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1030,10 +1016,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1050,24 +1032,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1077,8 +1051,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/others/weighted_trees/index.html b/others/weighted_trees/index.html
index 8f547def..677ef28a 100644
--- a/others/weighted_trees/index.html
+++ b/others/weighted_trees/index.html
@@ -285,7 +285,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../../demo/" class="md-tabs__link">
+        <a href="../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -870,10 +870,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -898,24 +894,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -925,8 +913,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1028,10 +1014,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1048,24 +1030,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1075,8 +1049,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/resources/articles/index.html b/resources/articles/index.html
index 07930e42..b673a3b0 100644
--- a/resources/articles/index.html
+++ b/resources/articles/index.html
@@ -14,7 +14,7 @@
         <link rel="canonical" href="https://kayjan.github.io/bigtree/resources/articles/">
       
       
-        <link rel="prev" href="../">
+        <link rel="prev" href="../../demo/workflow/">
       
       
         <link rel="next" href="../../bigtree/node/">
@@ -291,7 +291,7 @@
     
     
       <li class="md-tabs__item md-tabs__item--active">
-        <a href="../../demo/" class="md-tabs__link">
+        <a href="../../demo/tree/" class="md-tabs__link">
           
   
     
@@ -881,10 +881,6 @@
     
       
         
-          
-        
-      
-        
       
         
       
@@ -910,24 +906,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -937,8 +925,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1042,10 +1028,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1065,24 +1047,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" checked>
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="true">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1092,8 +1066,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
diff --git a/resources/index.html b/resources/index.html
deleted file mode 100644
index 3c3f67ff..00000000
--- a/resources/index.html
+++ /dev/null
@@ -1,2313 +0,0 @@
-
-<!doctype html>
-<html lang="en" class="no-js">
-  <head>
-    
-<meta name="keywords" content="Python, Tree, Bigtree">
-<meta property="og:url" content="https://kayjan.github.io/bigtree/resources/" />
-
-      <meta charset="utf-8">
-      <meta name="viewport" content="width=device-width,initial-scale=1">
-      
-      
-      
-        <link rel="canonical" href="https://kayjan.github.io/bigtree/resources/">
-      
-      
-        <link rel="prev" href="../demo/workflow/">
-      
-      
-        <link rel="next" href="articles/">
-      
-      
-      <link rel="icon" href="../_static/favicon.ico">
-      <meta name="generator" content="mkdocs-1.5.3, mkdocs-material-9.5.17">
-    
-
-    
-      
-        <title>Resources - bigtree Documentation</title>
-      
-    
-    
-      <link rel="stylesheet" href="../assets/stylesheets/main.bcfcd587.min.css">
-      
-        
-        <link rel="stylesheet" href="../assets/stylesheets/palette.06af60db.min.css">
-      
-      
-
-
-    
-    
-      
-    
-    
-      
-        
-        
-        <link rel="preconnect" href="https://fonts.gstatic.com" crossorigin>
-        <link rel="stylesheet" href="https://fonts.googleapis.com/css?family=Roboto:300,300i,400,400i,700,700i%7CRoboto+Mono:400,400i,700,700i&display=fallback">
-        <style>:root{--md-text-font:"Roboto";--md-code-font:"Roboto Mono"}</style>
-      
-    
-    
-      <link rel="stylesheet" href="../assets/_mkdocstrings.css">
-    
-      <link rel="stylesheet" href="../_static/custom.css">
-    
-      <link rel="stylesheet" href="../termynal.css">
-    
-    <script>__md_scope=new URL("..",location),__md_hash=e=>[...e].reduce((e,_)=>(e<<5)-e+_.charCodeAt(0),0),__md_get=(e,_=localStorage,t=__md_scope)=>JSON.parse(_.getItem(t.pathname+"."+e)),__md_set=(e,_,t=localStorage,a=__md_scope)=>{try{t.setItem(a.pathname+"."+e,JSON.stringify(_))}catch(e){}}</script>
-    
-      
-
-    
-    
-      
-        <meta  property="og:type"  content="website" >
-      
-        <meta  property="og:title"  content="Resources - bigtree Documentation" >
-      
-        <meta  property="og:description"  content="None" >
-      
-        <meta  property="og:image"  content="https://kayjan.github.io/bigtree/assets/images/social/resources/index.png" >
-      
-        <meta  property="og:image:type"  content="image/png" >
-      
-        <meta  property="og:image:width"  content="1200" >
-      
-        <meta  property="og:image:height"  content="630" >
-      
-        <meta  property="og:url"  content="https://kayjan.github.io/bigtree/resources/" >
-      
-        <meta  name="twitter:card"  content="summary_large_image" >
-      
-        <meta  name="twitter:title"  content="Resources - bigtree Documentation" >
-      
-        <meta  name="twitter:description"  content="None" >
-      
-        <meta  name="twitter:image"  content="https://kayjan.github.io/bigtree/assets/images/social/resources/index.png" >
-      
-    
-    
-   <link href="../assets/stylesheets/glightbox.min.css" rel="stylesheet"/><style>
-    html.glightbox-open { overflow: initial; height: 100%; }
-    .gslide-title { margin-top: 0px; user-select: text; }
-    .gslide-desc { color: #666; user-select: text; }
-    .gslide-image img { background: white; }
-    .gscrollbar-fixer { padding-right: 15px; }
-    .gdesc-inner { font-size: 0.75rem; }
-    body[data-md-color-scheme="slate"] .gdesc-inner { background: var(--md-default-bg-color);}
-    body[data-md-color-scheme="slate"] .gslide-title { color: var(--md-default-fg-color);}
-    body[data-md-color-scheme="slate"] .gslide-desc { color: var(--md-default-fg-color);}</style> <script src="../assets/javascripts/glightbox.min.js"></script></head>
-  
-  
-    
-    
-      
-    
-    
-    
-    
-    <body dir="ltr" data-md-color-scheme="default" data-md-color-primary="teal" data-md-color-accent="amber">
-  
-    
-    <input class="md-toggle" data-md-toggle="drawer" type="checkbox" id="__drawer" autocomplete="off">
-    <input class="md-toggle" data-md-toggle="search" type="checkbox" id="__search" autocomplete="off">
-    <label class="md-overlay" for="__drawer"></label>
-    <div data-md-component="skip">
-      
-        
-        <a href="#resources" class="md-skip">
-          Skip to content
-        </a>
-      
-    </div>
-    <div data-md-component="announce">
-      
-    </div>
-    
-      <div data-md-color-scheme="default" data-md-component="outdated" hidden>
-        
-      </div>
-    
-    
-      
-
-  
-
-<header class="md-header md-header--shadow md-header--lifted" data-md-component="header">
-  <nav class="md-header__inner md-grid" aria-label="Header">
-    <a href=".." title="bigtree Documentation" class="md-header__button md-logo" aria-label="bigtree Documentation" data-md-component="logo">
-      
-  <img src="../_static/favicon.svg" alt="logo">
-
-    </a>
-    <label class="md-header__button md-icon" for="__drawer">
-      
-      <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M3 6h18v2H3V6m0 5h18v2H3v-2m0 5h18v2H3v-2Z"/></svg>
-    </label>
-    <div class="md-header__title" data-md-component="header-title">
-      <div class="md-header__ellipsis">
-        <div class="md-header__topic">
-          <span class="md-ellipsis">
-            bigtree Documentation
-          </span>
-        </div>
-        <div class="md-header__topic" data-md-component="header-topic">
-          <span class="md-ellipsis">
-            
-              Resources
-            
-          </span>
-        </div>
-      </div>
-    </div>
-    
-      
-        <form class="md-header__option" data-md-component="palette">
-  
-    
-    
-    
-    <input class="md-option" data-md-color-media="(prefers-color-scheme: light)" data-md-color-scheme="default" data-md-color-primary="teal" data-md-color-accent="amber"  aria-label="Switch to dark mode"  type="radio" name="__palette" id="__palette_0">
-    
-      <label class="md-header__button md-icon" title="Switch to dark mode" for="__palette_1" hidden>
-        <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M12 7a5 5 0 0 1 5 5 5 5 0 0 1-5 5 5 5 0 0 1-5-5 5 5 0 0 1 5-5m0 2a3 3 0 0 0-3 3 3 3 0 0 0 3 3 3 3 0 0 0 3-3 3 3 0 0 0-3-3m0-7 2.39 3.42C13.65 5.15 12.84 5 12 5c-.84 0-1.65.15-2.39.42L12 2M3.34 7l4.16-.35A7.2 7.2 0 0 0 5.94 8.5c-.44.74-.69 1.5-.83 2.29L3.34 7m.02 10 1.76-3.77a7.131 7.131 0 0 0 2.38 4.14L3.36 17M20.65 7l-1.77 3.79a7.023 7.023 0 0 0-2.38-4.15l4.15.36m-.01 10-4.14.36c.59-.51 1.12-1.14 1.54-1.86.42-.73.69-1.5.83-2.29L20.64 17M12 22l-2.41-3.44c.74.27 1.55.44 2.41.44.82 0 1.63-.17 2.37-.44L12 22Z"/></svg>
-      </label>
-    
-  
-    
-    
-    
-    <input class="md-option" data-md-color-media="(prefers-color-scheme: dark)" data-md-color-scheme="slate" data-md-color-primary="teal" data-md-color-accent="yellow"  aria-label="Switch to light mode"  type="radio" name="__palette" id="__palette_1">
-    
-      <label class="md-header__button md-icon" title="Switch to light mode" for="__palette_0" hidden>
-        <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="m17.75 4.09-2.53 1.94.91 3.06-2.63-1.81-2.63 1.81.91-3.06-2.53-1.94L12.44 4l1.06-3 1.06 3 3.19.09m3.5 6.91-1.64 1.25.59 1.98-1.7-1.17-1.7 1.17.59-1.98L15.75 11l2.06-.05L18.5 9l.69 1.95 2.06.05m-2.28 4.95c.83-.08 1.72 1.1 1.19 1.85-.32.45-.66.87-1.08 1.27C15.17 23 8.84 23 4.94 19.07c-3.91-3.9-3.91-10.24 0-14.14.4-.4.82-.76 1.27-1.08.75-.53 1.93.36 1.85 1.19-.27 2.86.69 5.83 2.89 8.02a9.96 9.96 0 0 0 8.02 2.89m-1.64 2.02a12.08 12.08 0 0 1-7.8-3.47c-2.17-2.19-3.33-5-3.49-7.82-2.81 3.14-2.7 7.96.31 10.98 3.02 3.01 7.84 3.12 10.98.31Z"/></svg>
-      </label>
-    
-  
-</form>
-      
-    
-    
-      <script>var media,input,key,value,palette=__md_get("__palette");if(palette&&palette.color){"(prefers-color-scheme)"===palette.color.media&&(media=matchMedia("(prefers-color-scheme: light)"),input=document.querySelector(media.matches?"[data-md-color-media='(prefers-color-scheme: light)']":"[data-md-color-media='(prefers-color-scheme: dark)']"),palette.color.media=input.getAttribute("data-md-color-media"),palette.color.scheme=input.getAttribute("data-md-color-scheme"),palette.color.primary=input.getAttribute("data-md-color-primary"),palette.color.accent=input.getAttribute("data-md-color-accent"));for([key,value]of Object.entries(palette.color))document.body.setAttribute("data-md-color-"+key,value)}</script>
-    
-    
-    
-      <label class="md-header__button md-icon" for="__search">
-        
-        <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M9.5 3A6.5 6.5 0 0 1 16 9.5c0 1.61-.59 3.09-1.56 4.23l.27.27h.79l5 5-1.5 1.5-5-5v-.79l-.27-.27A6.516 6.516 0 0 1 9.5 16 6.5 6.5 0 0 1 3 9.5 6.5 6.5 0 0 1 9.5 3m0 2C7 5 5 7 5 9.5S7 14 9.5 14 14 12 14 9.5 12 5 9.5 5Z"/></svg>
-      </label>
-      <div class="md-search" data-md-component="search" role="dialog">
-  <label class="md-search__overlay" for="__search"></label>
-  <div class="md-search__inner" role="search">
-    <form class="md-search__form" name="search">
-      <input type="text" class="md-search__input" name="query" aria-label="Search" placeholder="Search" autocapitalize="off" autocorrect="off" autocomplete="off" spellcheck="false" data-md-component="search-query" required>
-      <label class="md-search__icon md-icon" for="__search">
-        
-        <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M9.5 3A6.5 6.5 0 0 1 16 9.5c0 1.61-.59 3.09-1.56 4.23l.27.27h.79l5 5-1.5 1.5-5-5v-.79l-.27-.27A6.516 6.516 0 0 1 9.5 16 6.5 6.5 0 0 1 3 9.5 6.5 6.5 0 0 1 9.5 3m0 2C7 5 5 7 5 9.5S7 14 9.5 14 14 12 14 9.5 12 5 9.5 5Z"/></svg>
-        
-        <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M20 11v2H8l5.5 5.5-1.42 1.42L4.16 12l7.92-7.92L13.5 5.5 8 11h12Z"/></svg>
-      </label>
-      <nav class="md-search__options" aria-label="Search">
-        
-        <button type="reset" class="md-search__icon md-icon" title="Clear" aria-label="Clear" tabindex="-1">
-          
-          <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M19 6.41 17.59 5 12 10.59 6.41 5 5 6.41 10.59 12 5 17.59 6.41 19 12 13.41 17.59 19 19 17.59 13.41 12 19 6.41Z"/></svg>
-        </button>
-      </nav>
-      
-    </form>
-    <div class="md-search__output">
-      <div class="md-search__scrollwrap" data-md-scrollfix>
-        <div class="md-search-result" data-md-component="search-result">
-          <div class="md-search-result__meta">
-            Initializing search
-          </div>
-          <ol class="md-search-result__list" role="presentation"></ol>
-        </div>
-      </div>
-    </div>
-  </div>
-</div>
-    
-    
-      <div class="md-header__source">
-        <a href="https://github.com/kayjan/bigtree" title="Go to repository" class="md-source" data-md-component="source">
-  <div class="md-source__icon md-icon">
-    
-    <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 496 512"><!--! Font Awesome Free 6.5.1 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2023 Fonticons, Inc.--><path d="M165.9 397.4c0 2-2.3 3.6-5.2 3.6-3.3.3-5.6-1.3-5.6-3.6 0-2 2.3-3.6 5.2-3.6 3-.3 5.6 1.3 5.6 3.6zm-31.1-4.5c-.7 2 1.3 4.3 4.3 4.9 2.6 1 5.6 0 6.2-2s-1.3-4.3-4.3-5.2c-2.6-.7-5.5.3-6.2 2.3zm44.2-1.7c-2.9.7-4.9 2.6-4.6 4.9.3 2 2.9 3.3 5.9 2.6 2.9-.7 4.9-2.6 4.6-4.6-.3-1.9-3-3.2-5.9-2.9zM244.8 8C106.1 8 0 113.3 0 252c0 110.9 69.8 205.8 169.5 239.2 12.8 2.3 17.3-5.6 17.3-12.1 0-6.2-.3-40.4-.3-61.4 0 0-70 15-84.7-29.8 0 0-11.4-29.1-27.8-36.6 0 0-22.9-15.7 1.6-15.4 0 0 24.9 2 38.6 25.8 21.9 38.6 58.6 27.5 72.9 20.9 2.3-16 8.8-27.1 16-33.7-55.9-6.2-112.3-14.3-112.3-110.5 0-27.5 7.6-41.3 23.6-58.9-2.6-6.5-11.1-33.3 2.6-67.9 20.9-6.5 69 27 69 27 20-5.6 41.5-8.5 62.8-8.5s42.8 2.9 62.8 8.5c0 0 48.1-33.6 69-27 13.7 34.7 5.2 61.4 2.6 67.9 16 17.7 25.8 31.5 25.8 58.9 0 96.5-58.9 104.2-114.8 110.5 9.2 7.9 17 22.9 17 46.4 0 33.7-.3 75.4-.3 83.6 0 6.5 4.6 14.4 17.3 12.1C428.2 457.8 496 362.9 496 252 496 113.3 383.5 8 244.8 8zM97.2 352.9c-1.3 1-1 3.3.7 5.2 1.6 1.6 3.9 2.3 5.2 1 1.3-1 1-3.3-.7-5.2-1.6-1.6-3.9-2.3-5.2-1zm-10.8-8.1c-.7 1.3.3 2.9 2.3 3.9 1.6 1 3.6.7 4.3-.7.7-1.3-.3-2.9-2.3-3.9-2-.6-3.6-.3-4.3.7zm32.4 35.6c-1.6 1.3-1 4.3 1.3 6.2 2.3 2.3 5.2 2.6 6.5 1 1.3-1.3.7-4.3-1.3-6.2-2.2-2.3-5.2-2.6-6.5-1zm-11.4-14.7c-1.6 1-1.6 3.6 0 5.9 1.6 2.3 4.3 3.3 5.6 2.3 1.6-1.3 1.6-3.9 0-6.2-1.4-2.3-4-3.3-5.6-2z"/></svg>
-  </div>
-  <div class="md-source__repository">
-    bigtree
-  </div>
-</a>
-      </div>
-    
-  </nav>
-  
-    
-      
-<nav class="md-tabs" aria-label="Tabs" data-md-component="tabs">
-  <div class="md-grid">
-    <ul class="md-tabs__list">
-      
-        
-  
-  
-  
-    
-    
-      <li class="md-tabs__item">
-        <a href=".." class="md-tabs__link">
-          
-  
-    
-  
-  Home
-
-        </a>
-      </li>
-    
-  
-
-      
-        
-  
-  
-    
-  
-  
-    
-    
-      
-  
-  
-    
-  
-  
-    
-    
-      <li class="md-tabs__item md-tabs__item--active">
-        <a href="../demo/" class="md-tabs__link">
-          
-  
-    
-  
-  Getting Started
-
-        </a>
-      </li>
-    
-  
-
-    
-  
-
-      
-        
-  
-  
-  
-    
-    
-      
-  
-  
-  
-    
-    
-      <li class="md-tabs__item">
-        <a href="../bigtree/node/" class="md-tabs__link">
-          
-  
-    
-  
-  Code Documentation
-
-        </a>
-      </li>
-    
-  
-
-    
-  
-
-      
-        
-  
-  
-  
-    
-    
-      
-  
-  
-  
-    
-    
-      <li class="md-tabs__item">
-        <a href="../others/" class="md-tabs__link">
-          
-  
-    
-  
-  Others
-
-        </a>
-      </li>
-    
-  
-
-    
-  
-
-      
-    </ul>
-  </div>
-</nav>
-    
-  
-</header>
-    
-    <div class="md-container" data-md-component="container">
-      
-      
-        
-      
-      <main class="md-main" data-md-component="main">
-        <div class="md-main__inner md-grid">
-          
-            
-              
-              <div class="md-sidebar md-sidebar--primary" data-md-component="sidebar" data-md-type="navigation" >
-                <div class="md-sidebar__scrollwrap">
-                  <div class="md-sidebar__inner">
-                    
-
-
-  
-
-
-<nav class="md-nav md-nav--primary md-nav--lifted" aria-label="Navigation" data-md-level="0">
-  <label class="md-nav__title" for="__drawer">
-    <a href=".." title="bigtree Documentation" class="md-nav__button md-logo" aria-label="bigtree Documentation" data-md-component="logo">
-      
-  <img src="../_static/favicon.svg" alt="logo">
-
-    </a>
-    bigtree Documentation
-  </label>
-  
-    <div class="md-nav__source">
-      <a href="https://github.com/kayjan/bigtree" title="Go to repository" class="md-source" data-md-component="source">
-  <div class="md-source__icon md-icon">
-    
-    <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 496 512"><!--! Font Awesome Free 6.5.1 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2023 Fonticons, Inc.--><path d="M165.9 397.4c0 2-2.3 3.6-5.2 3.6-3.3.3-5.6-1.3-5.6-3.6 0-2 2.3-3.6 5.2-3.6 3-.3 5.6 1.3 5.6 3.6zm-31.1-4.5c-.7 2 1.3 4.3 4.3 4.9 2.6 1 5.6 0 6.2-2s-1.3-4.3-4.3-5.2c-2.6-.7-5.5.3-6.2 2.3zm44.2-1.7c-2.9.7-4.9 2.6-4.6 4.9.3 2 2.9 3.3 5.9 2.6 2.9-.7 4.9-2.6 4.6-4.6-.3-1.9-3-3.2-5.9-2.9zM244.8 8C106.1 8 0 113.3 0 252c0 110.9 69.8 205.8 169.5 239.2 12.8 2.3 17.3-5.6 17.3-12.1 0-6.2-.3-40.4-.3-61.4 0 0-70 15-84.7-29.8 0 0-11.4-29.1-27.8-36.6 0 0-22.9-15.7 1.6-15.4 0 0 24.9 2 38.6 25.8 21.9 38.6 58.6 27.5 72.9 20.9 2.3-16 8.8-27.1 16-33.7-55.9-6.2-112.3-14.3-112.3-110.5 0-27.5 7.6-41.3 23.6-58.9-2.6-6.5-11.1-33.3 2.6-67.9 20.9-6.5 69 27 69 27 20-5.6 41.5-8.5 62.8-8.5s42.8 2.9 62.8 8.5c0 0 48.1-33.6 69-27 13.7 34.7 5.2 61.4 2.6 67.9 16 17.7 25.8 31.5 25.8 58.9 0 96.5-58.9 104.2-114.8 110.5 9.2 7.9 17 22.9 17 46.4 0 33.7-.3 75.4-.3 83.6 0 6.5 4.6 14.4 17.3 12.1C428.2 457.8 496 362.9 496 252 496 113.3 383.5 8 244.8 8zM97.2 352.9c-1.3 1-1 3.3.7 5.2 1.6 1.6 3.9 2.3 5.2 1 1.3-1 1-3.3-.7-5.2-1.6-1.6-3.9-2.3-5.2-1zm-10.8-8.1c-.7 1.3.3 2.9 2.3 3.9 1.6 1 3.6.7 4.3-.7.7-1.3-.3-2.9-2.3-3.9-2-.6-3.6-.3-4.3.7zm32.4 35.6c-1.6 1.3-1 4.3 1.3 6.2 2.3 2.3 5.2 2.6 6.5 1 1.3-1.3.7-4.3-1.3-6.2-2.2-2.3-5.2-2.6-6.5-1zm-11.4-14.7c-1.6 1-1.6 3.6 0 5.9 1.6 2.3 4.3 3.3 5.6 2.3 1.6-1.3 1.6-3.9 0-6.2-1.4-2.3-4-3.3-5.6-2z"/></svg>
-  </div>
-  <div class="md-source__repository">
-    bigtree
-  </div>
-</a>
-    </div>
-  
-  <ul class="md-nav__list" data-md-scrollfix>
-    
-      
-      
-  
-  
-  
-  
-    
-    
-      
-        
-          
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_1" >
-        
-          
-          
-          <div class="md-nav__link md-nav__container">
-            <a href=".." class="md-nav__link ">
-              
-  
-  <span class="md-ellipsis">
-    Home
-  </span>
-  
-
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_1" id="__nav_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
-        
-        <nav class="md-nav" data-md-level="1" aria-labelledby="__nav_1_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_1">
-            <span class="md-nav__icon md-icon"></span>
-            Home
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../home/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    🌳 Documentation
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../install/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Installation
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    
-    
-      
-        
-      
-        
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_1_4" >
-        
-          
-          <label class="md-nav__link" for="__nav_1_4" id="__nav_1_4_label" tabindex="0">
-            
-  
-  <span class="md-ellipsis">
-    Components
-  </span>
-  
-
-            <span class="md-nav__icon md-icon"></span>
-          </label>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_1_4_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_1_4">
-            <span class="md-nav__icon md-icon"></span>
-            Components
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../tree/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Tree
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../binarytree/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Binary Tree
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../dag/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Directed Acyclic Graph (DAG)
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    
-    
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_1_5" >
-        
-          
-          <label class="md-nav__link" for="__nav_1_5" id="__nav_1_5_label" tabindex="0">
-            
-  
-  <span class="md-ellipsis">
-    Contributing
-  </span>
-  
-
-            <span class="md-nav__icon md-icon"></span>
-          </label>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_1_5_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_1_5">
-            <span class="md-nav__icon md-icon"></span>
-            Contributing
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../contributing/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Contributing
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    
-    
-      
-        
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_1_6" >
-        
-          
-          <label class="md-nav__link" for="__nav_1_6" id="__nav_1_6_label" tabindex="0">
-            
-  
-  <span class="md-ellipsis">
-    Changes
-  </span>
-  
-
-            <span class="md-nav__icon md-icon"></span>
-          </label>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_1_6_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_1_6">
-            <span class="md-nav__icon md-icon"></span>
-            Changes
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../benchmarks/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Benchmarks
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../changelog/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Changelog
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-    
-      
-      
-  
-  
-    
-  
-  
-  
-    
-    
-      
-        
-      
-        
-      
-    
-    
-      
-        
-        
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--active md-nav__item--section md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2" checked>
-        
-          
-          <label class="md-nav__link" for="__nav_2" id="__nav_2_label" tabindex="">
-            
-  
-  <span class="md-ellipsis">
-    Getting Started
-  </span>
-  
-
-            <span class="md-nav__icon md-icon"></span>
-          </label>
-        
-        <nav class="md-nav" data-md-level="1" aria-labelledby="__nav_2_label" aria-expanded="true">
-          <label class="md-nav__title" for="__nav_2">
-            <span class="md-nav__icon md-icon"></span>
-            Getting Started
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-                
-  
-  
-  
-  
-    
-    
-      
-        
-          
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-    
-    
-      
-      
-        
-          
-          
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--section md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
-        
-          
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../demo/" class="md-nav__link ">
-              
-  
-  <span class="md-ellipsis">
-    Demonstration
-  </span>
-  
-
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_2_1">
-            <span class="md-nav__icon md-icon"></span>
-            Demonstration
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../demo/tree/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Tree Demonstration
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../demo/binarytree/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Binary Tree Demonstration
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../demo/dag/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    DAG Demonstration
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../demo/workflow/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Workflow Demonstration
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-    
-  
-  
-  
-    
-    
-      
-        
-          
-        
-      
-        
-      
-    
-    
-      
-      
-        
-          
-          
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--active md-nav__item--section md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" checked>
-        
-          
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="./" class="md-nav__link md-nav__link--active">
-              
-  
-  <span class="md-ellipsis">
-    Resources
-  </span>
-  
-
-            </a>
-            
-              
-              <label class="md-nav__link md-nav__link--active" for="__nav_2_2" id="__nav_2_2_label" tabindex="">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="true">
-          <label class="md-nav__title" for="__nav_2_2">
-            <span class="md-nav__icon md-icon"></span>
-            Resources
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="articles/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Articles
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-    
-      
-      
-  
-  
-  
-  
-    
-    
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_3" >
-        
-          
-          <label class="md-nav__link" for="__nav_3" id="__nav_3_label" tabindex="0">
-            
-  
-  <span class="md-ellipsis">
-    Code Documentation
-  </span>
-  
-
-            <span class="md-nav__icon md-icon"></span>
-          </label>
-        
-        <nav class="md-nav" data-md-level="1" aria-labelledby="__nav_3_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_3">
-            <span class="md-nav__icon md-icon"></span>
-            Code Documentation
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-                
-  
-  
-  
-  
-    
-    
-      
-        
-          
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_3_1" >
-        
-          
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../bigtree/node/" class="md-nav__link ">
-              
-  
-  <span class="md-ellipsis">
-    Node
-  </span>
-  
-
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_3_1" id="__nav_3_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_3_1_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_3_1">
-            <span class="md-nav__icon md-icon"></span>
-            Node
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/node/basenode/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    BaseNode
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/node/node/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Node
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/node/binarynode/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    BinaryNode
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/node/dagnode/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    DAGNode
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    
-    
-      
-        
-          
-        
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_3_2" >
-        
-          
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../bigtree/binarytree/" class="md-nav__link ">
-              
-  
-  <span class="md-ellipsis">
-    Binary Tree
-  </span>
-  
-
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_3_2" id="__nav_3_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_3_2_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_3_2">
-            <span class="md-nav__icon md-icon"></span>
-            Binary Tree
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/binarytree/construct/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Binary Tree Construct
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    
-    
-      
-        
-          
-        
-      
-        
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_3_3" >
-        
-          
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../bigtree/dag/" class="md-nav__link ">
-              
-  
-  <span class="md-ellipsis">
-    DAG
-  </span>
-  
-
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_3_3" id="__nav_3_3_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_3_3_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_3_3">
-            <span class="md-nav__icon md-icon"></span>
-            DAG
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/dag/construct/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    DAG Construct
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/dag/export/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    DAG Export
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    
-    
-      
-        
-          
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_3_4" >
-        
-          
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../bigtree/tree/" class="md-nav__link ">
-              
-  
-  <span class="md-ellipsis">
-    Tree
-  </span>
-  
-
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_3_4" id="__nav_3_4_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_3_4_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_3_4">
-            <span class="md-nav__icon md-icon"></span>
-            Tree
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/tree/construct/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Tree Construct
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/tree/export/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Tree Export
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/tree/helper/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Tree Helper
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/tree/modify/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Tree Modify
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/tree/search/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Tree Search
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    
-    
-      
-        
-          
-        
-      
-        
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_3_5" >
-        
-          
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../bigtree/utils/" class="md-nav__link ">
-              
-  
-  <span class="md-ellipsis">
-    Utils
-  </span>
-  
-
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_3_5" id="__nav_3_5_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_3_5_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_3_5">
-            <span class="md-nav__icon md-icon"></span>
-            Utils
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/utils/iterators/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Iterators
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/utils/plot/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Plot
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    
-    
-      
-        
-          
-        
-      
-        
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_3_6" >
-        
-          
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../bigtree/workflows/" class="md-nav__link ">
-              
-  
-  <span class="md-ellipsis">
-    Workflows
-  </span>
-  
-
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_3_6" id="__nav_3_6_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_3_6_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_3_6">
-            <span class="md-nav__icon md-icon"></span>
-            Workflows
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/workflows/app_todo/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    To Do App
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../bigtree/workflows/app_calendar/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Calendar App
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-    
-      
-      
-  
-  
-  
-  
-    
-    
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_4" >
-        
-          
-          <label class="md-nav__link" for="__nav_4" id="__nav_4_label" tabindex="0">
-            
-  
-  <span class="md-ellipsis">
-    Others
-  </span>
-  
-
-            <span class="md-nav__icon md-icon"></span>
-          </label>
-        
-        <nav class="md-nav" data-md-level="1" aria-labelledby="__nav_4_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_4">
-            <span class="md-nav__icon md-icon"></span>
-            Others
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-                
-  
-  
-  
-  
-    
-    
-      
-        
-          
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-        
-      
-    
-    
-      
-      
-        
-      
-    
-    
-    <li class="md-nav__item md-nav__item--nested">
-      
-        
-        
-        <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_4_1" >
-        
-          
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../others/" class="md-nav__link ">
-              
-  
-  <span class="md-ellipsis">
-    Tips and Tricks
-  </span>
-  
-
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_4_1" id="__nav_4_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
-        
-        <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_4_1_label" aria-expanded="false">
-          <label class="md-nav__title" for="__nav_4_1">
-            <span class="md-nav__icon md-icon"></span>
-            Tips and Tricks
-          </label>
-          <ul class="md-nav__list" data-md-scrollfix>
-            
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../others/remove_checks/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Remove Tree Checks
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../others/list_dir/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    List Directory
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../others/nodes/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Extending Nodes
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../others/merging_trees/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Merging Trees
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-              
-                
-  
-  
-  
-  
-    <li class="md-nav__item">
-      <a href="../others/weighted_trees/" class="md-nav__link">
-        
-  
-  <span class="md-ellipsis">
-    Trees with Weighted Edges
-  </span>
-  
-
-      </a>
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-              
-            
-          </ul>
-        </nav>
-      
-    </li>
-  
-
-    
-  </ul>
-</nav>
-                  </div>
-                </div>
-              </div>
-            
-            
-              
-              <div class="md-sidebar md-sidebar--secondary" data-md-component="sidebar" data-md-type="toc" >
-                <div class="md-sidebar__scrollwrap">
-                  <div class="md-sidebar__inner">
-                    
-
-<nav class="md-nav md-nav--secondary" aria-label="Table of contents">
-  
-  
-  
-    
-  
-  
-</nav>
-                  </div>
-                </div>
-              </div>
-            
-          
-          
-            <div class="md-content" data-md-component="content">
-              <article class="md-content__inner md-typeset">
-                
-                  
-
-  
-  
-
-
-<h1 id="resources">📰 Resources</h1>
-
-
-
-
-
-
-
-  
-  
-
-
-
-
-
-
-                
-              </article>
-            </div>
-          
-          
-<script>var target=document.getElementById(location.hash.slice(1));target&&target.name&&(target.checked=target.name.startsWith("__tabbed_"))</script>
-        </div>
-        
-          <button type="button" class="md-top md-icon" data-md-component="top" hidden>
-  
-  <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M13 20h-2V8l-5.5 5.5-1.42-1.42L12 4.16l7.92 7.92-1.42 1.42L13 8v12Z"/></svg>
-  Back to top
-</button>
-        
-      </main>
-      
-        <footer class="md-footer">
-  
-  <div class="md-footer-meta md-typeset">
-    <div class="md-footer-meta__inner md-grid">
-      <div class="md-copyright">
-  
-  
-    Made with
-    <a href="https://squidfunk.github.io/mkdocs-material/" target="_blank" rel="noopener">
-      Material for MkDocs
-    </a>
-  
-</div>
-      
-        <div class="md-social">
-  
-    
-    
-    
-    
-      
-      
-    
-    <a href="https://github.com/kayjan" target="_blank" rel="noopener" title="github.com" class="md-social__link">
-      <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 496 512"><!--! Font Awesome Free 6.5.1 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2023 Fonticons, Inc.--><path d="M165.9 397.4c0 2-2.3 3.6-5.2 3.6-3.3.3-5.6-1.3-5.6-3.6 0-2 2.3-3.6 5.2-3.6 3-.3 5.6 1.3 5.6 3.6zm-31.1-4.5c-.7 2 1.3 4.3 4.3 4.9 2.6 1 5.6 0 6.2-2s-1.3-4.3-4.3-5.2c-2.6-.7-5.5.3-6.2 2.3zm44.2-1.7c-2.9.7-4.9 2.6-4.6 4.9.3 2 2.9 3.3 5.9 2.6 2.9-.7 4.9-2.6 4.6-4.6-.3-1.9-3-3.2-5.9-2.9zM244.8 8C106.1 8 0 113.3 0 252c0 110.9 69.8 205.8 169.5 239.2 12.8 2.3 17.3-5.6 17.3-12.1 0-6.2-.3-40.4-.3-61.4 0 0-70 15-84.7-29.8 0 0-11.4-29.1-27.8-36.6 0 0-22.9-15.7 1.6-15.4 0 0 24.9 2 38.6 25.8 21.9 38.6 58.6 27.5 72.9 20.9 2.3-16 8.8-27.1 16-33.7-55.9-6.2-112.3-14.3-112.3-110.5 0-27.5 7.6-41.3 23.6-58.9-2.6-6.5-11.1-33.3 2.6-67.9 20.9-6.5 69 27 69 27 20-5.6 41.5-8.5 62.8-8.5s42.8 2.9 62.8 8.5c0 0 48.1-33.6 69-27 13.7 34.7 5.2 61.4 2.6 67.9 16 17.7 25.8 31.5 25.8 58.9 0 96.5-58.9 104.2-114.8 110.5 9.2 7.9 17 22.9 17 46.4 0 33.7-.3 75.4-.3 83.6 0 6.5 4.6 14.4 17.3 12.1C428.2 457.8 496 362.9 496 252 496 113.3 383.5 8 244.8 8zM97.2 352.9c-1.3 1-1 3.3.7 5.2 1.6 1.6 3.9 2.3 5.2 1 1.3-1 1-3.3-.7-5.2-1.6-1.6-3.9-2.3-5.2-1zm-10.8-8.1c-.7 1.3.3 2.9 2.3 3.9 1.6 1 3.6.7 4.3-.7.7-1.3-.3-2.9-2.3-3.9-2-.6-3.6-.3-4.3.7zm32.4 35.6c-1.6 1.3-1 4.3 1.3 6.2 2.3 2.3 5.2 2.6 6.5 1 1.3-1.3.7-4.3-1.3-6.2-2.2-2.3-5.2-2.6-6.5-1zm-11.4-14.7c-1.6 1-1.6 3.6 0 5.9 1.6 2.3 4.3 3.3 5.6 2.3 1.6-1.3 1.6-3.9 0-6.2-1.4-2.3-4-3.3-5.6-2z"/></svg>
-    </a>
-  
-    
-    
-    
-    
-      
-      
-    
-    <a href="https://linkedin.com/in/kayjan" target="_blank" rel="noopener" title="linkedin.com" class="md-social__link">
-      <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512"><!--! Font Awesome Free 6.5.1 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2023 Fonticons, Inc.--><path d="M416 32H31.9C14.3 32 0 46.5 0 64.3v383.4C0 465.5 14.3 480 31.9 480H416c17.6 0 32-14.5 32-32.3V64.3c0-17.8-14.4-32.3-32-32.3zM135.4 416H69V202.2h66.5V416zm-33.2-243c-21.3 0-38.5-17.3-38.5-38.5S80.9 96 102.2 96c21.2 0 38.5 17.3 38.5 38.5 0 21.3-17.2 38.5-38.5 38.5zm282.1 243h-66.4V312c0-24.8-.5-56.7-34.5-56.7-34.6 0-39.9 27-39.9 54.9V416h-66.4V202.2h63.7v29.2h.9c8.9-16.8 30.6-34.5 62.9-34.5 67.2 0 79.7 44.3 79.7 101.9V416z"/></svg>
-    </a>
-  
-    
-    
-    
-    
-      
-      
-    
-    <a href="https://kayjanwong.medium.com" target="_blank" rel="noopener" title="kayjanwong.medium.com" class="md-social__link">
-      <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 640 512"><!--! Font Awesome Free 6.5.1 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2023 Fonticons, Inc.--><path d="M180.5 74.262C80.813 74.262 0 155.633 0 256s80.819 181.738 180.5 181.738S361 356.373 361 256 280.191 74.262 180.5 74.262Zm288.25 10.646c-49.845 0-90.245 76.619-90.245 171.095s40.406 171.1 90.251 171.1 90.251-76.619 90.251-171.1H559c0-94.503-40.4-171.095-90.248-171.095Zm139.506 17.821c-17.526 0-31.735 68.628-31.735 153.274s14.2 153.274 31.735 153.274S640 340.631 640 256c0-84.649-14.215-153.271-31.742-153.271Z"/></svg>
-    </a>
-  
-</div>
-      
-    </div>
-  </div>
-</footer>
-      
-    </div>
-    <div class="md-dialog" data-md-component="dialog">
-      <div class="md-dialog__inner md-typeset"></div>
-    </div>
-    
-    
-    <script id="__config" type="application/json">{"base": "..", "features": ["navigation.tabs", "navigation.tabs.sticky", "navigation.top", "navigation.indexes", "navigation.sections", "content.code.copy", "content.code.annotate", "content.tooltips"], "search": "../assets/javascripts/workers/search.b8dbb3d2.min.js", "translations": {"clipboard.copied": "Copied to clipboard", "clipboard.copy": "Copy to clipboard", "search.result.more.one": "1 more on this page", "search.result.more.other": "# more on this page", "search.result.none": "No matching documents", "search.result.one": "1 matching document", "search.result.other": "# matching documents", "search.result.placeholder": "Type to start searching", "search.result.term.missing": "Missing", "select.version": "Select version"}, "version": {"provider": "mike"}}</script>
-    
-    
-      <script src="../assets/javascripts/bundle.1e8ae164.min.js"></script>
-      
-        <script src="../_static/custom.js"></script>
-      
-        <script src="../termynal.js"></script>
-      
-    
-  <script>document$.subscribe(() => {const lightbox = GLightbox({"touchNavigation": true, "loop": false, "zoomable": true, "draggable": true, "openEffect": "zoom", "closeEffect": "zoom", "slideEffect": "slide"});})</script></body>
-</html>
\ No newline at end of file
diff --git a/search/search_index.json b/search/search_index.json
index 344fb288..2aa59c3c 100644
--- a/search/search_index.json
+++ b/search/search_index.json
@@ -1 +1 @@
-{"config":{"lang":["en"],"separator":"[\\s\\-]+","pipeline":["stopWordFilter"]},"docs":[{"location":"","title":"\ud83c\udf33 Documentation","text":"<p>Tree Implementation and Methods for Python, integrated with Python list, dictionary, and pandas DataFrame.</p> <p>It is pythonic, making it easy to learn and extendable to many types of workflows.</p> <ul> <li> Set up in 2 minutes <p>Install <code>bigtree</code> with <code>pip</code> or <code>conda</code> and get up   and running in minutes</p> <p> Getting started</p> </li> </ul> <ul> <li> Getting started <p>View demonstration on how to use <code>bigtree</code></p> <p> Reference</p> </li> </ul> <ul> <li> Resources <p>Articles relating to trees and <code>bigtree</code></p> <p> View articles</p> </li> </ul> <ul> <li> Support bigtree <p>Do support if you like this project!</p> <p> Support me</p> </li> </ul> <p>Related Links:</p> <ul> <li>Community: Issues / Discussions</li> <li>Package: PyPI / Conda</li> </ul>"},{"location":"benchmarks/","title":"\u23f0 Benchmarks","text":""},{"location":"binarytree/","title":"\ud83c\udf35 Binary Tree","text":"<p>For Binary Tree implementation, there are 3 main components. Binary Node inherits from Node, so the components in Tree implementation are also available in Binary Tree.</p>"},{"location":"binarytree/#node","title":"\ud83c\udf3f Node","text":"<ul> <li><code>BinaryNode</code>, Node with binary tree rules</li> </ul>"},{"location":"binarytree/#constructing-binary-tree","title":"\u2728 Constructing Binary Tree","text":"<ul> <li>From list, using flattened list structure</li> </ul>"},{"location":"binarytree/#traversing-binary-tree","title":"\u27b0 Traversing Binary Tree","text":"<ul> <li>In-Order Traversal</li> </ul>"},{"location":"changelog/","title":"\ud83c\udf42 Changelog","text":"<p>All notable changes to this project will be documented in this file.</p> <p>The format is based on Keep a Changelog, and this project adheres to Semantic Versioning.</p>"},{"location":"changelog/#unreleased","title":"Unreleased","text":""},{"location":"changelog/#0172-2024-04-24","title":"0.17.2 - 2024-04-24","text":""},{"location":"changelog/#changed","title":"Changed:","text":"<ul> <li>DAG Constructor: <code>list_to_dag</code> and <code>dict_to_dag</code> does not rely on <code>dataframe_to_dag</code> as pandas dataframe operation is phased out.</li> </ul>"},{"location":"changelog/#fixed","title":"Fixed:","text":"<ul> <li>DAG Constructor: Handle cases where reserved keywords are part of attribute upon creation and throw error accordingly.</li> <li>[#224] Tree/DAG Constructor: Null checks to not interpret 0 as null, this affects <code>dataframe_to_tree_by_relation</code>, <code>add_dataframe_to_tree_by_path</code>, <code>add_dataframe_to_tree_by_name</code>, <code>dataframe_to_tree</code>, and <code>dataframe_to_dag</code>. This will also affect showing/printing of trees when <code>attr_omit_null</code> is set to True.</li> </ul>"},{"location":"changelog/#0171-2024-04-23","title":"0.17.1 - 2024-04-23","text":""},{"location":"changelog/#fixed_1","title":"Fixed","text":"<ul> <li>[#222] Tree Constructor: <code>dataframe_to_tree_by_relation</code> duplicate root node name error message to handle different data types.</li> </ul>"},{"location":"changelog/#0170-2024-04-04","title":"0.17.0 - 2024-04-04","text":""},{"location":"changelog/#added","title":"Added","text":"<ul> <li>Misc: Group tests for benchmark timings to compare the timings by multiplier more effectively.</li> </ul>"},{"location":"changelog/#changed_1","title":"Changed","text":"<ul> <li>Tree Constructor: <code>add_dict_to_tree_by_name</code> and <code>add_dataframe_to_tree_by_name</code> modifies tree in-place instead of returning new tree, and does not accept <code>join_type</code> as argument as pandas dataframe operation is phased out. If there are clashing attributes, only those that have values will be replaced. This might not be backwards-compatible!</li> <li>Tree Constructor: <code>dataframe_to_tree</code> no longer relies on <code>add_dataframe_to_tree_by_path</code> as it performs assertion checks twice. This leads to 5% improvement in timings for a tree with 10000 nodes, averaged across 10 runs.</li> <li>Misc: Abstract out assertion checks for empty dataframe and duplicate attribute.</li> <li>Misc: Abstract out logic for checking null and filtering attributes.</li> <li>Misc: Optimization in dictionary and dataframe operations.</li> </ul>"},{"location":"changelog/#fixed_2","title":"Fixed","text":"<ul> <li>Tree Constructor: <code>dict_to_tree</code> no longer uses dataframe operations, leading to 33% improvement in timings for a tree with 10000 nodes, averaged across 10 runs. The resulting data type of node follows the dictionary exactly, compared to the previous dataframe operations that may change the dtypes for certain columns. This might not be backwards-compatible!</li> <li>Tree Constructor: <code>dataframe_to_tree_by_relation</code> fix root node detection logic, ignore existing name column, ignore non-attribute columns, ignore null attribute columns.</li> <li>Tree Constructor: <code>add_dataframe_to_tree_by_path</code> ignore existing name column, ignore non-attribute columns, ignore null attribute columns.</li> <li>Tree Constructor: <code>add_dataframe_to_tree_by_name</code> ignore existing name column, ignore non-attribute columns, ignore null attribute columns.</li> <li>Tree Constructor: <code>dataframe_to_tree</code> ignore existing name column, ignore non-attribute columns, ignore null attribute columns.</li> <li>DAG Constructor: <code>dataframe_to_dag</code> ignore existing name column, ignore non-attribute columns, ignore null attribute columns.</li> </ul>"},{"location":"changelog/#0164-2024-03-14","title":"0.16.4 - 2024-03-14","text":""},{"location":"changelog/#fixed_3","title":"Fixed","text":"<ul> <li>[#216] Tree Exporter: Fix nan checker when printing trees.</li> </ul>"},{"location":"changelog/#0163-2024-03-14","title":"0.16.3 - 2024-03-14","text":""},{"location":"changelog/#added_1","title":"Added","text":"<ul> <li>BaseNode: Add diameter property.</li> <li>Misc: Testing to include benchmark timings for tree creation, compare benchmark tests across commits, reject pull request if benchmark tests fails.</li> <li>Misc: Documentation to include benchmark results.</li> </ul>"},{"location":"changelog/#changed_2","title":"Changed","text":"<ul> <li>Misc: Documentation to enable zooming in of images, add navigation section headers, remove some meta tags.</li> <li>Misc: Split up testing into multiple conftest files.</li> </ul>"},{"location":"changelog/#fixed_4","title":"Fixed","text":"<ul> <li>Tree Constructor: Tree creation from dictionary adds None for empty attributes instead of np.nan.</li> <li>[#216] Tree Exporter: <code>attr_omit_null</code> to handle nan/null values in addition to checking for None.</li> </ul>"},{"location":"changelog/#0162-2024-02-06","title":"0.16.2 - 2024-02-06","text":""},{"location":"changelog/#added_2","title":"Added","text":"<ul> <li>Misc: Documentation plugin Termynal for code animation.</li> <li>Misc: Usage of <code>docstr-coverage</code>.</li> <li>Misc: Docstrings for nested functions to pass <code>docstr-coverage</code>.</li> </ul>"},{"location":"changelog/#changed_3","title":"Changed","text":"<ul> <li>[#185] BaseNode: Make assertion checks optional.</li> <li>Misc: Documentation CSS for h1 display for windows compatibility, modify the related links on main page.</li> </ul>"},{"location":"changelog/#0161-2024-01-29","title":"0.16.1 - 2024-01-29","text":""},{"location":"changelog/#fixed_5","title":"Fixed","text":"<ul> <li>Misc: Compatibility of mkdocs with readthedocs.</li> </ul>"},{"location":"changelog/#0160-2024-01-28","title":"0.16.0 - 2024-01-28","text":""},{"location":"changelog/#added_3","title":"Added","text":"<ul> <li>Misc: Documentation using mkdocs.</li> </ul>"},{"location":"changelog/#changed_4","title":"Changed","text":"<ul> <li>Misc: Markdown edit for README, CHANGELOG.</li> <li>Misc: Docstring to indicate Examples, to indicate exceptions for BaseNode and DAGNode, simplify code for tree modification.</li> </ul>"},{"location":"changelog/#fixed_6","title":"Fixed","text":"<ul> <li>Misc: Docstring bullet point alignment, images compatibility with markdown.</li> </ul>"},{"location":"changelog/#0157-2024-01-26","title":"0.15.7 - 2024-01-26","text":""},{"location":"changelog/#added_4","title":"Added","text":"<ul> <li>Misc: Sphinx documentation to support mermaid markdown images, reflect CHANGELOG section, add more emojis.</li> </ul>"},{"location":"changelog/#changed_5","title":"Changed","text":"<ul> <li>Misc: Update SEO image.</li> <li>Misc: Fix Sphinx documentation font size difference between web and mobile, include last updated date.</li> <li>Misc: Upgrade package versions in pre-commit hook.</li> </ul>"},{"location":"changelog/#fixed_7","title":"Fixed","text":"<ul> <li>Tree Exporter: <code>hprint_tree</code> and <code>hyield_tree</code> to be compatible with <code>BinaryNode</code> where child nodes can be None type.</li> </ul>"},{"location":"changelog/#0156-2024-01-20","title":"0.15.6 - 2024-01-20","text":""},{"location":"changelog/#added_5","title":"Added","text":"<ul> <li>DAGNode: Able to access and delete node children via name with square bracket accessor with <code>__getitem__</code> and <code>__delitem__</code> magic methods.</li> <li>DAGNode: Able to delete all children for a node.</li> <li>DAGNode: Able to check if node contains child node with <code>__contains__</code> magic method.</li> <li>DAGNode: Able to iterate the node to access children with <code>__iter__</code> magic method.</li> </ul>"},{"location":"changelog/#changed_6","title":"Changed","text":"<ul> <li>Tree Search: Modify type hints to include DAGNode for <code>find_children</code>, <code>find_child</code>, and <code>find_child_by_name</code>.</li> <li>Misc: Neater handling of strings for tests.</li> <li>Misc: Documentation enhancement to split README into multiple files.</li> <li>Misc: New Sphinx documentation theme.</li> </ul>"},{"location":"changelog/#0155-2024-01-17","title":"0.15.5 - 2024-01-17","text":""},{"location":"changelog/#changed_7","title":"Changed","text":"<ul> <li>Misc: Neater handling of strings for tests.</li> <li>Misc: Better examples for merging trees and weighted trees in Sphinx documentation.</li> <li>Misc: Fix links and introduce unreleased segment in CHANGELOG.</li> </ul>"},{"location":"changelog/#0154-2024-01-11","title":"0.15.4 - 2024-01-11","text":""},{"location":"changelog/#changed_8","title":"Changed","text":"<ul> <li>Tree Exporter: <code>hprint_tree</code> and <code>hyield_tree</code> to allow hiding names of intermediate node.</li> </ul>"},{"location":"changelog/#fixed_8","title":"Fixed","text":"<ul> <li>Tree Constructor: <code>newick_to_tree</code> to handle invalid closing and use of apostrophe.</li> <li>Tree Exporter: <code>tree_to_newick</code> to handle special characters by wrapping them in apostrophe.</li> </ul>"},{"location":"changelog/#0153-2024-01-08","title":"0.15.3 - 2024-01-08","text":""},{"location":"changelog/#added_6","title":"Added","text":"<ul> <li>Tree Helper: <code>get_subtree</code> method to retrieve subtree.</li> </ul>"},{"location":"changelog/#0152-2024-01-08","title":"0.15.2 - 2024-01-08","text":""},{"location":"changelog/#added_7","title":"Added","text":"<ul> <li>Tree Exporter: <code>hprint_tree</code> and <code>hyield_tree</code> to print and retrieve results for tree in horizontal orientation.</li> <li>Node: Added <code>hshow</code> method to print tree in horizontal orientation to console.</li> </ul>"},{"location":"changelog/#0151-2024-01-05","title":"0.15.1 - 2024-01-05","text":""},{"location":"changelog/#added_8","title":"Added","text":"<ul> <li>Tree Constructor: <code>newick_to_tree</code> to convert Newick notation to tree.</li> </ul>"},{"location":"changelog/#changed_9","title":"Changed","text":"<ul> <li>Tree Exporter: <code>tree_to_newick</code> to accept more parameters to parse length and attributes.</li> </ul>"},{"location":"changelog/#fixed_9","title":"Fixed","text":"<ul> <li>Misc: Automated doctest setup to use os operations instead of string operations.</li> </ul>"},{"location":"changelog/#0150-2024-01-02","title":"0.15.0 - 2024-01-02","text":""},{"location":"changelog/#added_9","title":"Added","text":"<ul> <li>Tree Exporter: Export to Newick notation with <code>tree_to_newick</code>.</li> </ul>"},{"location":"changelog/#changed_10","title":"Changed","text":"<ul> <li>Tree Helper: Pruning tree to support pruning of multiple paths (accepts list of string).</li> <li>Tree Helper: Pruning tree to support pruning of an exact path (i.e., remove descendants) with <code>exact</code> parameter, default is prune and keep descendants.</li> </ul>"},{"location":"changelog/#0148-2023-12-25","title":"0.14.8 - 2023-12-25","text":""},{"location":"changelog/#changed_11","title":"Changed","text":"<ul> <li>Tree Modifier: Enhance documentation examples.</li> <li>Workflow To Do App: Change import and export logic.</li> <li>Misc: Organize assets folder based on whether it originated from README, docstrings, or sphinx documentation.</li> <li>Misc: Rename functions in <code>plot.py</code> utils file for coverage report.</li> </ul>"},{"location":"changelog/#fixed_10","title":"Fixed","text":"<ul> <li>Misc: Fixed doctests and automate doctest checks.</li> </ul>"},{"location":"changelog/#0147-2023-12-22","title":"0.14.7 - 2023-12-22","text":""},{"location":"changelog/#changed_12","title":"Changed","text":"<ul> <li>Tree Helper: <code>get_tree_diff</code> enhanced to compare tree attributes by taking in <code>attr_list</code> parameter, and indicates difference with <code>(~)</code>.</li> </ul>"},{"location":"changelog/#fixed_11","title":"Fixed","text":"<ul> <li>Tree Helper: <code>get_tree_diff</code> compare tree structure by considering all nodes (previously only consider leaf nodes).</li> </ul>"},{"location":"changelog/#0146-2023-12-14","title":"0.14.6 - 2023-12-14","text":""},{"location":"changelog/#added_10","title":"Added","text":"<ul> <li>Node: Able to access and delete node children via name with square bracket accessor with <code>__getitem__</code> and <code>__delitem__</code> magic methods.</li> <li>BaseNode/Node/BinaryNode: Able to add one or more children with <code>append</code> and <code>extend</code> methods.</li> <li>BaseNode/Node/BinaryNode: Able to check if node contains child node with <code>__contains__</code> magic method.</li> <li>BaseNode/Node/BinaryNode: Able to iterate the node to access children with <code>__iter__</code> magic method. Results in children setter to only accept list/tuple/set instead of iterable types.</li> </ul>"},{"location":"changelog/#changed_13","title":"Changed","text":"<ul> <li>Tree Exporter: <code>tree_to_dot</code> accepts callable to set node and edge attrs for custom node (backward-compatible).</li> <li>Tree Exporter: <code>tree_to_mermaid</code> accepts callable to set node shape attr, edge arrow attr and node attr for custom node (backward-compatible).</li> <li>Tree Exporter: Change delimiter for <code>tree_to_mermaid</code> to prevent possible path confusion (backward-compatible).</li> <li>Misc: Code abstraction for assertion checks and constants.</li> <li>Misc: Documentation for exporting tree/dag to dot.</li> </ul>"},{"location":"changelog/#0145-2023-11-24","title":"0.14.5 - 2023-11-24","text":""},{"location":"changelog/#changed_14","title":"Changed","text":"<ul> <li>Misc: Update SECURITY file.</li> <li>Misc: Documentation enhancement to add more emoji, and highlight code blocks.</li> </ul>"},{"location":"changelog/#0144-2023-11-04","title":"0.14.4 - 2023-11-04","text":""},{"location":"changelog/#changed_15","title":"Changed","text":"<ul> <li>Misc: Clean up github actions.</li> </ul>"},{"location":"changelog/#0143-2023-10-31","title":"0.14.3 - 2023-10-31","text":""},{"location":"changelog/#added_11","title":"Added","text":"<ul> <li>Misc: Publish to conda, enable automated publishing to conda-forge in addition to existing PyPI.</li> <li>Misc: Tree demonstration code for <code>shift_and_replace_nodes</code> and <code>copy_and_replace_nodes_from_tree_to_tree</code> in README.</li> </ul>"},{"location":"changelog/#0142-2023-10-21","title":"0.14.2 - 2023-10-21","text":""},{"location":"changelog/#added_12","title":"Added","text":"<ul> <li>Misc: RTD integration.</li> <li>Misc: Enable manual publishing of python package.</li> </ul>"},{"location":"changelog/#0141-2023-10-18","title":"0.14.1 - 2023-10-18","text":""},{"location":"changelog/#added_13","title":"Added","text":"<ul> <li>Misc: Changes to main branch checks if the latest version exists (using git tag) before publishing package and building documentation.</li> </ul>"},{"location":"changelog/#0140-2023-10-18","title":"0.14.0 - 2023-10-18","text":""},{"location":"changelog/#added_14","title":"Added","text":"<ul> <li>Tree Modifier: Shift nodes with replacement of to-node with <code>shift_and_replace_nodes</code>.</li> <li>Tree Modifier: Copy nodes from tree to tree with replacement of to-node with <code>copy_and_replace_nodes_from_tree_to_tree</code>.</li> <li>Tree Modifier: Any permutation of configuration with replacement of to-node with <code>replace_logic</code>.</li> <li>Tree Modifier: Add relevant test cases and documentations accordingly.</li> </ul>"},{"location":"changelog/#0133-2023-10-17","title":"0.13.3 - 2023-10-17","text":""},{"location":"changelog/#added_15","title":"Added","text":"<ul> <li>Misc: Add automatic release notes with content into GitHub workflow.</li> </ul>"},{"location":"changelog/#0132-2023-10-17","title":"0.13.2 - 2023-10-17","text":""},{"location":"changelog/#added_16","title":"Added","text":"<ul> <li>Misc: Add automatic release notes into GitHub workflow.</li> </ul>"},{"location":"changelog/#0131-2023-10-15","title":"0.13.1 - 2023-10-15","text":""},{"location":"changelog/#added_17","title":"Added","text":"<ul> <li>Misc: Add automatic comment on code coverage to pull requests into GitHub workflow.</li> <li>Misc: Add more checks into pre-commit.</li> </ul>"},{"location":"changelog/#0130-2023-09-29","title":"0.13.0 - 2023-09-29","text":""},{"location":"changelog/#added_18","title":"Added","text":"<ul> <li>Tree Exporter: Export tree to flowchart diagram in mermaid markdown format using <code>tree_to_mermaid</code>.</li> </ul>"},{"location":"changelog/#changed_16","title":"Changed","text":"<ul> <li>Tree Exporter: Relax type hinting using TypeVar for <code>clone_tree</code>.</li> <li>Tree Helper: Accept Iterable instead of List for custom_style attribute of <code>yield_tree</code> and <code>print_tree</code>.</li> <li>Misc: Fix docstring for better presentation of code vs variable vs normal text.</li> </ul>"},{"location":"changelog/#0125-2023-09-26","title":"0.12.5 - 2023-09-26","text":""},{"location":"changelog/#added_19","title":"Added","text":"<ul> <li>Utility Groot: Add test cases.</li> </ul>"},{"location":"changelog/#fixed_12","title":"Fixed","text":"<ul> <li>Tree Exporter: <code>tree_to_pillow</code> function to reference online font file instead of relative path.</li> </ul>"},{"location":"changelog/#0124-2023-09-25","title":"0.12.4 - 2023-09-25","text":""},{"location":"changelog/#added_20","title":"Added","text":"<ul> <li>Utility Groot: Add groot utility functions.</li> </ul>"},{"location":"changelog/#0123-2023-09-17","title":"0.12.3 - 2023-09-17","text":""},{"location":"changelog/#changed_17","title":"Changed","text":"<ul> <li>Clearer documentation, fixed docstring phrasing and spelling.</li> <li>Clearer error messages, standardized error messages.</li> </ul>"},{"location":"changelog/#0122-2023-09-12","title":"0.12.2 - 2023-09-12","text":""},{"location":"changelog/#changed_18","title":"Changed","text":"<ul> <li>Tree Plot: Reingold Tilford Algorithm code for succinctness and docstring.</li> </ul>"},{"location":"changelog/#0121-2023-09-11","title":"0.12.1 - 2023-09-11","text":""},{"location":"changelog/#fixed_13","title":"Fixed","text":"<ul> <li>Tree Plot: Reingold Tilford Algorithm to handle cases of negative x-coordinates with adjustment parameter.</li> </ul>"},{"location":"changelog/#0120-2023-09-09","title":"0.12.0 - 2023-09-09","text":""},{"location":"changelog/#changed_19","title":"Changed","text":"<ul> <li>Tree/DAG Constructor, Tree/DAG Exporter: Make <code>pandas</code> optional dependency.</li> </ul>"},{"location":"changelog/#fixed_14","title":"Fixed","text":"<ul> <li>Misc: Fixed Calendar workflow to throw error when <code>to_dataframe</code> method is called on empty calendar.</li> <li>Tree/DAGNode Exporter, Tree Helper, Tree Search: Relax type hinting using TypeVar.</li> </ul>"},{"location":"changelog/#0110-2023-09-08","title":"0.11.0 - 2023-09-08","text":""},{"location":"changelog/#added_21","title":"Added","text":"<ul> <li>Tree Helper: Pruning tree to allow pruning by <code>prune_path</code> and <code>max_depth</code>.</li> <li>Tree Plot: Implement Enhanced Reingold Tilford Algorithm to retrieve (x, y) coordinates for a tree structure.</li> </ul>"},{"location":"changelog/#changed_20","title":"Changed","text":"<ul> <li>BaseNode/DAGNode: <code>get_attr</code> method to allow default return value.</li> </ul>"},{"location":"changelog/#fixed_15","title":"Fixed","text":"<ul> <li>Utility Iterator: Relax type hinting using TypeVar.</li> </ul>"},{"location":"changelog/#0103-2023-08-12","title":"0.10.3 - 2023-08-12","text":""},{"location":"changelog/#added_22","title":"Added","text":"<ul> <li>Tree Constructor: <code>add_path_to_tree</code>, <code>dataframe_to_tree</code>, <code>dataframe_to_tree_by_relation</code> to allow custom node types that takes in constructor arguments.</li> </ul>"},{"location":"changelog/#changed_21","title":"Changed","text":"<ul> <li>Binary Tree: Able to accept node val of <code>str</code> type besides <code>int</code> type.</li> </ul>"},{"location":"changelog/#0102-2023-08-11","title":"0.10.2 - 2023-08-11","text":""},{"location":"changelog/#fixed_16","title":"Fixed","text":"<ul> <li>Tree Constructor: <code>nested_dict_to_tree</code> to throw TypeError if child_key is not list type.</li> </ul>"},{"location":"changelog/#0101-2023-07-27","title":"0.10.1 - 2023-07-27","text":""},{"location":"changelog/#added_23","title":"Added","text":"<ul> <li>[#71] Node: <code>path_name</code> to allow different node name of different dtypes; map everything to string type.</li> </ul>"},{"location":"changelog/#0100-2023-07-15","title":"0.10.0 - 2023-07-15","text":""},{"location":"changelog/#added_24","title":"Added","text":"<ul> <li>[#65] Tree Search: Implement <code>find_relative_path</code> to find relative path from node.</li> <li>[#65] Utility Iterator: Implement <code>zigzag_iter</code> and <code>zigzaggroup_iter</code> Tree traversal methods.</li> </ul>"},{"location":"changelog/#095-2023-07-13","title":"0.9.5 - 2023-07-13","text":""},{"location":"changelog/#added_25","title":"Added","text":"<ul> <li>Misc: Added init files, add link to discussions to README and pyproject, add sphinx coverage shortcuts.</li> </ul>"},{"location":"changelog/#fixed_17","title":"Fixed","text":"<ul> <li>[#66] DAGNode/Node: Children constructor to allow Iterable types, fixed issue of lists being mutable.</li> <li>[#67] Node: <code>path_name</code> to reduce number of recursive calls to root node for <code>sep</code>.</li> </ul>"},{"location":"changelog/#094-2023-06-18","title":"0.9.4 - 2023-06-18","text":""},{"location":"changelog/#added_26","title":"Added","text":"<ul> <li>Tree Constructor: <code>list_to_tree_by_relation</code> and <code>dataframe_to_tree_by_relation</code> method to allow duplicate intermediate nodes (default is false).</li> <li>DAG Exporter: Added <code>node_shape</code> parameter in <code>dag_to_dot</code> export function for easier way to customize node shape.</li> <li>Misc: More test cases.</li> <li>Misc: Added security instructions on how to raise vulnerabilities.</li> <li>Misc: Added Calendar workflow to documentation.</li> </ul>"},{"location":"changelog/#changed_22","title":"Changed","text":"<ul> <li>Tree Constructor: <code>add_dict_to_tree_by_name</code> method rename argument from <code>path_attrs</code> to <code>name_attrs</code>.</li> <li>Misc: Modified contributing instructions.</li> </ul>"},{"location":"changelog/#fixed_18","title":"Fixed","text":"<ul> <li>Tree Exporter: <code>tree_to_dot</code> to handle cases when not all nodes have <code>edge_attr</code>.</li> <li>DAG Exporter: <code>dag_to_dot</code> to perform dictionary copy to prevent style from being overridden for child nodes.</li> <li>Tree Constructor: <code>dataframe_to_tree</code> to handle case when path column is not the first column.</li> </ul>"},{"location":"changelog/#093-2023-05-28","title":"0.9.3 - 2023-05-28","text":""},{"location":"changelog/#changed_23","title":"Changed","text":"<ul> <li>Tree Constructor: Relax type hint to <code>Iterable</code> instead of <code>List</code> for <code>list_to_tree</code> and <code>list_to_tree_by_relation</code> methods.</li> </ul>"},{"location":"changelog/#fixed_19","title":"Fixed","text":"<ul> <li>Node: Fix error message when trees have different <code>sep</code>.</li> </ul>"},{"location":"changelog/#092-2023-04-09","title":"0.9.2 - 2023-04-09","text":""},{"location":"changelog/#added_27","title":"Added","text":"<ul> <li>Node: Added <code>show</code> method to print tree to console.</li> <li>Workflow Calendar: Tree use case with calendar implementation.</li> </ul>"},{"location":"changelog/#091-2023-03-30","title":"0.9.1 - 2023-03-30","text":""},{"location":"changelog/#changed_24","title":"Changed","text":"<ul> <li>Node: Added <code>sep</code> parameter to constructor instead of using getter and setter methods to set <code>sep</code>.</li> </ul>"},{"location":"changelog/#090-2023-03-29","title":"0.9.0 - 2023-03-29","text":""},{"location":"changelog/#added_28","title":"Added","text":"<ul> <li>Tree Modifier: Ability to copy/shift nodes with full path in <code>from_paths</code> for faster search performance, added <code>with_full_path</code> parameter.</li> </ul>"},{"location":"changelog/#changed_25","title":"Changed","text":"<ul> <li>Tree Modifier: Enforced paths in <code>to_paths</code> to be full path for faster search performance.</li> <li>Tree Modifier: Faster creation of intermediate parent nodes in <code>to_paths</code>.</li> <li>Tree Modifier: Better handling of <code>sep</code> in paths by performing string replacement at the start.</li> <li>Tree Modifier: Check and throw error for invalid parameters, case when node is meant to be deleted but <code>copy=True</code>.</li> </ul>"},{"location":"changelog/#fixed_20","title":"Fixed","text":"<ul> <li>Tree Modifier: Fix issue trailing <code>sep</code> differing in <code>from_paths</code> and <code>to_paths</code> which should not throw error.</li> </ul>"},{"location":"changelog/#084-2023-03-24","title":"0.8.4 - 2023-03-24","text":""},{"location":"changelog/#added_29","title":"Added","text":"<ul> <li>Tree Search: Implement <code>find_child</code> and <code>find_children</code> to find single child or multiple children based on user-defined condition.</li> </ul>"},{"location":"changelog/#changed_26","title":"Changed","text":"<ul> <li>Tree and DAG Constructor: Reduce reliance on <code>numpy</code> package, only reject <code>None</code> attributes when creating tree from DataFrame (previously it rejects <code>[None]</code>).</li> <li>Tree Helper: Get difference between two trees reduce reliance on <code>numpy</code> package, enhance test cases.</li> <li>Tree Search: Renamed <code>find_children</code> to <code>find_child_by_name</code> for clarity.</li> <li>Misc: Fix README for Windows installation.</li> </ul>"},{"location":"changelog/#083-2023-03-16","title":"0.8.3 - 2023-03-16","text":""},{"location":"changelog/#changed_27","title":"Changed","text":"<ul> <li>Workflow: Misc refactor and update log statements.</li> <li>Misc: Fix coverage report.</li> </ul>"},{"location":"changelog/#082-2023-03-16","title":"0.8.2 - 2023-03-16","text":""},{"location":"changelog/#changed_28","title":"Changed","text":"<ul> <li>Misc: Type checking to remove optional requirement for <code>mypy</code>.</li> <li>Misc: Shift .flake8, .mypy.ini, and pytest.ini files to pyproject.toml.</li> </ul>"},{"location":"changelog/#081-2023-03-10","title":"0.8.1 - 2023-03-10","text":""},{"location":"changelog/#fixed_21","title":"Fixed","text":"<ul> <li>Tree Modifier: Fix issue of <code>sep</code> of tree differing from the <code>sep</code> in <code>from_paths</code> and <code>to_paths</code>.</li> </ul>"},{"location":"changelog/#080-2023-03-10","title":"0.8.0 - 2023-03-10","text":""},{"location":"changelog/#added_30","title":"Added","text":"<ul> <li>Misc: Type checking with <code>mypy</code>, added type checks to pre-commit hooks.</li> </ul>"},{"location":"changelog/#changed_29","title":"Changed","text":"<ul> <li>DAGNode: <code>go_to</code> method to be consistent with <code>List[List[DAGNode]]</code> type.</li> </ul>"},{"location":"changelog/#fixed_22","title":"Fixed","text":"<ul> <li>Tree Exporter: Exception handling in <code>yield_tree</code> if <code>node_name_or_path</code> is not found.</li> <li>Workflow: Exception handling in prioritizing item/list if item/list is not the correct tree depth.</li> <li>Workflow: Exception handling in removing item/list if item/list is not found.</li> </ul>"},{"location":"changelog/#074-2023-02-27","title":"0.7.4 - 2023-02-27","text":""},{"location":"changelog/#fixed_23","title":"Fixed","text":"<ul> <li>Tree Constructor: Fixed pandas SettingwithCopyWarning when performing dataframe operations.</li> </ul>"},{"location":"changelog/#073-2023-02-25","title":"0.7.3 - 2023-02-25","text":""},{"location":"changelog/#added_31","title":"Added","text":"<ul> <li>Tree Exporter: Fixed <code>print_tree</code> checking attributes with <code>hasattr</code> to handle cases of null or 0 value attributes, add more test cases.</li> <li>Misc: Added more description to Contributing.</li> </ul>"},{"location":"changelog/#072-2023-02-18","title":"0.7.2 - 2023-02-18","text":""},{"location":"changelog/#added_32","title":"Added","text":"<ul> <li>Tree Exporter: Added <code>node_shape</code> parameter in <code>tree_to_dot</code> export function for easier way to customize node shape.</li> </ul>"},{"location":"changelog/#071-2023-02-18","title":"0.7.1 - 2023-02-18","text":""},{"location":"changelog/#added_33","title":"Added","text":"<ul> <li>BaseNode/Node: Added <code>go_to</code> BaseNode method to travel from one node to another node from the same tree.</li> <li>DAGNode: Added <code>go_to</code> DAGNode method to travel from one node to another node from the same DAG.</li> </ul>"},{"location":"changelog/#070-2023-02-18","title":"0.7.0 - 2023-02-18","text":""},{"location":"changelog/#added_34","title":"Added","text":"<ul> <li>Tree Modifier: Accept <code>merge_leaves</code> type of modification, enhance documentation to provide more examples and illustrations.</li> </ul>"},{"location":"changelog/#0610-2023-01-23","title":"0.6.10 - 2023-01-23","text":""},{"location":"changelog/#fixed_24","title":"Fixed","text":"<ul> <li>Tree Constructor: <code>str_to_tree</code> accept prefixes to support unicode characters in node names.</li> </ul>"},{"location":"changelog/#069-2023-01-22","title":"0.6.9 - 2023-01-22","text":""},{"location":"changelog/#added_35","title":"Added","text":"<ul> <li>Tree Construct: <code>str_to_tree</code> to construct tree from tree string.</li> </ul>"},{"location":"changelog/#068-2023-01-14","title":"0.6.8 - 2023-01-14","text":""},{"location":"changelog/#fixed_25","title":"Fixed","text":"<ul> <li>Tree Exporter: <code>tree_to_dot</code> to perform dictionary copy to prevent style from being overridden for child nodes.</li> </ul>"},{"location":"changelog/#067-2023-01-09","title":"0.6.7 - 2023-01-09","text":""},{"location":"changelog/#changed_30","title":"Changed","text":"<ul> <li>Binary Tree: Changed <code>BNode</code> to <code>BinaryNode</code>, and construct method <code>list_to_btree</code> to <code>list_to_binarytree</code>.</li> </ul>"},{"location":"changelog/#066-2022-12-15","title":"0.6.6 - 2022-12-15","text":""},{"location":"changelog/#added_36","title":"Added","text":"<ul> <li>Tree Exporter: Export <code>print_tree</code> output to image using Pillow package.</li> </ul>"},{"location":"changelog/#065-2022-12-07","title":"0.6.5 - 2022-12-07","text":""},{"location":"changelog/#added_37","title":"Added","text":"<ul> <li>Tree Modifier: Shift/copy nodes able to shift node-only and delete the children (backwards-compatible).</li> </ul>"},{"location":"changelog/#064-2022-11-16","title":"0.6.4 - 2022-11-16","text":""},{"location":"changelog/#fixed_26","title":"Fixed","text":"<ul> <li>BNode: Minor fix on rollback functionality when original children includes None.</li> </ul>"},{"location":"changelog/#063-2022-11-15","title":"0.6.3 - 2022-11-15","text":""},{"location":"changelog/#added_38","title":"Added","text":"<ul> <li>DAGNode: Rollback functionality to original state when there is error setting parent and children (backwards-compatible).</li> </ul>"},{"location":"changelog/#changed_31","title":"Changed","text":"<ul> <li>BaseNode, BNode, DAGNode: Refactor by abstracting checks.</li> </ul>"},{"location":"changelog/#fixed_27","title":"Fixed","text":"<ul> <li>BaseNode: Fix rollback logic to handle failure in pre-assign checks and reassigning same child / parent.</li> <li>BNode: Fix issue of reassigning children shifting existing child from right to left.</li> </ul>"},{"location":"changelog/#062-2022-11-15","title":"0.6.2 - 2022-11-15","text":""},{"location":"changelog/#changed_32","title":"Changed","text":"<ul> <li>Tree Modifier: Shorter logging messages.</li> </ul>"},{"location":"changelog/#061-2022-11-14","title":"0.6.1 - 2022-11-14","text":""},{"location":"changelog/#changed_33","title":"Changed","text":"<ul> <li>Tree Modifier: Handle shifting/copying that removes intermediate layer (backwards-compatible).</li> </ul>"},{"location":"changelog/#060-2022-11-13","title":"0.6.0 - 2022-11-13","text":""},{"location":"changelog/#added_39","title":"Added","text":"<ul> <li>BaseNode: Rollback functionality to original state when there is error setting parent and children (backwards-compatible).</li> <li>BaseNode and DAGNode: Type hints.</li> <li>BNode: Node class for Binary Tree.</li> <li>BTree Constructor: From list.</li> <li>BNode Iterator: Level-Order Iterator.</li> <li>Misc: Add Tips and Tricks to documentation (List Directory).</li> </ul>"},{"location":"changelog/#fixed_28","title":"Fixed","text":"<ul> <li>DAGNode: Fix issue of duplicate parent constructor creating duplicate children.</li> </ul>"},{"location":"changelog/#055-2022-11-12","title":"0.5.5 - 2022-11-12","text":""},{"location":"changelog/#added_40","title":"Added","text":"<ul> <li>Misc: More docstring examples.</li> <li>Misc: More test cases.</li> </ul>"},{"location":"changelog/#fixed_29","title":"Fixed","text":"<ul> <li>Tree Modifier: Fix issue with <code>merge_children</code> argument not working as expected.</li> </ul>"},{"location":"changelog/#054-2022-11-12","title":"0.5.4 - 2022-11-12","text":""},{"location":"changelog/#added_41","title":"Added","text":"<ul> <li>BaseNode: Add sort() to sort children.</li> <li>Node: Made more extendable with pre-/post-assign checks.</li> <li>Misc: Add Tips and Tricks to documentation (Extending Nodes).</li> <li>Misc: More test cases.</li> </ul>"},{"location":"changelog/#fixed_30","title":"Fixed","text":"<ul> <li>Tree Search: Type hints.</li> </ul>"},{"location":"changelog/#053-2022-11-11","title":"0.5.3 - 2022-11-11","text":""},{"location":"changelog/#added_42","title":"Added","text":"<ul> <li>DAG and Tree Exporter: More customizations allowed on edges.</li> <li>Add Tips and Tricks to documentation (Weighted Trees, Merging Trees).</li> </ul>"},{"location":"changelog/#fixed_31","title":"Fixed","text":"<ul> <li>Tree Modifier: Fix issue with <code>merge_children</code> argument not working as expected.</li> </ul>"},{"location":"changelog/#052-2022-11-10","title":"0.5.2 - 2022-11-10","text":""},{"location":"changelog/#fixed_32","title":"Fixed","text":"<ul> <li>Tree Constructor: Fix issue <code>dataframe_to_tree_by_relation</code> unable to find parent node.</li> </ul>"},{"location":"changelog/#051-2022-11-09","title":"0.5.1 - 2022-11-09","text":""},{"location":"changelog/#added_43","title":"Added","text":"<ul> <li>Misc: Clean codes and documentation.</li> </ul>"},{"location":"changelog/#050-2022-11-09","title":"0.5.0 - 2022-11-09","text":""},{"location":"changelog/#added_44","title":"Added","text":"<ul> <li>Misc: Clean codes and documentation.</li> </ul>"},{"location":"changelog/#changed_34","title":"Changed","text":"<ul> <li>Tree Exporter: Printing tree to group multiple arguments together.</li> <li>DAG and Tree Exporter: Export to dot able to plot multiple disjointed trees/dags, rename <code>bgcolor</code> to <code>bg_colour</code>.</li> </ul>"},{"location":"changelog/#046-2022-11-09","title":"0.4.6 - 2022-11-09","text":""},{"location":"changelog/#added_45","title":"Added","text":"<ul> <li>Tree Constructor: From DataFrame of parent-child columns.</li> </ul>"},{"location":"changelog/#changed_35","title":"Changed","text":"<ul> <li>Tree Exporter: Printing tree to define node name or path, and default to const style.</li> <li>Tree Constructor: Rename <code>list_to_tree_tuples</code> to <code>list_to_tree_by_relation</code>.</li> <li>Tree Constructor: Remove parameter <code>sep</code> for <code>nested_dict_to_tree</code>.</li> </ul>"},{"location":"changelog/#045-2022-11-08","title":"0.4.5 - 2022-11-08","text":""},{"location":"changelog/#changed_36","title":"Changed","text":"<ul> <li>Tree Exporter: Printing tree with added ability to omit null attributes.</li> </ul>"},{"location":"changelog/#044-2022-11-08","title":"0.4.4 - 2022-11-08","text":""},{"location":"changelog/#fixed_33","title":"Fixed","text":"<ul> <li>Tree Constructor: Handle adding attributes that are array-like - add array even when one of the items is null.</li> </ul>"},{"location":"changelog/#043-2022-11-08","title":"0.4.3 - 2022-11-08","text":""},{"location":"changelog/#added_46","title":"Added","text":"<ul> <li>Node: Print format for BaseNode.</li> </ul>"},{"location":"changelog/#042-2022-11-08","title":"0.4.2 - 2022-11-08","text":""},{"location":"changelog/#fixed_34","title":"Fixed","text":"<ul> <li>Tree Constructor: For list of tuples, handle cases where parent name is None.</li> </ul>"},{"location":"changelog/#041-2022-11-07","title":"0.4.1 - 2022-11-07","text":""},{"location":"changelog/#fixed_35","title":"Fixed","text":"<ul> <li>Tree Constructor: Handle adding attributes that are array-like - error in drop_duplicate() and pd.isnull().</li> </ul>"},{"location":"changelog/#040-2022-11-07","title":"0.4.0 - 2022-11-07","text":""},{"location":"changelog/#added_47","title":"Added","text":"<ul> <li>Tree Constructor: From list of tuples of parent-child.</li> </ul>"},{"location":"changelog/#033-2022-11-07","title":"0.3.3 - 2022-11-07","text":""},{"location":"changelog/#added_48","title":"Added","text":"<ul> <li>DAG Exporter: To list, nested dictionary, pandas DataFrame.</li> </ul>"},{"location":"changelog/#changed_37","title":"Changed","text":"<ul> <li>BaseNode and DAGNode: Modify docstring.</li> <li>Tree Exporter: Support Nodes with same name.</li> <li>Tree Modifier: Modify docstring.</li> <li>Utility Iterator: Modify docstring.</li> </ul>"},{"location":"changelog/#032-2022-11-07","title":"0.3.2 - 2022-11-07","text":""},{"location":"changelog/#fixed_36","title":"Fixed","text":"<ul> <li>Tree Exporter: Fix edge direction error.</li> </ul>"},{"location":"changelog/#031-2022-11-07","title":"0.3.1 - 2022-11-07","text":""},{"location":"changelog/#added_49","title":"Added","text":"<ul> <li>Tree and DAG Exporter: More customizations for Node to dot and DAGNode to dot.</li> </ul>"},{"location":"changelog/#030-2022-11-05","title":"0.3.0 - 2022-11-05","text":""},{"location":"changelog/#added_50","title":"Added","text":"<ul> <li>DAG Constructor: From list, nested dictionary, pandas DataFrame.</li> <li>Utility Iterator: DAG traversal methods.</li> </ul>"},{"location":"changelog/#changed_38","title":"Changed","text":"<ul> <li>Tree Exporter and DAG Exporter: More customizations for Node to dot and DAGNode to dot.</li> </ul>"},{"location":"changelog/#020-2022-11-03","title":"0.2.0 - 2022-11-03","text":""},{"location":"changelog/#added_51","title":"Added","text":"<ul> <li>Node: DAGNode for creating DAG graph.</li> <li>Tree Exporter: Support Node to dot which can export to png, svg, jpeg, dot files.</li> <li>DAG Exporter: Support DAGNode to dot.</li> </ul>"},{"location":"changelog/#010-2022-11-01","title":"0.1.0 - 2022-11-01","text":""},{"location":"changelog/#added_52","title":"Added","text":"<ul> <li>Node: Node and BaseNode.</li> <li>Tree Constructor: From list, nested dictionary, pandas DataFrame.</li> <li>Tree Exporter: To list, nested dictionary, pandas DataFrame.</li> <li>Tree Helper: Cloning, pruning trees, get difference between two trees.</li> <li>Tree Modifier: Shift and copy nodes within tree and between trees.</li> <li>Tree Search: Find single or multiple nodes based on name, attribute, or custom criteria.</li> <li>Utility Iterator: Tree traversal methods.</li> <li>Workflow To Do App: Tree use case with to-do list implementation.</li> </ul>"},{"location":"contributing/","title":"\ud83c\udf6a Contributing","text":"<p>bigtree is a tree implementation package for Python. It integrates with Python lists, dictionaries, and pandas DataFrame.</p> <p>Thank you for taking the time to contribute. Contributing to this package is an excellent opportunity to dive into tree implementations.</p>"},{"location":"contributing/#set-up","title":"Set Up","text":"<p>First, fork the repository and clone the forked repository.</p> <pre><code>$ git clone git@github.com:&lt;your-username&gt;/bigtree.git\n</code></pre> <p>Next, create a virtual environment and activate it.</p> <pre><code>$ conda create -n bigtree_venv python=3.10\n$ conda activate bigtree_venv\n</code></pre> <p>To check if it worked,</p> <pre><code>$ which pip\n/&lt;some directory&gt;/envs/bigtree_venv/bin/pip\n</code></pre> <p>From the project folder, install the required python packages locally in editable mode and set up pre-commit checks.</p> <pre><code>$ python -m pip install -e \".[all]\"\n$ python -m pip install pre-commit\n$ pre-commit install\n</code></pre>"},{"location":"contributing/#developing","title":"Developing","text":"<p>After making your changes, create a new branch, add and commit your changed files. In this example, lets assume the changed file is <code>README.md</code>. If there are any pre-commit changes and/or comments, do modify, re-add and re-commit your files.</p> <pre><code>$ git checkout -b chore/update-readme\n$ git add README.md\n$ git commit -m \"chore: updated README\"\n</code></pre> <p>Push your changes to your created branch and create a pull request from your fork.</p> <pre><code>$ git push origin chore/update-readme\n</code></pre>"},{"location":"contributing/#testing-and-documentation","title":"Testing and Documentation","text":"<p>If there are changes related to code, please make sure that the unit tests pass and the code coverage is 100%.</p> <pre><code>$ python -m pip install pytest coverage\n$ pytest --cov-report=term-missing --cov-config=pyproject.toml --cov=bigtree\n</code></pre> <p>Make sure your add/update the tests and documentations accordingly.</p> <p>If there are changes to the docstrings and/or sample codes in the docstring, do run the following lines of code to generate the coverage report and test report for docstrings. Refer to the console log for information on the file location of the reports.</p> <pre><code>$ python -m pip install hatch\n$ hatch run docs:coverage\n$ hatch run docs:doctest\n</code></pre>"},{"location":"contributing/#convention-and-standards","title":"Convention and Standards","text":"<p>When creating branches, it is recommended to create them in the format <code>type/action</code>. For example,</p> <pre><code>$ git checkout -b feat/add-this\n</code></pre> <p>During pre-commit checks, this project enforces conventional commits when writing commit messages, and checks and formats code using <code>black</code>, <code>flake8</code>, <code>isort</code>, and <code>mypy</code>. - The regex for conventional commits is as such <code>(?s)(build|ci|docs|feat|fix|perf|refactor|style|test|chore|revert|bump)(\\(\\S+\\))?!?:( [^\\n\\r]+)((\\n\\n.*)|(\\s*))?$</code>.</p> <p>For testing, this project uses <code>pytest</code> and <code>coverage</code> package for testing of codes, and <code>docstr-coverage</code> and <code>doctest</code> package for testing of docstrings.</p>"},{"location":"contributing/#consequent-changes","title":"Consequent Changes","text":"<p>Please open an issue to discuss important changes before embarking on an implementation.</p>"},{"location":"dag/","title":"\ud83c\udf34 Directed Acyclic Graph (DAG)","text":"<p>For Directed Acyclic Graph (DAG) implementation, there are 4 main components.</p>"},{"location":"dag/#node","title":"\ud83c\udf3c Node","text":"<ul> <li><code>DAGNode</code>, extendable class for constructing Directed Acyclic Graph (DAG)</li> </ul>"},{"location":"dag/#constructing-dag","title":"\u2728 Constructing DAG","text":"<ul> <li>From list, containing parent-child tuples</li> <li>From nested dictionary</li> <li>From pandas DataFrame</li> </ul>"},{"location":"dag/#traversing-dag","title":"\u27b0 Traversing DAG","text":"<ul> <li>Generic traversal method</li> </ul>"},{"location":"dag/#exporting-dag","title":"\ud83d\udd28 Exporting DAG","text":"<ul> <li>Export to list, dictionary, or pandas DataFrame</li> <li>Export DAG to dot (can save to .dot, .png, .svg, .jpeg files)</li> </ul>"},{"location":"home/","title":"\ud83c\udf33 Documentation","text":"<p>Tree Implementation and Methods for Python, integrated with Python list, dictionary, and pandas DataFrame.</p> <p>It is pythonic, making it easy to learn and extendable to many types of workflows.</p> <ul> <li> Set up in 2 minutes <p>Install <code>bigtree</code> with <code>pip</code> or <code>conda</code> and get up   and running in minutes</p> <p> Getting started</p> </li> </ul> <ul> <li> Getting started <p>View demonstration on how to use <code>bigtree</code></p> <p> Reference</p> </li> </ul> <ul> <li> Resources <p>Articles relating to trees and <code>bigtree</code></p> <p> View articles</p> </li> </ul> <ul> <li> Support bigtree <p>Do support if you like this project!</p> <p> Support me</p> </li> </ul> <p>Related Links:</p> <ul> <li>Community: Issues / Discussions</li> <li>Package: PyPI / Conda</li> </ul>"},{"location":"install/","title":"\ud83d\udcbb Installation","text":"<p>There are two ways to install <code>bigtree</code>, with pip (recommended) or conda.</p>"},{"location":"install/#installation-with-pip","title":"Installation with pip","text":"<p>To install <code>bigtree</code>, run the following line in command prompt:</p> pip install bigtreeInstalled <p>If tree needs to use pandas methods, it requires additional dependencies. Run the following line in command prompt:</p> pip install 'bigtree[pandas]' <p>If tree needs to be exported to image, it requires additional dependencies. Run the following lines in command prompt:</p> pip install 'bigtree[image]'brew install gprof2dot  # for MacOSconda install graphviz  # for Windows <p>Alternatively, install all optional dependencies with the following line in command prompt:</p> pip install 'bigtree[all]'"},{"location":"install/#installation-with-conda","title":"Installation with conda","text":"<p>To install <code>bigtree</code> with conda, run the following line in command prompt:</p> conda install -c conda-forge bigtree"},{"location":"tree/","title":"\ud83c\udf32 Tree","text":"<p>For Tree implementation, there are 9 main components.</p>"},{"location":"tree/#node","title":"\ud83c\udf3a Node","text":"<ul> <li><code>BaseNode</code>, extendable class</li> <li><code>Node</code>, BaseNode with node name attribute</li> </ul>"},{"location":"tree/#constructing-tree","title":"\u2728 Constructing Tree","text":"<ul> <li>From <code>Node</code>, using parent and children constructors</li> <li>From str, using tree display or Newick string notation</li> <li>From list, using paths or parent-child tuples</li> <li>From nested dictionary, using path-attribute key-value pairs or recursive structure</li> <li>From pandas DataFrame, using paths or parent-child columns</li> <li>Add nodes to existing tree using path string</li> <li>Add nodes and attributes to existing tree using dictionary or pandas DataFrame, using path</li> <li>Add only attributes to existing tree using dictionary or pandas DataFrame, using node name</li> </ul>"},{"location":"tree/#traversing-tree","title":"\u27b0 Traversing Tree","text":"<ul> <li>Pre-Order Traversal</li> <li>Post-Order Traversal</li> <li>Level-Order Traversal</li> <li>Level-Order-Group Traversal</li> <li>ZigZag Traversal</li> <li>ZigZag-Group Traversal</li> </ul>"},{"location":"tree/#modifying-tree","title":"\ud83d\udcdd Modifying Tree","text":"<ul> <li>Copy nodes from location to destination</li> <li>Shift nodes from location to destination</li> <li>Shift and replace nodes from location to destination</li> <li>Copy nodes from one tree to another</li> <li>Copy and replace nodes from one tree to another</li> </ul>"},{"location":"tree/#tree-search","title":"\ud83d\udd0d Tree Search","text":"<ul> <li>Find multiple nodes based on name, partial path, relative path, attribute value, user-defined condition</li> <li>Find single nodes based on name, partial path, relative path, full path, attribute value, user-defined condition</li> <li>Find multiple child nodes based on user-defined condition</li> <li>Find single child node based on name, user-defined condition</li> </ul>"},{"location":"tree/#helper-function","title":"\ud83d\udd27 Helper Function","text":"<ul> <li>Cloning tree to another <code>Node</code> type</li> <li>Get subtree (smaller tree with different root)</li> <li>Prune tree (smaller tree with same root)</li> <li>Get difference between two trees</li> </ul>"},{"location":"tree/#plotting-tree","title":"\ud83d\udcca Plotting Tree","text":"<ul> <li>Enhanced Reingold Tilford Algorithm to retrieve (x, y) coordinates for a tree structure</li> </ul>"},{"location":"tree/#exporting-tree","title":"\ud83d\udd28 Exporting Tree","text":"<ul> <li>Print to console, in vertical or horizontal orientation</li> <li>Export to Newick string notation, dictionary, nested dictionary, or pandas DataFrame</li> <li>Export tree to dot (can save to .dot, .png, .svg, .jpeg files)</li> <li>Export tree to Pillow (can save to .png, .jpg)</li> <li>Export tree to Mermaid Flowchart (can display on .md)</li> </ul>"},{"location":"tree/#workflows","title":"\u2714\ufe0f Workflows","text":"<ul> <li>Sample workflows for tree demonstration!</li> </ul>"},{"location":"bigtree/binarytree/","title":"\ud83c\udf35 Binary Tree","text":""},{"location":"bigtree/binarytree/construct/","title":"\u2728 Construct","text":"<p>Construct Binary Tree from a list.</p>"},{"location":"bigtree/binarytree/construct/#binary-tree-construct-methods","title":"Binary Tree Construct Methods","text":"Construct Binary Tree from Using heapq structure Add node attributes List <code>list_to_binarytree</code> No"},{"location":"bigtree/binarytree/construct/#bigtree.binarytree.construct","title":"bigtree.binarytree.construct","text":""},{"location":"bigtree/binarytree/construct/#bigtree.binarytree.construct.list_to_binarytree","title":"list_to_binarytree","text":"<pre><code>list_to_binarytree(heapq_list, node_type=BinaryNode)\n</code></pre> <p>Construct tree from a list of numbers (int or float) in heapq format.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import list_to_binarytree, tree_to_dot\n&gt;&gt;&gt; nums_list = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]\n&gt;&gt;&gt; root = list_to_binarytree(nums_list)\n&gt;&gt;&gt; root.show()\n1\n\u251c\u2500\u2500 2\n\u2502   \u251c\u2500\u2500 4\n\u2502   \u2502   \u251c\u2500\u2500 8\n\u2502   \u2502   \u2514\u2500\u2500 9\n\u2502   \u2514\u2500\u2500 5\n\u2502       \u2514\u2500\u2500 10\n\u2514\u2500\u2500 3\n    \u251c\u2500\u2500 6\n    \u2514\u2500\u2500 7\n&gt;&gt;&gt; graph = tree_to_dot(root, node_colour=\"gold\")\n&gt;&gt;&gt; graph.write_png(\"assets/construct_binarytree.png\")\n</code></pre> <p></p> <p>Parameters:</p> Name Type Description Default <code>heapq_list</code> <code>List[int]</code> <p>list containing integer node names, ordered in heapq fashion</p> required <code>node_type</code> <code>Type[BinaryNode]</code> <p>node type of tree to be created, defaults to <code>BinaryNode</code></p> <code>BinaryNode</code> <p>Returns:</p> Type Description <code>BinaryNode</code> <p>(BinaryNode)</p>"},{"location":"bigtree/dag/","title":"\ud83c\udf34 Directed Acyclic Graph (DAG)","text":""},{"location":"bigtree/dag/construct/","title":"\u2728 Construct","text":"<p>Construct Directed Acyclic Graph (DAG) from list, dictionary, and pandas DataFrame.</p>"},{"location":"bigtree/dag/construct/#dag-construct-methods","title":"DAG Construct Methods","text":"Construct DAG from Using parent-child relation Add node attributes List <code>list_to_dag</code> No Dictionary <code>dict_to_dag</code> Yes DataFrame <code>dataframe_to_dag</code> Yes <p>These functions are not standalone functions. Under the hood, they have the following dependency,</p> <p></p>"},{"location":"bigtree/dag/construct/#bigtree.dag.construct","title":"bigtree.dag.construct","text":""},{"location":"bigtree/dag/construct/#bigtree.dag.construct.list_to_dag","title":"list_to_dag","text":"<pre><code>list_to_dag(relations, node_type=DAGNode)\n</code></pre> <p>Construct DAG from list of tuples containing parent-child names. Note that node names must be unique.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import list_to_dag, dag_iterator\n&gt;&gt;&gt; relations_list = [(\"a\", \"c\"), (\"a\", \"d\"), (\"b\", \"c\"), (\"c\", \"d\"), (\"d\", \"e\")]\n&gt;&gt;&gt; dag = list_to_dag(relations_list)\n&gt;&gt;&gt; [(parent.node_name, child.node_name) for parent, child in dag_iterator(dag)]\n[('a', 'd'), ('c', 'd'), ('d', 'e'), ('a', 'c'), ('b', 'c')]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>relations</code> <code>List[Tuple[str, str]]</code> <p>list containing tuple of parent-child names</p> required <code>node_type</code> <code>Type[DAGNode]</code> <p>node type of DAG to be created, defaults to <code>DAGNode</code></p> <code>DAGNode</code> <p>Returns:</p> Type Description <code>DAGNode</code> <p>(DAGNode)</p>"},{"location":"bigtree/dag/construct/#bigtree.dag.construct.dict_to_dag","title":"dict_to_dag","text":"<pre><code>dict_to_dag(\n    relation_attrs, parent_key=\"parents\", node_type=DAGNode\n)\n</code></pre> <p>Construct DAG from nested dictionary, <code>key</code>: child name, <code>value</code>: dictionary of parent names, attribute name, and attribute value. Note that node names must be unique.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import dict_to_dag, dag_iterator\n&gt;&gt;&gt; relation_dict = {\n...     \"a\": {\"step\": 1},\n...     \"b\": {\"step\": 1},\n...     \"c\": {\"parents\": [\"a\", \"b\"], \"step\": 2},\n...     \"d\": {\"parents\": [\"a\", \"c\"], \"step\": 2},\n...     \"e\": {\"parents\": [\"d\"], \"step\": 3},\n... }\n&gt;&gt;&gt; dag = dict_to_dag(relation_dict, parent_key=\"parents\")\n&gt;&gt;&gt; [(parent.node_name, child.node_name) for parent, child in dag_iterator(dag)]\n[('a', 'd'), ('c', 'd'), ('d', 'e'), ('a', 'c'), ('b', 'c')]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>relation_attrs</code> <code>Dict[str, Any]</code> <p>dictionary containing node, node parents, and node attribute information, key: child name, value: dictionary of parent names, node attribute, and attribute value</p> required <code>parent_key</code> <code>str</code> <p>key of dictionary to retrieve list of parents name, defaults to 'parent'</p> <code>'parents'</code> <code>node_type</code> <code>Type[DAGNode]</code> <p>node type of DAG to be created, defaults to <code>DAGNode</code></p> <code>DAGNode</code> <p>Returns:</p> Type Description <code>DAGNode</code> <p>(DAGNode)</p>"},{"location":"bigtree/dag/construct/#bigtree.dag.construct.dataframe_to_dag","title":"dataframe_to_dag","text":"<pre><code>dataframe_to_dag(\n    data,\n    child_col=\"\",\n    parent_col=\"\",\n    attribute_cols=[],\n    node_type=DAGNode,\n)\n</code></pre> <p>Construct DAG from pandas DataFrame. Note that node names must be unique.</p> <ul> <li><code>child_col</code> and <code>parent_col</code> specify columns for child name and parent name to construct DAG.</li> <li><code>attribute_cols</code> specify columns for node attribute for child name.</li> <li>If columns are not specified, <code>child_col</code> takes first column, <code>parent_col</code> takes second column, and all other     columns are <code>attribute_cols</code>.</li> </ul> <p>Only attributes in <code>attribute_cols</code> with non-null values will be added to the tree.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; import pandas as pd\n&gt;&gt;&gt; from bigtree import dataframe_to_dag, dag_iterator\n&gt;&gt;&gt; relation_data = pd.DataFrame([\n...     [\"a\", None, 1],\n...     [\"b\", None, 1],\n...     [\"c\", \"a\", 2],\n...     [\"c\", \"b\", 2],\n...     [\"d\", \"a\", 2],\n...     [\"d\", \"c\", 2],\n...     [\"e\", \"d\", 3],\n... ],\n...     columns=[\"child\", \"parent\", \"step\"]\n... )\n&gt;&gt;&gt; dag = dataframe_to_dag(relation_data)\n&gt;&gt;&gt; [(parent.node_name, child.node_name) for parent, child in dag_iterator(dag)]\n[('a', 'd'), ('c', 'd'), ('d', 'e'), ('a', 'c'), ('b', 'c')]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>data</code> <code>DataFrame</code> <p>data containing path and node attribute information</p> required <code>child_col</code> <code>str</code> <p>column of data containing child name information, defaults to '' if not set, it will take the first column of data</p> <code>''</code> <code>parent_col</code> <code>str</code> <p>column of data containing parent name information, defaults to '' if not set, it will take the second column of data</p> <code>''</code> <code>attribute_cols</code> <code>List[str]</code> <p>columns of data containing child node attribute information, if not set, it will take all columns of data except <code>child_col</code> and <code>parent_col</code></p> <code>[]</code> <code>node_type</code> <code>Type[DAGNode]</code> <p>node type of DAG to be created, defaults to <code>DAGNode</code></p> <code>DAGNode</code> <p>Returns:</p> Type Description <code>DAGNode</code> <p>(DAGNode)</p>"},{"location":"bigtree/dag/export/","title":"\ud83d\udd28 Export","text":"<p>Export Directed Acyclic Graph (DAG) to list, dictionary, and pandas DataFrame.</p>"},{"location":"bigtree/dag/export/#dag-export-methods","title":"DAG Export Methods","text":"Export DAG to Method Extract node attributes List <code>dag_to_list</code> No Dictionary <code>dag_to_dict</code> Yes with <code>attr_dict</code> or <code>all_attrs</code> DataFrame <code>dag_to_dataframe</code> Yes with <code>attr_dict</code> or <code>all_attrs</code> Dot (for .dot, .png, .svg, .jpeg, etc.) <code>dag_to_dot</code> No"},{"location":"bigtree/dag/export/#bigtree.dag.export","title":"bigtree.dag.export","text":""},{"location":"bigtree/dag/export/#bigtree.dag.export.dag_to_list","title":"dag_to_list","text":"<pre><code>dag_to_list(dag)\n</code></pre> <p>Export DAG to list of tuples containing parent-child names</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode, dag_to_list\n&gt;&gt;&gt; a = DAGNode(\"a\", step=1)\n&gt;&gt;&gt; b = DAGNode(\"b\", step=1)\n&gt;&gt;&gt; c = DAGNode(\"c\", step=2, parents=[a, b])\n&gt;&gt;&gt; d = DAGNode(\"d\", step=2, parents=[a, c])\n&gt;&gt;&gt; e = DAGNode(\"e\", step=3, parents=[d])\n&gt;&gt;&gt; dag_to_list(a)\n[('a', 'c'), ('a', 'd'), ('b', 'c'), ('c', 'd'), ('d', 'e')]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>dag</code> <code>DAGNode</code> <p>DAG to be exported</p> required <p>Returns:</p> Type Description <code>List[Tuple[str, str]]</code> <p>(List[Tuple[str, str]])</p>"},{"location":"bigtree/dag/export/#bigtree.dag.export.dag_to_dict","title":"dag_to_dict","text":"<pre><code>dag_to_dict(\n    dag, parent_key=\"parents\", attr_dict={}, all_attrs=False\n)\n</code></pre> <p>Export DAG to dictionary.</p> <p>Exported dictionary will have key as child name, and parent names and node attributes as a nested dictionary.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode, dag_to_dict\n&gt;&gt;&gt; a = DAGNode(\"a\", step=1)\n&gt;&gt;&gt; b = DAGNode(\"b\", step=1)\n&gt;&gt;&gt; c = DAGNode(\"c\", step=2, parents=[a, b])\n&gt;&gt;&gt; d = DAGNode(\"d\", step=2, parents=[a, c])\n&gt;&gt;&gt; e = DAGNode(\"e\", step=3, parents=[d])\n&gt;&gt;&gt; dag_to_dict(a, parent_key=\"parent\", attr_dict={\"step\": \"step no.\"})\n{'a': {'step no.': 1}, 'c': {'parent': ['a', 'b'], 'step no.': 2}, 'd': {'parent': ['a', 'c'], 'step no.': 2}, 'b': {'step no.': 1}, 'e': {'parent': ['d'], 'step no.': 3}}\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>dag</code> <code>DAGNode</code> <p>DAG to be exported</p> required <code>parent_key</code> <code>str</code> <p>dictionary key for <code>node.parent.node_name</code>, defaults to <code>parents</code></p> <code>'parents'</code> <code>attr_dict</code> <code>Dict[str, str]</code> <p>dictionary mapping node attributes to dictionary key, key: node attributes, value: corresponding dictionary key, optional</p> <code>{}</code> <code>all_attrs</code> <code>bool</code> <p>indicator whether to retrieve all <code>Node</code> attributes, defaults to False</p> <code>False</code> <p>Returns:</p> Type Description <code>Dict[str, Any]</code> <p>(Dict[str, Any])</p>"},{"location":"bigtree/dag/export/#bigtree.dag.export.dag_to_dataframe","title":"dag_to_dataframe","text":"<pre><code>dag_to_dataframe(\n    dag,\n    name_col=\"name\",\n    parent_col=\"parent\",\n    attr_dict={},\n    all_attrs=False,\n)\n</code></pre> <p>Export DAG to pandas DataFrame.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode, dag_to_dataframe\n&gt;&gt;&gt; a = DAGNode(\"a\", step=1)\n&gt;&gt;&gt; b = DAGNode(\"b\", step=1)\n&gt;&gt;&gt; c = DAGNode(\"c\", step=2, parents=[a, b])\n&gt;&gt;&gt; d = DAGNode(\"d\", step=2, parents=[a, c])\n&gt;&gt;&gt; e = DAGNode(\"e\", step=3, parents=[d])\n&gt;&gt;&gt; dag_to_dataframe(a, name_col=\"name\", parent_col=\"parent\", attr_dict={\"step\": \"step no.\"})\n  name parent  step no.\n0    a   None         1\n1    c      a         2\n2    d      a         2\n3    b   None         1\n4    c      b         2\n5    d      c         2\n6    e      d         3\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>dag</code> <code>DAGNode</code> <p>DAG to be exported</p> required <code>name_col</code> <code>str</code> <p>column name for <code>node.node_name</code>, defaults to 'name'</p> <code>'name'</code> <code>parent_col</code> <code>str</code> <p>column name for <code>node.parent.node_name</code>, defaults to 'parent'</p> <code>'parent'</code> <code>attr_dict</code> <code>Dict[str, str]</code> <p>dictionary mapping node attributes to column name, key: node attributes, value: corresponding column in dataframe, optional</p> <code>{}</code> <code>all_attrs</code> <code>bool</code> <p>indicator whether to retrieve all <code>Node</code> attributes, defaults to False</p> <code>False</code> <p>Returns:</p> Type Description <code>DataFrame</code> <p>(pd.DataFrame)</p>"},{"location":"bigtree/dag/export/#bigtree.dag.export.dag_to_dot","title":"dag_to_dot","text":"<pre><code>dag_to_dot(\n    dag,\n    rankdir=\"TB\",\n    bg_colour=\"\",\n    node_colour=\"\",\n    node_shape=\"\",\n    edge_colour=\"\",\n    node_attr=\"\",\n    edge_attr=\"\",\n)\n</code></pre> <p>Export DAG or list of DAGs to image. Note that node names must be unique. Possible node attributes include style, fillcolor, shape.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode, dag_to_dot\n&gt;&gt;&gt; a = DAGNode(\"a\", step=1)\n&gt;&gt;&gt; b = DAGNode(\"b\", step=1)\n&gt;&gt;&gt; c = DAGNode(\"c\", step=2, parents=[a, b])\n&gt;&gt;&gt; d = DAGNode(\"d\", step=2, parents=[a, c])\n&gt;&gt;&gt; e = DAGNode(\"e\", step=3, parents=[d])\n&gt;&gt;&gt; dag_graph = dag_to_dot(a)\n</code></pre> <p>Display image directly without saving (requires IPython)</p> <pre><code>&gt;&gt;&gt; from IPython.display import Image, display\n&gt;&gt;&gt; plt = Image(dag_graph.create_png())\n&gt;&gt;&gt; display(plt)\n&lt;IPython.core.display.Image object&gt;\n</code></pre> <p>Export to image, dot file, etc.</p> <pre><code>&gt;&gt;&gt; dag_graph.write_png(\"assets/docstr/tree_dag.png\")\n&gt;&gt;&gt; dag_graph.write_dot(\"assets/docstr/tree_dag.dot\")\n</code></pre> <p>Export to string</p> <pre><code>&gt;&gt;&gt; dag_graph.to_string()\n'strict digraph G {\\nrankdir=TB;\\nc [label=c];\\na [label=a];\\na -&gt; c;\\nd [label=d];\\na [label=a];\\na -&gt; d;\\nc [label=c];\\nb [label=b];\\nb -&gt; c;\\nd [label=d];\\nc [label=c];\\nc -&gt; d;\\ne [label=e];\\nd [label=d];\\nd -&gt; e;\\n}\\n'\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>dag</code> <code>Union[DAGNode, List[DAGNode]]</code> <p>DAG or list of DAGs to be exported</p> required <code>rankdir</code> <code>str</code> <p>set direction of graph layout, defaults to 'TB', can be 'BT, 'LR', 'RL'</p> <code>'TB'</code> <code>bg_colour</code> <code>str</code> <p>background color of image, defaults to ''</p> <code>''</code> <code>node_colour</code> <code>str</code> <p>fill colour of nodes, defaults to ''</p> <code>''</code> <code>node_shape</code> <code>str</code> <p>shape of nodes, defaults to None Possible node_shape include \"circle\", \"square\", \"diamond\", \"triangle\"</p> <code>''</code> <code>edge_colour</code> <code>str</code> <p>colour of edges, defaults to ''</p> <code>''</code> <code>node_attr</code> <code>str</code> <p>node attribute for style, overrides node_colour, defaults to '' Possible node attributes include {\"style\": \"filled\", \"fillcolor\": \"gold\"}</p> <code>''</code> <code>edge_attr</code> <code>str</code> <p>edge attribute for style, overrides edge_colour, defaults to '' Possible edge attributes include {\"style\": \"bold\", \"label\": \"edge label\", \"color\": \"black\"}</p> <code>''</code> <p>Returns:</p> Type Description <code>Dot</code> <p>(pydot.Dot)</p>"},{"location":"bigtree/node/","title":"\ud83c\udf3f Node","text":""},{"location":"bigtree/node/basenode/","title":"\ud83c\udf31 BaseNode","text":""},{"location":"bigtree/node/basenode/#bigtree.node.basenode","title":"bigtree.node.basenode","text":""},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode","title":"BaseNode","text":"<pre><code>BaseNode(parent=None, children=None, **kwargs)\n</code></pre> <p>BaseNode extends any Python class to a tree node. Nodes can have attributes if they are initialized from <code>Node</code>, dictionary, or pandas DataFrame.</p> <p>Nodes can be linked to each other with <code>parent</code> and <code>children</code> setter methods, or using bitshift operator with the convention <code>parent_node &gt;&gt; child_node</code> or <code>child_node &lt;&lt; parent_node</code>.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, print_tree\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65)\n&gt;&gt;&gt; c = Node(\"c\", age=60)\n&gt;&gt;&gt; d = Node(\"d\", age=40)\n&gt;&gt;&gt; root.children = [b, c]\n&gt;&gt;&gt; d.parent = b\n&gt;&gt;&gt; print_tree(root, attr_list=[\"age\"])\na [age=90]\n\u251c\u2500\u2500 b [age=65]\n\u2502   \u2514\u2500\u2500 d [age=40]\n\u2514\u2500\u2500 c [age=60]\n</code></pre> <pre><code>&gt;&gt;&gt; from bigtree import Node\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65)\n&gt;&gt;&gt; c = Node(\"c\", age=60)\n&gt;&gt;&gt; d = Node(\"d\", age=40)\n&gt;&gt;&gt; root &gt;&gt; b\n&gt;&gt;&gt; root &gt;&gt; c\n&gt;&gt;&gt; d &lt;&lt; b\n&gt;&gt;&gt; print_tree(root, attr_list=[\"age\"])\na [age=90]\n\u251c\u2500\u2500 b [age=65]\n\u2502   \u2514\u2500\u2500 d [age=40]\n\u2514\u2500\u2500 c [age=60]\n</code></pre> <p>Directly passing <code>parent</code> argument.</p> <pre><code>&gt;&gt;&gt; from bigtree import Node\n&gt;&gt;&gt; root = Node(\"a\")\n&gt;&gt;&gt; b = Node(\"b\", parent=root)\n&gt;&gt;&gt; c = Node(\"c\", parent=root)\n&gt;&gt;&gt; d = Node(\"d\", parent=b)\n</code></pre> <p>Directly passing <code>children</code> argument.</p> <pre><code>&gt;&gt;&gt; from bigtree import Node\n&gt;&gt;&gt; d = Node(\"d\")\n&gt;&gt;&gt; c = Node(\"c\")\n&gt;&gt;&gt; b = Node(\"b\", children=[d])\n&gt;&gt;&gt; a = Node(\"a\", children=[b, c])\n</code></pre> <p>BaseNode Creation</p> <p>Node can be created by instantiating a <code>BaseNode</code> class or by using a dictionary. If node is created with dictionary, all keys of dictionary will be stored as class attributes.</p> <pre><code>&gt;&gt;&gt; from bigtree import Node\n&gt;&gt;&gt; root = Node.from_dict({\"name\": \"a\", \"age\": 90})\n</code></pre> <p>BaseNode Attributes</p> <p>These are node attributes that have getter and/or setter methods.</p> <p>Get and set other <code>BaseNode</code></p> <ol> <li><code>parent</code>: Get/set parent node</li> <li><code>children</code>: Get/set child nodes</li> </ol> <p>Get other <code>BaseNode</code></p> <ol> <li><code>ancestors</code>: Get ancestors of node excluding self, iterator</li> <li><code>descendants</code>: Get descendants of node excluding self, iterator</li> <li><code>leaves</code>: Get all leaf node(s) from self, iterator</li> <li><code>siblings</code>: Get siblings of self</li> <li><code>left_sibling</code>: Get sibling left of self</li> <li><code>right_sibling</code>: Get sibling right of self</li> </ol> <p>Get <code>BaseNode</code> configuration</p> <ol> <li><code>node_path</code>: Get tuple of nodes from root</li> <li><code>is_root</code>: Get indicator if self is root node</li> <li><code>is_leaf</code>: Get indicator if self is leaf node</li> <li><code>root</code>: Get root node of tree</li> <li><code>diameter</code>: Get diameter of self</li> <li><code>depth</code>: Get depth of self</li> <li><code>max_depth</code>: Get maximum depth from root to leaf node</li> </ol> <p>BaseNode Methods</p> <p>These are methods available to be performed on <code>BaseNode</code>.</p> <p>Constructor methods</p> <ol> <li><code>from_dict()</code>: Create BaseNode from dictionary</li> </ol> <p><code>BaseNode</code> methods</p> <ol> <li><code>describe()</code>: Get node information sorted by attributes, return list of tuples</li> <li><code>get_attr(attr_name: str)</code>: Get value of node attribute</li> <li><code>set_attrs(attrs: dict)</code>: Set node attribute name(s) and value(s)</li> <li><code>go_to(node: Self)</code>: Get a path from own node to another node from same tree</li> <li><code>append(node: Self)</code>: Add child to node</li> <li><code>extend(nodes: List[Self])</code>: Add multiple children to node</li> <li><code>copy()</code>: Deep copy self</li> <li><code>sort()</code>: Sort child nodes</li> </ol>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.parent","title":"parent  <code>property</code> <code>writable</code>","text":"<pre><code>parent\n</code></pre> <p>Get parent node</p> <p>Returns:</p> Type Description <code>Optional[T]</code> <p>(Optional[Self])</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.parents","title":"parents  <code>property</code> <code>writable</code>","text":"<pre><code>parents\n</code></pre> <p>Do not allow <code>parents</code> attribute to be accessed</p> <p>Raises:</p> Type Description <code>AttributeError</code> <p>No such attribute</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.children","title":"children  <code>deletable</code> <code>property</code> <code>writable</code>","text":"<pre><code>children\n</code></pre> <p>Get child nodes</p> <p>Returns:</p> Type Description <code>Tuple[T, ...]</code> <p>(Tuple[Self, ...])</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.ancestors","title":"ancestors  <code>property</code>","text":"<pre><code>ancestors\n</code></pre> <p>Get iterator to yield all ancestors of self, does not include self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.descendants","title":"descendants  <code>property</code>","text":"<pre><code>descendants\n</code></pre> <p>Get iterator to yield all descendants of self, does not include self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.leaves","title":"leaves  <code>property</code>","text":"<pre><code>leaves\n</code></pre> <p>Get iterator to yield all leaf nodes from self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.siblings","title":"siblings  <code>property</code>","text":"<pre><code>siblings\n</code></pre> <p>Get siblings of self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.left_sibling","title":"left_sibling  <code>property</code>","text":"<pre><code>left_sibling\n</code></pre> <p>Get sibling left of self</p> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.right_sibling","title":"right_sibling  <code>property</code>","text":"<pre><code>right_sibling\n</code></pre> <p>Get sibling right of self</p> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.node_path","title":"node_path  <code>property</code>","text":"<pre><code>node_path\n</code></pre> <p>Get tuple of nodes starting from root</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.is_root","title":"is_root  <code>property</code>","text":"<pre><code>is_root\n</code></pre> <p>Get indicator if self is root node</p> <p>Returns:</p> Type Description <code>bool</code> <p>(bool)</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.is_leaf","title":"is_leaf  <code>property</code>","text":"<pre><code>is_leaf\n</code></pre> <p>Get indicator if self is leaf node</p> <p>Returns:</p> Type Description <code>bool</code> <p>(bool)</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.root","title":"root  <code>property</code>","text":"<pre><code>root\n</code></pre> <p>Get root node of tree</p> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.diameter","title":"diameter  <code>property</code>","text":"<pre><code>diameter\n</code></pre> <p>Get diameter of tree or subtree, the length of longest path between any two nodes</p> <p>Returns:</p> Type Description <code>int</code> <p>(int)</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.depth","title":"depth  <code>property</code>","text":"<pre><code>depth\n</code></pre> <p>Get depth of self, indexing starts from 1</p> <p>Returns:</p> Type Description <code>int</code> <p>(int)</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.max_depth","title":"max_depth  <code>property</code>","text":"<pre><code>max_depth\n</code></pre> <p>Get maximum depth from root to leaf node</p> <p>Returns:</p> Type Description <code>int</code> <p>(int)</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.from_dict","title":"from_dict  <code>classmethod</code>","text":"<pre><code>from_dict(input_dict)\n</code></pre> <p>Construct node from dictionary, all keys of dictionary will be stored as class attributes Input dictionary must have key <code>name</code> if not <code>Node</code> will not have any name</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node\n&gt;&gt;&gt; a = Node.from_dict({\"name\": \"a\", \"age\": 90})\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>input_dict</code> <code>Dict[str, Any]</code> <p>dictionary with node information, key: attribute name, value: attribute value</p> required <p>Returns:</p> Type Description <code>BaseNode</code> <p>(BaseNode)</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.describe","title":"describe","text":"<pre><code>describe(exclude_attributes=[], exclude_prefix='')\n</code></pre> <p>Get node information sorted by attribute name, returns list of tuples</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a', age=90)\n&gt;&gt;&gt; a.describe()\n[('_BaseNode__children', []), ('_BaseNode__parent', None), ('_sep', '/'), ('age', 90), ('name', 'a')]\n&gt;&gt;&gt; a.describe(exclude_prefix=\"_\")\n[('age', 90), ('name', 'a')]\n&gt;&gt;&gt; a.describe(exclude_prefix=\"_\", exclude_attributes=[\"name\"])\n[('age', 90)]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>exclude_attributes</code> <code>List[str]</code> <p>list of attributes to exclude</p> <code>[]</code> <code>exclude_prefix</code> <code>str</code> <p>prefix of attributes to exclude</p> <code>''</code> <p>Returns:</p> Type Description <code>List[Tuple[str, Any]]</code> <p>(List[Tuple[str, Any]])</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.get_attr","title":"get_attr","text":"<pre><code>get_attr(attr_name, default_value=None)\n</code></pre> <p>Get value of node attribute Returns default value if attribute name does not exist</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a', age=90)\n&gt;&gt;&gt; a.get_attr(\"age\")\n90\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>attr_name</code> <code>str</code> <p>attribute name</p> required <code>default_value</code> <code>Any</code> <p>default value if attribute does not exist, defaults to None</p> <code>None</code> <p>Returns:</p> Type Description <code>Any</code> <p>(Any)</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.set_attrs","title":"set_attrs","text":"<pre><code>set_attrs(attrs)\n</code></pre> <p>Set node attributes</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a')\n&gt;&gt;&gt; a.set_attrs({\"age\": 90})\n&gt;&gt;&gt; a\nNode(/a, age=90)\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>attrs</code> <code>Dict[str, Any]</code> <p>attribute dictionary, key: attribute name, value: attribute value</p> required"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.go_to","title":"go_to","text":"<pre><code>go_to(node)\n</code></pre> <p>Get path from current node to specified node from same tree</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, print_tree\n&gt;&gt;&gt; a = Node(name=\"a\")\n&gt;&gt;&gt; b = Node(name=\"b\", parent=a)\n&gt;&gt;&gt; c = Node(name=\"c\", parent=a)\n&gt;&gt;&gt; d = Node(name=\"d\", parent=b)\n&gt;&gt;&gt; e = Node(name=\"e\", parent=b)\n&gt;&gt;&gt; f = Node(name=\"f\", parent=c)\n&gt;&gt;&gt; g = Node(name=\"g\", parent=e)\n&gt;&gt;&gt; h = Node(name=\"h\", parent=e)\n&gt;&gt;&gt; print_tree(a)\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n&gt;&gt;&gt; d.go_to(d)\n[Node(/a/b/d, )]\n&gt;&gt;&gt; d.go_to(g)\n[Node(/a/b/d, ), Node(/a/b, ), Node(/a/b/e, ), Node(/a/b/e/g, )]\n&gt;&gt;&gt; d.go_to(f)\n[Node(/a/b/d, ), Node(/a/b, ), Node(/a, ), Node(/a/c, ), Node(/a/c/f, )]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>node</code> <code>Self</code> <p>node to travel to from current node, inclusive of start and end node</p> required <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.append","title":"append","text":"<pre><code>append(other)\n</code></pre> <p>Add other as child of self</p> <p>Parameters:</p> Name Type Description Default <code>other</code> <code>Self</code> <p>other node, child to be added</p> required"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.extend","title":"extend","text":"<pre><code>extend(others)\n</code></pre> <p>Add others as children of self</p> <p>Parameters:</p> Name Type Description Default <code>others</code> <code>Self</code> <p>other nodes, children to be added</p> required"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.copy","title":"copy","text":"<pre><code>copy()\n</code></pre> <p>Deep copy self; clone self</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a')\n&gt;&gt;&gt; a_copy = a.copy()\n</code></pre> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.sort","title":"sort","text":"<pre><code>sort(**kwargs)\n</code></pre> <p>Sort children, possible keyword arguments include <code>key=lambda node: node.name</code>, <code>reverse=True</code></p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, print_tree\n&gt;&gt;&gt; a = Node('a')\n&gt;&gt;&gt; c = Node(\"c\", parent=a)\n&gt;&gt;&gt; b = Node(\"b\", parent=a)\n&gt;&gt;&gt; print_tree(a)\na\n\u251c\u2500\u2500 c\n\u2514\u2500\u2500 b\n&gt;&gt;&gt; a.sort(key=lambda node: node.name)\n&gt;&gt;&gt; print_tree(a)\na\n\u251c\u2500\u2500 b\n\u2514\u2500\u2500 c\n</code></pre>"},{"location":"bigtree/node/binarynode/","title":"\ud83c\udf38 BinaryNode","text":""},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode","title":"bigtree.node.binarynode","text":""},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode","title":"BinaryNode","text":"<pre><code>BinaryNode(\n    name=\"\",\n    left=None,\n    right=None,\n    parent=None,\n    children=None,\n    **kwargs\n)\n</code></pre> <p>             Bases: <code>Node</code></p> <p>BinaryNode is an extension of Node, and is able to extend to any Python class for Binary Tree implementation. Nodes can have attributes if they are initialized from <code>BinaryNode</code>, dictionary, or pandas DataFrame.</p> <p>BinaryNode can be linked to each other with <code>children</code>, <code>left</code>, or <code>right</code> setter methods. If initialized with <code>children</code>, it must be length 2, denoting left and right child.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import BinaryNode, print_tree\n&gt;&gt;&gt; a = BinaryNode(1)\n&gt;&gt;&gt; b = BinaryNode(2)\n&gt;&gt;&gt; c = BinaryNode(3)\n&gt;&gt;&gt; d = BinaryNode(4)\n&gt;&gt;&gt; a.children = [b, c]\n&gt;&gt;&gt; b.right = d\n&gt;&gt;&gt; print_tree(a)\n1\n\u251c\u2500\u2500 2\n\u2502   \u2514\u2500\u2500 4\n\u2514\u2500\u2500 3\n</code></pre> <p>Directly passing <code>left</code>, <code>right</code>, or <code>children</code> argument.</p> <pre><code>&gt;&gt;&gt; from bigtree import BinaryNode\n&gt;&gt;&gt; d = BinaryNode(4)\n&gt;&gt;&gt; c = BinaryNode(3)\n&gt;&gt;&gt; b = BinaryNode(2, right=d)\n&gt;&gt;&gt; a = BinaryNode(1, children=[b, c])\n</code></pre> <p>BinaryNode Creation</p> <p>Node can be created by instantiating a <code>BinaryNode</code> class or by using a dictionary. If node is created with dictionary, all keys of dictionary will be stored as class attributes.</p> <pre><code>&gt;&gt;&gt; from bigtree import BinaryNode\n&gt;&gt;&gt; a = BinaryNode.from_dict({\"name\": \"1\"})\n&gt;&gt;&gt; a\nBinaryNode(name=1, val=1)\n</code></pre> <p>BinaryNode Attributes</p> <p>These are node attributes that have getter and/or setter methods.</p> <p>Get <code>BinaryNode</code> configuration</p> <ol> <li><code>left</code>: Get left children</li> <li><code>right</code>: Get right children</li> </ol>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.parents","title":"parents  <code>property</code> <code>writable</code>","text":"<pre><code>parents\n</code></pre> <p>Do not allow <code>parents</code> attribute to be accessed</p> <p>Raises:</p> Type Description <code>AttributeError</code> <p>No such attribute</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.ancestors","title":"ancestors  <code>property</code>","text":"<pre><code>ancestors\n</code></pre> <p>Get iterator to yield all ancestors of self, does not include self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.descendants","title":"descendants  <code>property</code>","text":"<pre><code>descendants\n</code></pre> <p>Get iterator to yield all descendants of self, does not include self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.leaves","title":"leaves  <code>property</code>","text":"<pre><code>leaves\n</code></pre> <p>Get iterator to yield all leaf nodes from self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.siblings","title":"siblings  <code>property</code>","text":"<pre><code>siblings\n</code></pre> <p>Get siblings of self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.left_sibling","title":"left_sibling  <code>property</code>","text":"<pre><code>left_sibling\n</code></pre> <p>Get sibling left of self</p> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.right_sibling","title":"right_sibling  <code>property</code>","text":"<pre><code>right_sibling\n</code></pre> <p>Get sibling right of self</p> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.node_path","title":"node_path  <code>property</code>","text":"<pre><code>node_path\n</code></pre> <p>Get tuple of nodes starting from root</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.is_root","title":"is_root  <code>property</code>","text":"<pre><code>is_root\n</code></pre> <p>Get indicator if self is root node</p> <p>Returns:</p> Type Description <code>bool</code> <p>(bool)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.root","title":"root  <code>property</code>","text":"<pre><code>root\n</code></pre> <p>Get root node of tree</p> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.diameter","title":"diameter  <code>property</code>","text":"<pre><code>diameter\n</code></pre> <p>Get diameter of tree or subtree, the length of longest path between any two nodes</p> <p>Returns:</p> Type Description <code>int</code> <p>(int)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.depth","title":"depth  <code>property</code>","text":"<pre><code>depth\n</code></pre> <p>Get depth of self, indexing starts from 1</p> <p>Returns:</p> Type Description <code>int</code> <p>(int)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.max_depth","title":"max_depth  <code>property</code>","text":"<pre><code>max_depth\n</code></pre> <p>Get maximum depth from root to leaf node</p> <p>Returns:</p> Type Description <code>int</code> <p>(int)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.sep","title":"sep  <code>property</code> <code>writable</code>","text":"<pre><code>sep\n</code></pre> <p>Get separator, gets from root node</p> <p>Returns:</p> Type Description <code>str</code> <p>(str)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.node_name","title":"node_name  <code>property</code>","text":"<pre><code>node_name\n</code></pre> <p>Get node name</p> <p>Returns:</p> Type Description <code>str</code> <p>(str)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.path_name","title":"path_name  <code>property</code>","text":"<pre><code>path_name\n</code></pre> <p>Get path name, separated by self.sep</p> <p>Returns:</p> Type Description <code>str</code> <p>(str)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.left","title":"left  <code>property</code> <code>writable</code>","text":"<pre><code>left\n</code></pre> <p>Get left children</p> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.right","title":"right  <code>property</code> <code>writable</code>","text":"<pre><code>right\n</code></pre> <p>Get right children</p> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.parent","title":"parent  <code>property</code> <code>writable</code>","text":"<pre><code>parent\n</code></pre> <p>Get parent node</p> <p>Returns:</p> Type Description <code>Optional[T]</code> <p>(Optional[Self])</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.children","title":"children  <code>deletable</code> <code>property</code> <code>writable</code>","text":"<pre><code>children\n</code></pre> <p>Get child nodes</p> <p>Returns:</p> Type Description <code>Tuple[T, ...]</code> <p>(Tuple[Optional[Self]])</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.is_leaf","title":"is_leaf  <code>property</code>","text":"<pre><code>is_leaf\n</code></pre> <p>Get indicator if self is leaf node</p> <p>Returns:</p> Type Description <code>bool</code> <p>(bool)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.from_dict","title":"from_dict  <code>classmethod</code>","text":"<pre><code>from_dict(input_dict)\n</code></pre> <p>Construct node from dictionary, all keys of dictionary will be stored as class attributes Input dictionary must have key <code>name</code> if not <code>Node</code> will not have any name</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node\n&gt;&gt;&gt; a = Node.from_dict({\"name\": \"a\", \"age\": 90})\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>input_dict</code> <code>Dict[str, Any]</code> <p>dictionary with node information, key: attribute name, value: attribute value</p> required <p>Returns:</p> Type Description <code>BaseNode</code> <p>(BaseNode)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.describe","title":"describe","text":"<pre><code>describe(exclude_attributes=[], exclude_prefix='')\n</code></pre> <p>Get node information sorted by attribute name, returns list of tuples</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a', age=90)\n&gt;&gt;&gt; a.describe()\n[('_BaseNode__children', []), ('_BaseNode__parent', None), ('_sep', '/'), ('age', 90), ('name', 'a')]\n&gt;&gt;&gt; a.describe(exclude_prefix=\"_\")\n[('age', 90), ('name', 'a')]\n&gt;&gt;&gt; a.describe(exclude_prefix=\"_\", exclude_attributes=[\"name\"])\n[('age', 90)]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>exclude_attributes</code> <code>List[str]</code> <p>list of attributes to exclude</p> <code>[]</code> <code>exclude_prefix</code> <code>str</code> <p>prefix of attributes to exclude</p> <code>''</code> <p>Returns:</p> Type Description <code>List[Tuple[str, Any]]</code> <p>(List[Tuple[str, Any]])</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.get_attr","title":"get_attr","text":"<pre><code>get_attr(attr_name, default_value=None)\n</code></pre> <p>Get value of node attribute Returns default value if attribute name does not exist</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a', age=90)\n&gt;&gt;&gt; a.get_attr(\"age\")\n90\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>attr_name</code> <code>str</code> <p>attribute name</p> required <code>default_value</code> <code>Any</code> <p>default value if attribute does not exist, defaults to None</p> <code>None</code> <p>Returns:</p> Type Description <code>Any</code> <p>(Any)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.set_attrs","title":"set_attrs","text":"<pre><code>set_attrs(attrs)\n</code></pre> <p>Set node attributes</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a')\n&gt;&gt;&gt; a.set_attrs({\"age\": 90})\n&gt;&gt;&gt; a\nNode(/a, age=90)\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>attrs</code> <code>Dict[str, Any]</code> <p>attribute dictionary, key: attribute name, value: attribute value</p> required"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.go_to","title":"go_to","text":"<pre><code>go_to(node)\n</code></pre> <p>Get path from current node to specified node from same tree</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, print_tree\n&gt;&gt;&gt; a = Node(name=\"a\")\n&gt;&gt;&gt; b = Node(name=\"b\", parent=a)\n&gt;&gt;&gt; c = Node(name=\"c\", parent=a)\n&gt;&gt;&gt; d = Node(name=\"d\", parent=b)\n&gt;&gt;&gt; e = Node(name=\"e\", parent=b)\n&gt;&gt;&gt; f = Node(name=\"f\", parent=c)\n&gt;&gt;&gt; g = Node(name=\"g\", parent=e)\n&gt;&gt;&gt; h = Node(name=\"h\", parent=e)\n&gt;&gt;&gt; print_tree(a)\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n&gt;&gt;&gt; d.go_to(d)\n[Node(/a/b/d, )]\n&gt;&gt;&gt; d.go_to(g)\n[Node(/a/b/d, ), Node(/a/b, ), Node(/a/b/e, ), Node(/a/b/e/g, )]\n&gt;&gt;&gt; d.go_to(f)\n[Node(/a/b/d, ), Node(/a/b, ), Node(/a, ), Node(/a/c, ), Node(/a/c/f, )]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>node</code> <code>Self</code> <p>node to travel to from current node, inclusive of start and end node</p> required <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.append","title":"append","text":"<pre><code>append(other)\n</code></pre> <p>Add other as child of self</p> <p>Parameters:</p> Name Type Description Default <code>other</code> <code>Self</code> <p>other node, child to be added</p> required"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.extend","title":"extend","text":"<pre><code>extend(others)\n</code></pre> <p>Add others as children of self</p> <p>Parameters:</p> Name Type Description Default <code>others</code> <code>Self</code> <p>other nodes, children to be added</p> required"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.copy","title":"copy","text":"<pre><code>copy()\n</code></pre> <p>Deep copy self; clone self</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a')\n&gt;&gt;&gt; a_copy = a.copy()\n</code></pre> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.show","title":"show","text":"<pre><code>show(**kwargs)\n</code></pre> <p>Print tree to console, takes in same keyword arguments as <code>print_tree</code> function</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.hshow","title":"hshow","text":"<pre><code>hshow(**kwargs)\n</code></pre> <p>Print tree in horizontal orientation to console, takes in same keyword arguments as <code>hprint_tree</code> function</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.sort","title":"sort","text":"<pre><code>sort(**kwargs)\n</code></pre> <p>Sort children, possible keyword arguments include <code>key=lambda node: node.val</code>, <code>reverse=True</code></p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import BinaryNode, print_tree\n&gt;&gt;&gt; a = BinaryNode(1)\n&gt;&gt;&gt; c = BinaryNode(3, parent=a)\n&gt;&gt;&gt; b = BinaryNode(2, parent=a)\n&gt;&gt;&gt; print_tree(a)\n1\n\u251c\u2500\u2500 3\n\u2514\u2500\u2500 2\n&gt;&gt;&gt; a.sort(key=lambda node: node.val)\n&gt;&gt;&gt; print_tree(a)\n1\n\u251c\u2500\u2500 2\n\u2514\u2500\u2500 3\n</code></pre>"},{"location":"bigtree/node/dagnode/","title":"\ud83c\udf3c DAGNode","text":""},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode","title":"bigtree.node.dagnode","text":""},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode","title":"DAGNode","text":"<pre><code>DAGNode(name='', parents=None, children=None, **kwargs)\n</code></pre> <p>Base DAGNode extends any Python class to a DAG node, for DAG implementation. In DAG implementation, a node can have multiple parents.</p> <p>Parents and children cannot be reassigned once assigned, as Nodes are allowed to have multiple parents and children. If each node only has one parent, use <code>Node</code> class. DAGNodes can have attributes if they are initialized from <code>DAGNode</code> or dictionary.</p> <p>DAGNode can be linked to each other with <code>parents</code> and <code>children</code> setter methods, or using bitshift operator with the convention <code>parent_node &gt;&gt; child_node</code> or <code>child_node &lt;&lt; parent_node</code>.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode\n&gt;&gt;&gt; a = DAGNode(\"a\")\n&gt;&gt;&gt; b = DAGNode(\"b\")\n&gt;&gt;&gt; c = DAGNode(\"c\")\n&gt;&gt;&gt; d = DAGNode(\"d\")\n&gt;&gt;&gt; c.parents = [a, b]\n&gt;&gt;&gt; c.children = [d]\n</code></pre> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode\n&gt;&gt;&gt; a = DAGNode(\"a\")\n&gt;&gt;&gt; b = DAGNode(\"b\")\n&gt;&gt;&gt; c = DAGNode(\"c\")\n&gt;&gt;&gt; d = DAGNode(\"d\")\n&gt;&gt;&gt; a &gt;&gt; c\n&gt;&gt;&gt; b &gt;&gt; c\n&gt;&gt;&gt; d &lt;&lt; c\n</code></pre> <p>Directly passing <code>parents</code> argument.</p> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode\n&gt;&gt;&gt; a = DAGNode(\"a\")\n&gt;&gt;&gt; b = DAGNode(\"b\")\n&gt;&gt;&gt; c = DAGNode(\"c\", parents=[a, b])\n&gt;&gt;&gt; d = DAGNode(\"d\", parents=[c])\n</code></pre> <p>Directly passing <code>children</code> argument.</p> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode\n&gt;&gt;&gt; d = DAGNode(\"d\")\n&gt;&gt;&gt; c = DAGNode(\"c\", children=[d])\n&gt;&gt;&gt; b = DAGNode(\"b\", children=[c])\n&gt;&gt;&gt; a = DAGNode(\"a\", children=[c])\n</code></pre> <p>DAGNode Creation</p> <p>Node can be created by instantiating a <code>DAGNode</code> class or by using a dictionary. If node is created with dictionary, all keys of dictionary will be stored as class attributes.</p> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode\n&gt;&gt;&gt; a = DAGNode.from_dict({\"name\": \"a\", \"age\": 90})\n</code></pre> <p>DAGNode Attributes</p> <p>These are node attributes that have getter and/or setter methods.</p> <p>Get and set other <code>DAGNode</code></p> <ol> <li><code>parents</code>: Get/set parent nodes</li> <li><code>children</code>: Get/set child nodes</li> </ol> <p>Get other <code>DAGNode</code></p> <ol> <li><code>ancestors</code>: Get ancestors of node excluding self, iterator</li> <li><code>descendants</code>: Get descendants of node excluding self, iterator</li> <li><code>siblings</code>: Get siblings of self</li> </ol> <p>Get <code>DAGNode</code> configuration</p> <ol> <li><code>node_name</code>: Get node name, without accessing <code>name</code> directly</li> <li><code>is_root</code>: Get indicator if self is root node</li> <li><code>is_leaf</code>: Get indicator if self is leaf node</li> </ol> <p>DAGNode Methods</p> <p>These are methods available to be performed on <code>DAGNode</code>.</p> <p>Constructor methods</p> <ol> <li><code>from_dict()</code>: Create DAGNode from dictionary</li> </ol> <p><code>DAGNode</code> methods</p> <ol> <li><code>describe()</code>: Get node information sorted by attributes, return list of tuples</li> <li><code>get_attr(attr_name: str)</code>: Get value of node attribute</li> <li><code>set_attrs(attrs: dict)</code>: Set node attribute name(s) and value(s)</li> <li><code>go_to(node: Self)</code>: Get a path from own node to another node from same DAG</li> <li><code>copy()</code>: Deep copy self</li> </ol>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.parent","title":"parent  <code>property</code> <code>writable</code>","text":"<pre><code>parent\n</code></pre> <p>Do not allow <code>parent</code> attribute to be accessed</p> <p>Raises:</p> Type Description <code>AttributeError</code> <p>No such attribute</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.parents","title":"parents  <code>property</code> <code>writable</code>","text":"<pre><code>parents\n</code></pre> <p>Get parent nodes</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.children","title":"children  <code>deletable</code> <code>property</code> <code>writable</code>","text":"<pre><code>children\n</code></pre> <p>Get child nodes</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.ancestors","title":"ancestors  <code>property</code>","text":"<pre><code>ancestors\n</code></pre> <p>Get iterator to yield all ancestors of self, does not include self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.descendants","title":"descendants  <code>property</code>","text":"<pre><code>descendants\n</code></pre> <p>Get iterator to yield all descendants of self, does not include self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.siblings","title":"siblings  <code>property</code>","text":"<pre><code>siblings\n</code></pre> <p>Get siblings of self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.node_name","title":"node_name  <code>property</code>","text":"<pre><code>node_name\n</code></pre> <p>Get node name</p> <p>Returns:</p> Type Description <code>str</code> <p>(str)</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.is_root","title":"is_root  <code>property</code>","text":"<pre><code>is_root\n</code></pre> <p>Get indicator if self is root node</p> <p>Returns:</p> Type Description <code>bool</code> <p>(bool)</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.is_leaf","title":"is_leaf  <code>property</code>","text":"<pre><code>is_leaf\n</code></pre> <p>Get indicator if self is leaf node</p> <p>Returns:</p> Type Description <code>bool</code> <p>(bool)</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.from_dict","title":"from_dict  <code>classmethod</code>","text":"<pre><code>from_dict(input_dict)\n</code></pre> <p>Construct node from dictionary, all keys of dictionary will be stored as class attributes Input dictionary must have key <code>name</code> if not <code>Node</code> will not have any name</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode\n&gt;&gt;&gt; a = DAGNode.from_dict({\"name\": \"a\", \"age\": 90})\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>input_dict</code> <code>Dict[str, Any]</code> <p>dictionary with node information, key: attribute name, value: attribute value</p> required <p>Returns:</p> Type Description <code>DAGNode</code> <p>(DAGNode)</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.describe","title":"describe","text":"<pre><code>describe(exclude_attributes=[], exclude_prefix='')\n</code></pre> <p>Get node information sorted by attribute name, returns list of tuples</p> <p>Parameters:</p> Name Type Description Default <code>exclude_attributes</code> <code>List[str]</code> <p>list of attributes to exclude</p> <code>[]</code> <code>exclude_prefix</code> <code>str</code> <p>prefix of attributes to exclude</p> <code>''</code> <p>Returns:</p> Type Description <code>List[Tuple[str, Any]]</code> <p>(List[Tuple[str, Any]])</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.get_attr","title":"get_attr","text":"<pre><code>get_attr(attr_name, default_value=None)\n</code></pre> <p>Get value of node attribute Returns default value if attribute name does not exist</p> <p>Parameters:</p> Name Type Description Default <code>attr_name</code> <code>str</code> <p>attribute name</p> required <code>default_value</code> <code>Any</code> <p>default value if attribute does not exist, defaults to None</p> <code>None</code> <p>Returns:</p> Type Description <code>Any</code> <p>(Any)</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.set_attrs","title":"set_attrs","text":"<pre><code>set_attrs(attrs)\n</code></pre> <p>Set node attributes</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.dagnode import DAGNode\n&gt;&gt;&gt; a = DAGNode('a')\n&gt;&gt;&gt; a.set_attrs({\"age\": 90})\n&gt;&gt;&gt; a\nDAGNode(a, age=90)\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>attrs</code> <code>Dict[str, Any]</code> <p>attribute dictionary, key: attribute name, value: attribute value</p> required"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.go_to","title":"go_to","text":"<pre><code>go_to(node)\n</code></pre> <p>Get list of possible paths from current node to specified node from same tree</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode\n&gt;&gt;&gt; a = DAGNode(\"a\")\n&gt;&gt;&gt; b = DAGNode(\"b\")\n&gt;&gt;&gt; c = DAGNode(\"c\")\n&gt;&gt;&gt; d = DAGNode(\"d\")\n&gt;&gt;&gt; a &gt;&gt; c\n&gt;&gt;&gt; b &gt;&gt; c\n&gt;&gt;&gt; c &gt;&gt; d\n&gt;&gt;&gt; a &gt;&gt; d\n&gt;&gt;&gt; a.go_to(c)\n[[DAGNode(a, ), DAGNode(c, )]]\n&gt;&gt;&gt; a.go_to(d)\n[[DAGNode(a, ), DAGNode(c, ), DAGNode(d, )], [DAGNode(a, ), DAGNode(d, )]]\n&gt;&gt;&gt; a.go_to(b)\nTraceback (most recent call last):\n    ...\nbigtree.utils.exceptions.TreeError: It is not possible to go to DAGNode(b, )\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>node</code> <code>Self</code> <p>node to travel to from current node, inclusive of start and end node</p> required <p>Returns:</p> Type Description <code>List[List[T]]</code> <p>(List[List[Self]])</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.copy","title":"copy","text":"<pre><code>copy()\n</code></pre> <p>Deep copy self; clone DAGNode</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.dagnode import DAGNode\n&gt;&gt;&gt; a = DAGNode('a')\n&gt;&gt;&gt; a_copy = a.copy()\n</code></pre> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/node/","title":"\ud83c\udf3a Node","text":""},{"location":"bigtree/node/node/#bigtree.node.node","title":"bigtree.node.node","text":""},{"location":"bigtree/node/node/#bigtree.node.node.Node","title":"Node","text":"<pre><code>Node(name='', sep='/', **kwargs)\n</code></pre> <p>             Bases: <code>BaseNode</code></p> <p>Node is an extension of BaseNode, and is able to extend to any Python class. Nodes can have attributes if they are initialized from <code>Node</code>, dictionary, or pandas DataFrame.</p> <p>Nodes can be linked to each other with <code>parent</code> and <code>children</code> setter methods.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node\n&gt;&gt;&gt; a = Node(\"a\")\n&gt;&gt;&gt; b = Node(\"b\")\n&gt;&gt;&gt; c = Node(\"c\")\n&gt;&gt;&gt; d = Node(\"d\")\n&gt;&gt;&gt; b.parent = a\n&gt;&gt;&gt; b.children = [c, d]\n</code></pre> <p>Directly passing <code>parent</code> argument.</p> <pre><code>&gt;&gt;&gt; from bigtree import Node\n&gt;&gt;&gt; a = Node(\"a\")\n&gt;&gt;&gt; b = Node(\"b\", parent=a)\n&gt;&gt;&gt; c = Node(\"c\", parent=b)\n&gt;&gt;&gt; d = Node(\"d\", parent=b)\n</code></pre> <p>Directly passing <code>children</code> argument.</p> <pre><code>&gt;&gt;&gt; from bigtree import Node\n&gt;&gt;&gt; d = Node(\"d\")\n&gt;&gt;&gt; c = Node(\"c\")\n&gt;&gt;&gt; b = Node(\"b\", children=[c, d])\n&gt;&gt;&gt; a = Node(\"a\", children=[b])\n</code></pre> <p>Node Creation</p> <p>Node can be created by instantiating a <code>Node</code> class or by using a dictionary. If node is created with dictionary, all keys of dictionary will be stored as class attributes.</p> <pre><code>&gt;&gt;&gt; from bigtree import Node\n&gt;&gt;&gt; a = Node.from_dict({\"name\": \"a\", \"age\": 90})\n</code></pre> <p>Node Attributes</p> <p>These are node attributes that have getter and/or setter methods.</p> <p>Get and set <code>Node</code> configuration</p> <ol> <li><code>sep</code>: Get/set separator for path name</li> </ol> <p>Get <code>Node</code> configuration</p> <ol> <li><code>node_name</code>: Get node name, without accessing <code>name</code> directly</li> <li><code>path_name</code>: Get path name from root, separated by <code>sep</code></li> </ol> <p>Node Methods</p> <p>These are methods available to be performed on <code>Node</code>.</p> <p><code>Node</code> methods</p> <ol> <li><code>show()</code>: Print tree to console</li> <li><code>hshow()</code>: Print tree in horizontal orientation to console</li> </ol>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.parent","title":"parent  <code>property</code> <code>writable</code>","text":"<pre><code>parent\n</code></pre> <p>Get parent node</p> <p>Returns:</p> Type Description <code>Optional[T]</code> <p>(Optional[Self])</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.children","title":"children  <code>deletable</code> <code>property</code> <code>writable</code>","text":"<pre><code>children\n</code></pre> <p>Get child nodes</p> <p>Returns:</p> Type Description <code>Tuple[T, ...]</code> <p>(Tuple[Self, ...])</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.parents","title":"parents  <code>property</code> <code>writable</code>","text":"<pre><code>parents\n</code></pre> <p>Do not allow <code>parents</code> attribute to be accessed</p> <p>Raises:</p> Type Description <code>AttributeError</code> <p>No such attribute</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.ancestors","title":"ancestors  <code>property</code>","text":"<pre><code>ancestors\n</code></pre> <p>Get iterator to yield all ancestors of self, does not include self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.descendants","title":"descendants  <code>property</code>","text":"<pre><code>descendants\n</code></pre> <p>Get iterator to yield all descendants of self, does not include self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.leaves","title":"leaves  <code>property</code>","text":"<pre><code>leaves\n</code></pre> <p>Get iterator to yield all leaf nodes from self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.siblings","title":"siblings  <code>property</code>","text":"<pre><code>siblings\n</code></pre> <p>Get siblings of self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.left_sibling","title":"left_sibling  <code>property</code>","text":"<pre><code>left_sibling\n</code></pre> <p>Get sibling left of self</p> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.right_sibling","title":"right_sibling  <code>property</code>","text":"<pre><code>right_sibling\n</code></pre> <p>Get sibling right of self</p> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.node_path","title":"node_path  <code>property</code>","text":"<pre><code>node_path\n</code></pre> <p>Get tuple of nodes starting from root</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.is_root","title":"is_root  <code>property</code>","text":"<pre><code>is_root\n</code></pre> <p>Get indicator if self is root node</p> <p>Returns:</p> Type Description <code>bool</code> <p>(bool)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.is_leaf","title":"is_leaf  <code>property</code>","text":"<pre><code>is_leaf\n</code></pre> <p>Get indicator if self is leaf node</p> <p>Returns:</p> Type Description <code>bool</code> <p>(bool)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.root","title":"root  <code>property</code>","text":"<pre><code>root\n</code></pre> <p>Get root node of tree</p> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.diameter","title":"diameter  <code>property</code>","text":"<pre><code>diameter\n</code></pre> <p>Get diameter of tree or subtree, the length of longest path between any two nodes</p> <p>Returns:</p> Type Description <code>int</code> <p>(int)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.depth","title":"depth  <code>property</code>","text":"<pre><code>depth\n</code></pre> <p>Get depth of self, indexing starts from 1</p> <p>Returns:</p> Type Description <code>int</code> <p>(int)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.max_depth","title":"max_depth  <code>property</code>","text":"<pre><code>max_depth\n</code></pre> <p>Get maximum depth from root to leaf node</p> <p>Returns:</p> Type Description <code>int</code> <p>(int)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.sep","title":"sep  <code>property</code> <code>writable</code>","text":"<pre><code>sep\n</code></pre> <p>Get separator, gets from root node</p> <p>Returns:</p> Type Description <code>str</code> <p>(str)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.node_name","title":"node_name  <code>property</code>","text":"<pre><code>node_name\n</code></pre> <p>Get node name</p> <p>Returns:</p> Type Description <code>str</code> <p>(str)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.path_name","title":"path_name  <code>property</code>","text":"<pre><code>path_name\n</code></pre> <p>Get path name, separated by self.sep</p> <p>Returns:</p> Type Description <code>str</code> <p>(str)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.from_dict","title":"from_dict  <code>classmethod</code>","text":"<pre><code>from_dict(input_dict)\n</code></pre> <p>Construct node from dictionary, all keys of dictionary will be stored as class attributes Input dictionary must have key <code>name</code> if not <code>Node</code> will not have any name</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node\n&gt;&gt;&gt; a = Node.from_dict({\"name\": \"a\", \"age\": 90})\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>input_dict</code> <code>Dict[str, Any]</code> <p>dictionary with node information, key: attribute name, value: attribute value</p> required <p>Returns:</p> Type Description <code>BaseNode</code> <p>(BaseNode)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.describe","title":"describe","text":"<pre><code>describe(exclude_attributes=[], exclude_prefix='')\n</code></pre> <p>Get node information sorted by attribute name, returns list of tuples</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a', age=90)\n&gt;&gt;&gt; a.describe()\n[('_BaseNode__children', []), ('_BaseNode__parent', None), ('_sep', '/'), ('age', 90), ('name', 'a')]\n&gt;&gt;&gt; a.describe(exclude_prefix=\"_\")\n[('age', 90), ('name', 'a')]\n&gt;&gt;&gt; a.describe(exclude_prefix=\"_\", exclude_attributes=[\"name\"])\n[('age', 90)]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>exclude_attributes</code> <code>List[str]</code> <p>list of attributes to exclude</p> <code>[]</code> <code>exclude_prefix</code> <code>str</code> <p>prefix of attributes to exclude</p> <code>''</code> <p>Returns:</p> Type Description <code>List[Tuple[str, Any]]</code> <p>(List[Tuple[str, Any]])</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.get_attr","title":"get_attr","text":"<pre><code>get_attr(attr_name, default_value=None)\n</code></pre> <p>Get value of node attribute Returns default value if attribute name does not exist</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a', age=90)\n&gt;&gt;&gt; a.get_attr(\"age\")\n90\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>attr_name</code> <code>str</code> <p>attribute name</p> required <code>default_value</code> <code>Any</code> <p>default value if attribute does not exist, defaults to None</p> <code>None</code> <p>Returns:</p> Type Description <code>Any</code> <p>(Any)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.set_attrs","title":"set_attrs","text":"<pre><code>set_attrs(attrs)\n</code></pre> <p>Set node attributes</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a')\n&gt;&gt;&gt; a.set_attrs({\"age\": 90})\n&gt;&gt;&gt; a\nNode(/a, age=90)\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>attrs</code> <code>Dict[str, Any]</code> <p>attribute dictionary, key: attribute name, value: attribute value</p> required"},{"location":"bigtree/node/node/#bigtree.node.node.Node.go_to","title":"go_to","text":"<pre><code>go_to(node)\n</code></pre> <p>Get path from current node to specified node from same tree</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, print_tree\n&gt;&gt;&gt; a = Node(name=\"a\")\n&gt;&gt;&gt; b = Node(name=\"b\", parent=a)\n&gt;&gt;&gt; c = Node(name=\"c\", parent=a)\n&gt;&gt;&gt; d = Node(name=\"d\", parent=b)\n&gt;&gt;&gt; e = Node(name=\"e\", parent=b)\n&gt;&gt;&gt; f = Node(name=\"f\", parent=c)\n&gt;&gt;&gt; g = Node(name=\"g\", parent=e)\n&gt;&gt;&gt; h = Node(name=\"h\", parent=e)\n&gt;&gt;&gt; print_tree(a)\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n&gt;&gt;&gt; d.go_to(d)\n[Node(/a/b/d, )]\n&gt;&gt;&gt; d.go_to(g)\n[Node(/a/b/d, ), Node(/a/b, ), Node(/a/b/e, ), Node(/a/b/e/g, )]\n&gt;&gt;&gt; d.go_to(f)\n[Node(/a/b/d, ), Node(/a/b, ), Node(/a, ), Node(/a/c, ), Node(/a/c/f, )]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>node</code> <code>Self</code> <p>node to travel to from current node, inclusive of start and end node</p> required <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.append","title":"append","text":"<pre><code>append(other)\n</code></pre> <p>Add other as child of self</p> <p>Parameters:</p> Name Type Description Default <code>other</code> <code>Self</code> <p>other node, child to be added</p> required"},{"location":"bigtree/node/node/#bigtree.node.node.Node.extend","title":"extend","text":"<pre><code>extend(others)\n</code></pre> <p>Add others as children of self</p> <p>Parameters:</p> Name Type Description Default <code>others</code> <code>Self</code> <p>other nodes, children to be added</p> required"},{"location":"bigtree/node/node/#bigtree.node.node.Node.copy","title":"copy","text":"<pre><code>copy()\n</code></pre> <p>Deep copy self; clone self</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a')\n&gt;&gt;&gt; a_copy = a.copy()\n</code></pre> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.sort","title":"sort","text":"<pre><code>sort(**kwargs)\n</code></pre> <p>Sort children, possible keyword arguments include <code>key=lambda node: node.name</code>, <code>reverse=True</code></p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, print_tree\n&gt;&gt;&gt; a = Node('a')\n&gt;&gt;&gt; c = Node(\"c\", parent=a)\n&gt;&gt;&gt; b = Node(\"b\", parent=a)\n&gt;&gt;&gt; print_tree(a)\na\n\u251c\u2500\u2500 c\n\u2514\u2500\u2500 b\n&gt;&gt;&gt; a.sort(key=lambda node: node.name)\n&gt;&gt;&gt; print_tree(a)\na\n\u251c\u2500\u2500 b\n\u2514\u2500\u2500 c\n</code></pre>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.show","title":"show","text":"<pre><code>show(**kwargs)\n</code></pre> <p>Print tree to console, takes in same keyword arguments as <code>print_tree</code> function</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.hshow","title":"hshow","text":"<pre><code>hshow(**kwargs)\n</code></pre> <p>Print tree in horizontal orientation to console, takes in same keyword arguments as <code>hprint_tree</code> function</p>"},{"location":"bigtree/tree/","title":"\ud83c\udf32 Tree","text":""},{"location":"bigtree/tree/construct/","title":"\u2728 Construct","text":""},{"location":"bigtree/tree/construct/#tree-construct-methods","title":"Tree Construct Methods","text":"<p>Construct Tree from list, dictionary, and pandas DataFrame.</p> <p>To decide which method to use, consider your data type and data values.</p> Construct tree from Using full path Using parent-child relation Using notation Add node attributes String <code>str_to_tree</code> NA <code>newick_to_tree</code> No (for <code>str_to_tree</code>)Yes (for  <code>newick_to_tree</code>) List <code>list_to_tree</code> <code>list_to_tree_by_relation</code> NA No Dictionary <code>dict_to_tree</code> <code>nested_dict_to_tree</code> NA Yes DataFrame <code>dataframe_to_tree</code> <code>dataframe_to_tree_by_relation</code> NA Yes"},{"location":"bigtree/tree/construct/#tree-add-attributes-methods","title":"Tree Add Attributes Methods","text":"<p>To add attributes to an existing tree,</p> Add attributes from Using full path Using node name String <code>add_path_to_tree</code> NA Dictionary <code>add_dict_to_tree_by_path</code> <code>add_dict_to_tree_by_name</code> DataFrame <code>add_dataframe_to_tree_by_path</code> <code>add_dataframe_to_tree_by_name</code> <p>Note</p> <p>If attributes are added to existing tree using full path, paths that previously did not exist will be added. If attributes are added to existing tree using node name, names that previously did not exist will not be created.</p> <p>These functions are not standalone functions. Under the hood, they have the following dependency,</p> <p></p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct","title":"bigtree.tree.construct","text":""},{"location":"bigtree/tree/construct/#bigtree.tree.construct.add_path_to_tree","title":"add_path_to_tree","text":"<pre><code>add_path_to_tree(\n    tree,\n    path,\n    sep=\"/\",\n    duplicate_name_allowed=True,\n    node_attrs={},\n)\n</code></pre> <p>Add nodes and attributes to existing tree in-place, return node of path added. Adds to existing tree from list of path strings.</p> <p>Path should contain <code>Node</code> name, separated by <code>sep</code>.</p> <ul> <li>For example: Path string \"a/b\" refers to Node(\"b\") with parent Node(\"a\").</li> <li>Path separator <code>sep</code> is for the input <code>path</code> and can differ from existing tree.</li> </ul> <p>Path can start from root node <code>name</code>, or start with <code>sep</code>.</p> <ul> <li>For example: Path string can be \"/a/b\" or \"a/b\", if sep is \"/\".</li> </ul> <p>All paths should start from the same root node.</p> <ul> <li>For example: Path strings should be \"a/b\", \"a/c\", \"a/b/d\" etc., and should not start with another root node.</li> </ul> <p>All attributes in <code>node_attrs</code> will be added to the tree, including attributes with null values.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import add_path_to_tree, Node\n&gt;&gt;&gt; root = Node(\"a\")\n&gt;&gt;&gt; add_path_to_tree(root, \"a/b/c\")\nNode(/a/b/c, )\n&gt;&gt;&gt; root.show()\na\n\u2514\u2500\u2500 b\n    \u2514\u2500\u2500 c\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>existing tree</p> required <code>path</code> <code>str</code> <p>path to be added to tree</p> required <code>sep</code> <code>str</code> <p>path separator for input <code>path</code></p> <code>'/'</code> <code>duplicate_name_allowed</code> <code>bool</code> <p>indicator if nodes with duplicate <code>Node</code> name is allowed, defaults to True</p> <code>True</code> <code>node_attrs</code> <code>Dict[str, Any]</code> <p>attributes to add to node, key: attribute name, value: attribute value, optional</p> <code>{}</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.add_dict_to_tree_by_path","title":"add_dict_to_tree_by_path","text":"<pre><code>add_dict_to_tree_by_path(\n    tree, path_attrs, sep=\"/\", duplicate_name_allowed=True\n)\n</code></pre> <p>Add nodes and attributes to tree in-place, return root of tree. Adds to existing tree from nested dictionary, <code>key</code>: path, <code>value</code>: dict of attribute name and attribute value.</p> <p>All attributes in <code>path_attrs</code> will be added to the tree, including attributes with null values.</p> <p>Path should contain <code>Node</code> name, separated by <code>sep</code>.</p> <ul> <li>For example: Path string \"a/b\" refers to Node(\"b\") with parent Node(\"a\").</li> <li>Path separator <code>sep</code> is for the input <code>path</code> and can differ from existing tree.</li> </ul> <p>Path can start from root node <code>name</code>, or start with <code>sep</code>.</p> <ul> <li>For example: Path string can be \"/a/b\" or \"a/b\", if sep is \"/\".</li> </ul> <p>All paths should start from the same root node.</p> <ul> <li>For example: Path strings should be \"a/b\", \"a/c\", \"a/b/d\" etc. and should not start with another root node.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, add_dict_to_tree_by_path\n&gt;&gt;&gt; root = Node(\"a\")\n&gt;&gt;&gt; path_dict = {\n...     \"a\": {\"age\": 90},\n...     \"a/b\": {\"age\": 65},\n...     \"a/c\": {\"age\": 60},\n...     \"a/b/d\": {\"age\": 40},\n...     \"a/b/e\": {\"age\": 35},\n...     \"a/c/f\": {\"age\": 38},\n...     \"a/b/e/g\": {\"age\": 10},\n...     \"a/b/e/h\": {\"age\": 6},\n... }\n&gt;&gt;&gt; root = add_dict_to_tree_by_path(root, path_dict)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>existing tree</p> required <code>path_attrs</code> <code>Dict[str, Dict[str, Any]]</code> <p>dictionary containing node path and attribute information, key: node path, value: dict of node attribute name and attribute value</p> required <code>sep</code> <code>str</code> <p>path separator for input <code>path_attrs</code></p> <code>'/'</code> <code>duplicate_name_allowed</code> <code>bool</code> <p>indicator if nodes with duplicate <code>Node</code> name is allowed, defaults to True</p> <code>True</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.add_dict_to_tree_by_name","title":"add_dict_to_tree_by_name","text":"<pre><code>add_dict_to_tree_by_name(tree, name_attrs)\n</code></pre> <p>Add attributes to existing tree in-place. Adds to existing tree from nested dictionary, <code>key</code>: name, <code>value</code>: dict of attribute name and attribute value.</p> <p>All attributes in <code>name_attrs</code> will be added to the tree, including attributes with null values.</p> <p>Input dictionary keys that are not existing node names will be ignored. Note that if multiple nodes have the same name, attributes will be added to all nodes sharing the same name.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, add_dict_to_tree_by_name\n&gt;&gt;&gt; root = Node(\"a\")\n&gt;&gt;&gt; b = Node(\"b\", parent=root)\n&gt;&gt;&gt; name_dict = {\n...     \"a\": {\"age\": 90},\n...     \"b\": {\"age\": 65},\n... }\n&gt;&gt;&gt; root = add_dict_to_tree_by_name(root, name_dict)\n&gt;&gt;&gt; root.show(attr_list=[\"age\"])\na [age=90]\n\u2514\u2500\u2500 b [age=65]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>existing tree</p> required <code>name_attrs</code> <code>Dict[str, Dict[str, Any]]</code> <p>dictionary containing node name and attribute information, key: node name, value: dict of node attribute name and attribute value</p> required <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.add_dataframe_to_tree_by_path","title":"add_dataframe_to_tree_by_path","text":"<pre><code>add_dataframe_to_tree_by_path(\n    tree,\n    data,\n    path_col=\"\",\n    attribute_cols=[],\n    sep=\"/\",\n    duplicate_name_allowed=True,\n)\n</code></pre> <p>Add nodes and attributes to tree in-place, return root of tree. Adds to existing tree from pandas DataFrame.</p> <p>Only attributes in <code>attribute_cols</code> with non-null values will be added to the tree.</p> <p><code>path_col</code> and <code>attribute_cols</code> specify columns for node path and attributes to add to existing tree. If columns are not specified, <code>path_col</code> takes first column and all other columns are <code>attribute_cols</code></p> <p>Path in path column should contain <code>Node</code> name, separated by <code>sep</code>.</p> <ul> <li>For example: Path string \"a/b\" refers to Node(\"b\") with parent Node(\"a\").</li> <li>Path separator <code>sep</code> is for the input <code>path</code> and can differ from existing tree.</li> </ul> <p>Path in path column can start from root node <code>name</code>, or start with <code>sep</code>.</p> <ul> <li>For example: Path string can be \"/a/b\" or \"a/b\", if sep is \"/\".</li> </ul> <p>All paths should start from the same root node.</p> <ul> <li>For example: Path strings should be \"a/b\", \"a/c\", \"a/b/d\" etc. and should not start with another root node.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; import pandas as pd\n&gt;&gt;&gt; from bigtree import add_dataframe_to_tree_by_path, Node\n&gt;&gt;&gt; root = Node(\"a\")\n&gt;&gt;&gt; path_data = pd.DataFrame([\n...     [\"a\", 90],\n...     [\"a/b\", 65],\n...     [\"a/c\", 60],\n...     [\"a/b/d\", 40],\n...     [\"a/b/e\", 35],\n...     [\"a/c/f\", 38],\n...     [\"a/b/e/g\", 10],\n...     [\"a/b/e/h\", 6],\n... ],\n...     columns=[\"PATH\", \"age\"]\n... )\n&gt;&gt;&gt; root = add_dataframe_to_tree_by_path(root, path_data)\n&gt;&gt;&gt; root.show(attr_list=[\"age\"])\na [age=90]\n\u251c\u2500\u2500 b [age=65]\n\u2502   \u251c\u2500\u2500 d [age=40]\n\u2502   \u2514\u2500\u2500 e [age=35]\n\u2502       \u251c\u2500\u2500 g [age=10]\n\u2502       \u2514\u2500\u2500 h [age=6]\n\u2514\u2500\u2500 c [age=60]\n    \u2514\u2500\u2500 f [age=38]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>existing tree</p> required <code>data</code> <code>DataFrame</code> <p>data containing node path and attribute information</p> required <code>path_col</code> <code>str</code> <p>column of data containing <code>path_name</code> information, if not set, it will take the first column of data</p> <code>''</code> <code>attribute_cols</code> <code>List[str]</code> <p>columns of data containing node attribute information, if not set, it will take all columns of data except <code>path_col</code></p> <code>[]</code> <code>sep</code> <code>str</code> <p>path separator for input <code>path_col</code></p> <code>'/'</code> <code>duplicate_name_allowed</code> <code>bool</code> <p>indicator if nodes with duplicate <code>Node</code> name is allowed, defaults to True</p> <code>True</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.add_dataframe_to_tree_by_name","title":"add_dataframe_to_tree_by_name","text":"<pre><code>add_dataframe_to_tree_by_name(\n    tree, data, name_col=\"\", attribute_cols=[]\n)\n</code></pre> <p>Add attributes to existing tree in-place. Adds to existing tree from pandas DataFrame.</p> <p>Only attributes in <code>attribute_cols</code> with non-null values will be added to the tree.</p> <p><code>name_col</code> and <code>attribute_cols</code> specify columns for node name and attributes to add to existing tree. If columns are not specified, the first column will be taken as name column and all other columns as attributes.</p> <p>Input data node names that are not existing node names will be ignored. Note that if multiple nodes have the same name, attributes will be added to all nodes sharing same name.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; import pandas as pd\n&gt;&gt;&gt; from bigtree import add_dataframe_to_tree_by_name, Node\n&gt;&gt;&gt; root = Node(\"a\")\n&gt;&gt;&gt; b = Node(\"b\", parent=root)\n&gt;&gt;&gt; name_data = pd.DataFrame([\n...     [\"a\", 90],\n...     [\"b\", 65],\n... ],\n...     columns=[\"NAME\", \"age\"]\n... )\n&gt;&gt;&gt; root = add_dataframe_to_tree_by_name(root, name_data)\n&gt;&gt;&gt; root.show(attr_list=[\"age\"])\na [age=90]\n\u2514\u2500\u2500 b [age=65]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>existing tree</p> required <code>data</code> <code>DataFrame</code> <p>data containing node name and attribute information</p> required <code>name_col</code> <code>str</code> <p>column of data containing <code>name</code> information, if not set, it will take the first column of data</p> <code>''</code> <code>attribute_cols</code> <code>List[str]</code> <p>column(s) of data containing node attribute information, if not set, it will take all columns of data except <code>path_col</code></p> <code>[]</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.str_to_tree","title":"str_to_tree","text":"<pre><code>str_to_tree(\n    tree_string, tree_prefix_list=[], node_type=Node\n)\n</code></pre> <p>Construct tree from tree string</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import str_to_tree\n&gt;&gt;&gt; tree_str = 'a\\n\u251c\u2500\u2500 b\\n\u2502   \u251c\u2500\u2500 d\\n\u2502   \u2514\u2500\u2500 e\\n\u2502       \u251c\u2500\u2500 g\\n\u2502       \u2514\u2500\u2500 h\\n\u2514\u2500\u2500 c\\n    \u2514\u2500\u2500 f'\n&gt;&gt;&gt; root = str_to_tree(tree_str, tree_prefix_list=[\"\u251c\u2500\u2500\", \"\u2514\u2500\u2500\"])\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree_string</code> <code>str</code> <p>String to construct tree</p> required <code>tree_prefix_list</code> <code>List[str]</code> <p>List of prefix to mark the end of tree branch/stem and start of node name, optional. If not specified, it will infer unicode characters and whitespace as prefix.</p> <code>[]</code> <code>node_type</code> <code>Type[Node]</code> <p>node type of tree to be created, defaults to <code>Node</code></p> <code>Node</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.list_to_tree","title":"list_to_tree","text":"<pre><code>list_to_tree(\n    paths,\n    sep=\"/\",\n    duplicate_name_allowed=True,\n    node_type=Node,\n)\n</code></pre> <p>Construct tree from list of path strings.</p> <p>Path should contain <code>Node</code> name, separated by <code>sep</code>.</p> <ul> <li>For example: Path string \"a/b\" refers to Node(\"b\") with parent Node(\"a\").</li> </ul> <p>Path can start from root node <code>name</code>, or start with <code>sep</code>.</p> <ul> <li>For example: Path string can be \"/a/b\" or \"a/b\", if sep is \"/\".</li> </ul> <p>All paths should start from the same root node.</p> <ul> <li>For example: Path strings should be \"a/b\", \"a/c\", \"a/b/d\" etc. and should not start with another root node.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import list_to_tree\n&gt;&gt;&gt; path_list = [\"a/b\", \"a/c\", \"a/b/d\", \"a/b/e\", \"a/c/f\", \"a/b/e/g\", \"a/b/e/h\"]\n&gt;&gt;&gt; root = list_to_tree(path_list)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>paths</code> <code>List[str]</code> <p>list containing path strings</p> required <code>sep</code> <code>str</code> <p>path separator for input <code>paths</code> and created tree, defaults to <code>/</code></p> <code>'/'</code> <code>duplicate_name_allowed</code> <code>bool</code> <p>indicator if nodes with duplicate <code>Node</code> name is allowed, defaults to True</p> <code>True</code> <code>node_type</code> <code>Type[Node]</code> <p>node type of tree to be created, defaults to <code>Node</code></p> <code>Node</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.list_to_tree_by_relation","title":"list_to_tree_by_relation","text":"<pre><code>list_to_tree_by_relation(\n    relations, allow_duplicates=False, node_type=Node\n)\n</code></pre> <p>Construct tree from list of tuple containing parent-child names.</p> <p>Root node is inferred when parent is empty, or when name appears as parent but not as child.</p> <p>Since tree is created from parent-child names, only names of leaf nodes may be repeated. Error will be thrown if names of intermediate nodes are repeated as there will be confusion. This error can be ignored by setting <code>allow_duplicates</code> to be True.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import list_to_tree_by_relation\n&gt;&gt;&gt; relations_list = [(\"a\", \"b\"), (\"a\", \"c\"), (\"b\", \"d\"), (\"b\", \"e\"), (\"c\", \"f\"), (\"e\", \"g\"), (\"e\", \"h\")]\n&gt;&gt;&gt; root = list_to_tree_by_relation(relations_list)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>relations</code> <code>List[Tuple[str, str]]</code> <p>list containing tuple containing parent-child names</p> required <code>allow_duplicates</code> <code>bool</code> <p>allow duplicate intermediate nodes such that child node will be tagged to multiple parent nodes, defaults to False</p> <code>False</code> <code>node_type</code> <code>Type[Node]</code> <p>node type of tree to be created, defaults to <code>Node</code></p> <code>Node</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.dict_to_tree","title":"dict_to_tree","text":"<pre><code>dict_to_tree(\n    path_attrs,\n    sep=\"/\",\n    duplicate_name_allowed=True,\n    node_type=Node,\n)\n</code></pre> <p>Construct tree from nested dictionary using path, <code>key</code>: path, <code>value</code>: dict of attribute name and attribute value.</p> <p>Path should contain <code>Node</code> name, separated by <code>sep</code>.</p> <ul> <li>For example: Path string \"a/b\" refers to Node(\"b\") with parent Node(\"a\").</li> </ul> <p>Path can start from root node <code>name</code>, or start with <code>sep</code>.</p> <ul> <li>For example: Path string can be \"/a/b\" or \"a/b\", if sep is \"/\".</li> </ul> <p>All paths should start from the same root node.</p> <ul> <li>For example: Path strings should be \"a/b\", \"a/c\", \"a/b/d\" etc. and should not start with another root node.</li> </ul> <p>All attributes in <code>path_attrs</code> will be added to the tree, including attributes with null values.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import dict_to_tree\n&gt;&gt;&gt; path_dict = {\n...     \"a\": {\"age\": 90},\n...     \"a/b\": {\"age\": 65},\n...     \"a/c\": {\"age\": 60},\n...     \"a/b/d\": {\"age\": 40},\n...     \"a/b/e\": {\"age\": 35},\n...     \"a/c/f\": {\"age\": 38},\n...     \"a/b/e/g\": {\"age\": 10},\n...     \"a/b/e/h\": {\"age\": 6},\n... }\n&gt;&gt;&gt; root = dict_to_tree(path_dict)\n&gt;&gt;&gt; root.show(attr_list=[\"age\"])\na [age=90]\n\u251c\u2500\u2500 b [age=65]\n\u2502   \u251c\u2500\u2500 d [age=40]\n\u2502   \u2514\u2500\u2500 e [age=35]\n\u2502       \u251c\u2500\u2500 g [age=10]\n\u2502       \u2514\u2500\u2500 h [age=6]\n\u2514\u2500\u2500 c [age=60]\n    \u2514\u2500\u2500 f [age=38]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>path_attrs</code> <code>Dict[str, Any]</code> <p>dictionary containing path and node attribute information, key: path, value: dict of tree attribute and attribute value</p> required <code>sep</code> <code>str</code> <p>path separator of input <code>path_attrs</code> and created tree, defaults to <code>/</code></p> <code>'/'</code> <code>duplicate_name_allowed</code> <code>bool</code> <p>indicator if nodes with duplicate <code>Node</code> name is allowed, defaults to True</p> <code>True</code> <code>node_type</code> <code>Type[Node]</code> <p>node type of tree to be created, defaults to <code>Node</code></p> <code>Node</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.nested_dict_to_tree","title":"nested_dict_to_tree","text":"<pre><code>nested_dict_to_tree(\n    node_attrs,\n    name_key=\"name\",\n    child_key=\"children\",\n    node_type=Node,\n)\n</code></pre> <p>Construct tree from nested recursive dictionary.</p> <ul> <li><code>key</code>: <code>name_key</code>, <code>child_key</code>, or any attributes key.</li> <li><code>value</code> of <code>name_key</code> (str): node name.</li> <li><code>value</code> of <code>child_key</code> (List[Dict[str, Any]]): list of dict containing <code>name_key</code> and <code>child_key</code> (recursive).</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import nested_dict_to_tree\n&gt;&gt;&gt; path_dict = {\n...     \"name\": \"a\",\n...     \"age\": 90,\n...     \"children\": [\n...         {\"name\": \"b\",\n...          \"age\": 65,\n...          \"children\": [\n...              {\"name\": \"d\", \"age\": 40},\n...              {\"name\": \"e\", \"age\": 35, \"children\": [\n...                  {\"name\": \"g\", \"age\": 10},\n...              ]},\n...          ]},\n...     ],\n... }\n&gt;&gt;&gt; root = nested_dict_to_tree(path_dict)\n&gt;&gt;&gt; root.show(attr_list=[\"age\"])\na [age=90]\n\u2514\u2500\u2500 b [age=65]\n    \u251c\u2500\u2500 d [age=40]\n    \u2514\u2500\u2500 e [age=35]\n        \u2514\u2500\u2500 g [age=10]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>node_attrs</code> <code>Dict[str, Any]</code> <p>dictionary containing node, children, and node attribute information, key: <code>name_key</code> and <code>child_key</code> value of <code>name_key</code> (str): node name value of <code>child_key</code> (List[Dict[str, Any]]): list of dict containing <code>name_key</code> and <code>child_key</code> (recursive)</p> required <code>name_key</code> <code>str</code> <p>key of node name, value is type str</p> <code>'name'</code> <code>child_key</code> <code>str</code> <p>key of child list, value is type list</p> <code>'children'</code> <code>node_type</code> <code>Type[Node]</code> <p>node type of tree to be created, defaults to <code>Node</code></p> <code>Node</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.dataframe_to_tree","title":"dataframe_to_tree","text":"<pre><code>dataframe_to_tree(\n    data,\n    path_col=\"\",\n    attribute_cols=[],\n    sep=\"/\",\n    duplicate_name_allowed=True,\n    node_type=Node,\n)\n</code></pre> <p>Construct tree from pandas DataFrame using path, return root of tree.</p> <p><code>path_col</code> and <code>attribute_cols</code> specify columns for node path and attributes to construct tree. If columns are not specified, <code>path_col</code> takes first column and all other columns are <code>attribute_cols</code>.</p> <p>Only attributes in <code>attribute_cols</code> with non-null values will be added to the tree.</p> <p>Path in path column can start from root node <code>name</code>, or start with <code>sep</code>.</p> <ul> <li>For example: Path string can be \"/a/b\" or \"a/b\", if sep is \"/\".</li> </ul> <p>Path in path column should contain <code>Node</code> name, separated by <code>sep</code>.</p> <ul> <li>For example: Path string \"a/b\" refers to Node(\"b\") with parent Node(\"a\").</li> </ul> <p>All paths should start from the same root node.</p> <ul> <li>For example: Path strings should be \"a/b\", \"a/c\", \"a/b/d\" etc. and should not start with another root node.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; import pandas as pd\n&gt;&gt;&gt; from bigtree import dataframe_to_tree\n&gt;&gt;&gt; path_data = pd.DataFrame([\n...     [\"a\", 90],\n...     [\"a/b\", 65],\n...     [\"a/c\", 60],\n...     [\"a/b/d\", 40],\n...     [\"a/b/e\", 35],\n...     [\"a/c/f\", 38],\n...     [\"a/b/e/g\", 10],\n...     [\"a/b/e/h\", 6],\n... ],\n...     columns=[\"PATH\", \"age\"]\n... )\n&gt;&gt;&gt; root = dataframe_to_tree(path_data)\n&gt;&gt;&gt; root.show(attr_list=[\"age\"])\na [age=90]\n\u251c\u2500\u2500 b [age=65]\n\u2502   \u251c\u2500\u2500 d [age=40]\n\u2502   \u2514\u2500\u2500 e [age=35]\n\u2502       \u251c\u2500\u2500 g [age=10]\n\u2502       \u2514\u2500\u2500 h [age=6]\n\u2514\u2500\u2500 c [age=60]\n    \u2514\u2500\u2500 f [age=38]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>data</code> <code>DataFrame</code> <p>data containing path and node attribute information</p> required <code>path_col</code> <code>str</code> <p>column of data containing <code>path_name</code> information, if not set, it will take the first column of data</p> <code>''</code> <code>attribute_cols</code> <code>List[str]</code> <p>columns of data containing node attribute information, if not set, it will take all columns of data except <code>path_col</code></p> <code>[]</code> <code>sep</code> <code>str</code> <p>path separator of input <code>path_col</code> and created tree, defaults to <code>/</code></p> <code>'/'</code> <code>duplicate_name_allowed</code> <code>bool</code> <p>indicator if nodes with duplicate <code>Node</code> name is allowed, defaults to True</p> <code>True</code> <code>node_type</code> <code>Type[Node]</code> <p>node type of tree to be created, defaults to <code>Node</code></p> <code>Node</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.dataframe_to_tree_by_relation","title":"dataframe_to_tree_by_relation","text":"<pre><code>dataframe_to_tree_by_relation(\n    data,\n    child_col=\"\",\n    parent_col=\"\",\n    attribute_cols=[],\n    allow_duplicates=False,\n    node_type=Node,\n)\n</code></pre> <p>Construct tree from pandas DataFrame using parent and child names, return root of tree.</p> <p>Root node is inferred when parent name is empty, or when name appears in parent column but not in child column.</p> <p>Since tree is created from parent-child names, only names of leaf nodes may be repeated. Error will be thrown if names of intermediate nodes are repeated as there will be confusion. This error can be ignored by setting <code>allow_duplicates</code> to be True.</p> <p><code>child_col</code> and <code>parent_col</code> specify columns for child name and parent name to construct tree. <code>attribute_cols</code> specify columns for node attribute for child name. If columns are not specified, <code>child_col</code> takes first column, <code>parent_col</code> takes second column, and all other columns are <code>attribute_cols</code>.</p> <p>Only attributes in <code>attribute_cols</code> with non-null values will be added to the tree.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; import pandas as pd\n&gt;&gt;&gt; from bigtree import dataframe_to_tree_by_relation\n&gt;&gt;&gt; relation_data = pd.DataFrame([\n...     [\"a\", None, 90],\n...     [\"b\", \"a\", 65],\n...     [\"c\", \"a\", 60],\n...     [\"d\", \"b\", 40],\n...     [\"e\", \"b\", 35],\n...     [\"f\", \"c\", 38],\n...     [\"g\", \"e\", 10],\n...     [\"h\", \"e\", 6],\n... ],\n...     columns=[\"child\", \"parent\", \"age\"]\n... )\n&gt;&gt;&gt; root = dataframe_to_tree_by_relation(relation_data)\n&gt;&gt;&gt; root.show(attr_list=[\"age\"])\na [age=90]\n\u251c\u2500\u2500 b [age=65]\n\u2502   \u251c\u2500\u2500 d [age=40]\n\u2502   \u2514\u2500\u2500 e [age=35]\n\u2502       \u251c\u2500\u2500 g [age=10]\n\u2502       \u2514\u2500\u2500 h [age=6]\n\u2514\u2500\u2500 c [age=60]\n    \u2514\u2500\u2500 f [age=38]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>data</code> <code>DataFrame</code> <p>data containing path and node attribute information</p> required <code>child_col</code> <code>str</code> <p>column of data containing child name information, defaults to None if not set, it will take the first column of data</p> <code>''</code> <code>parent_col</code> <code>str</code> <p>column of data containing parent name information, defaults to None if not set, it will take the second column of data</p> <code>''</code> <code>attribute_cols</code> <code>List[str]</code> <p>columns of data containing node attribute information, if not set, it will take all columns of data except <code>child_col</code> and <code>parent_col</code></p> <code>[]</code> <code>allow_duplicates</code> <code>bool</code> <p>allow duplicate intermediate nodes such that child node will be tagged to multiple parent nodes, defaults to False</p> <code>False</code> <code>node_type</code> <code>Type[Node]</code> <p>node type of tree to be created, defaults to <code>Node</code></p> <code>Node</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.newick_to_tree","title":"newick_to_tree","text":"<pre><code>newick_to_tree(\n    tree_string,\n    length_attr=\"length\",\n    attr_prefix=\"&amp;&amp;NHX:\",\n    node_type=Node,\n)\n</code></pre> <p>Construct tree from Newick notation, return root of tree.</p> <p>In the Newick Notation (or New Hampshire Notation)</p> <ul> <li>Tree is represented in round brackets i.e., <code>(child1,child2,child3)parent</code>.</li> <li>If there are nested tree, they will be in nested round brackets i.e., <code>((grandchild1)child1,(grandchild2,grandchild3)child2)parent</code>.</li> <li>If there is length attribute, they will be beside the name i.e., <code>(child1:0.5,child2:0.1)parent</code>.</li> <li>If there are other attributes, attributes are represented in square brackets i.e., <code>(child1:0.5[S:human],child2:0.1[S:human])parent[S:parent]</code>.</li> </ul> <p>Variations supported</p> <ul> <li>Support special characters (<code>[</code>, <code>]</code>, <code>(</code>, <code>)</code>, <code>:</code>, <code>,</code>) in node name, attribute name, and attribute values if     they are enclosed in single quotes i.e., '(name:!)'.</li> <li>If there are no node names, it will be auto-filled with convention <code>nodeN</code> with N representing a number.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import newick_to_tree\n&gt;&gt;&gt; root = newick_to_tree(\"((d,e)b,c)a\")\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2514\u2500\u2500 c\n</code></pre> <pre><code>&gt;&gt;&gt; root = newick_to_tree(\"((d:40,e:35)b:65,c:60)a\", length_attr=\"age\")\n&gt;&gt;&gt; root.show(attr_list=[\"age\"])\na\n\u251c\u2500\u2500 b [age=65]\n\u2502   \u251c\u2500\u2500 d [age=40]\n\u2502   \u2514\u2500\u2500 e [age=35]\n\u2514\u2500\u2500 c [age=60]\n</code></pre> <pre><code>&gt;&gt;&gt; root = newick_to_tree(\n...     \"((d:40[&amp;&amp;NHX:species=human],e:35[&amp;&amp;NHX:species=human])b:65[&amp;&amp;NHX:species=human],c:60[&amp;&amp;NHX:species=human])a[&amp;&amp;NHX:species=human]\",\n...     length_attr=\"age\",\n... )\n&gt;&gt;&gt; root.show(all_attrs=True)\na [species=human]\n\u251c\u2500\u2500 b [age=65, species=human]\n\u2502   \u251c\u2500\u2500 d [age=40, species=human]\n\u2502   \u2514\u2500\u2500 e [age=35, species=human]\n\u2514\u2500\u2500 c [age=60, species=human]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree_string</code> <code>str</code> <p>Newick notation to construct tree</p> required <code>length_attr</code> <code>str</code> <p>attribute name to store node length, optional, defaults to 'length'</p> <code>'length'</code> <code>attr_prefix</code> <code>str</code> <p>prefix before all attributes, within square bracket, used to detect attributes, defaults to \"&amp;&amp;NHX:\"</p> <code>'&amp;&amp;NHX:'</code> <code>node_type</code> <code>Type[Node]</code> <p>node type of tree to be created, defaults to <code>Node</code></p> <code>Node</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/export/","title":"\ud83d\udd28 Export","text":""},{"location":"bigtree/tree/export/#tree-export-methods","title":"Tree Export Methods","text":"<p>Export Tree to list, dictionary, and pandas DataFrame.</p> Export Tree to Method Command Line / Others <code>print_tree</code>, <code>yield_tree</code>, <code>hprint_tree</code>, <code>hyield_tree</code> String <code>tree_to_newick</code> Dictionary <code>tree_to_dict</code>, <code>tree_to_nested_dict</code> DataFrame <code>tree_to_dataframe</code> Dot (for .dot, .png, .svg, .jpeg, etc.) <code>tree_to_dot</code> Pillow (for .png, .jpg, .jpeg, etc.) <code>tree_to_mermaid</code> Mermaid Markdown (for .md) <code>tree_to_mermaid</code>"},{"location":"bigtree/tree/export/#tree-export-customizations","title":"Tree Export Customizations","text":"<p>While exporting to another data type, methods can take in arguments to determine what information to extract.</p> Method Extract node attributes Specify maximum depth Skip depth Extract leaves only Others <code>print_tree</code> Yes with <code>attr_list</code> or <code>all_attrs</code> Yes with <code>max_depth</code> No, but can specify subtree No Tree style <code>yield_tree</code> No, returns node Yes with <code>max_depth</code> No, but can specify subtree No Tree style <code>tree_to_newick</code> Yes with <code>attr_list</code> No No No Length separator and attribute prefix and separator <code>tree_to_dict</code> Yes with <code>attr_dict</code> or <code>all_attrs</code> Yes with <code>max_depth</code> Yes with <code>skip_depth</code> Yes with <code>leaf_only</code> Dict key for parent <code>tree_to_nested_dict</code> Yes with <code>attr_dict</code> or <code>all_attrs</code> Yes with <code>max_depth</code> No No Dict key for node name and node children <code>tree_to_dataframe</code> Yes with <code>attr_dict</code> or <code>all_attrs</code> Yes with <code>max_depth</code> Yes with <code>skip_depth</code> Yes with <code>leaf_only</code> Column name for path, node name, node parent <code>tree_to_dot</code> No No No No Graph attributes, background, node, edge colour, etc. <code>tree_to_pillow</code> No Yes, using keyword arguments similar to <code>yield_tree</code> No No Font (family, size, colour), background colour, etc. <code>tree_to_mermaid</code> No Yes, using keyword arguments similar to <code>yield_tree</code> No No Node shape, node fill, edge arrow, edge label etc."},{"location":"bigtree/tree/export/#bigtree.tree.export","title":"bigtree.tree.export","text":""},{"location":"bigtree/tree/export/#bigtree.tree.export.print_tree","title":"print_tree","text":"<pre><code>print_tree(\n    tree,\n    node_name_or_path=\"\",\n    max_depth=0,\n    all_attrs=False,\n    attr_list=[],\n    attr_omit_null=False,\n    attr_bracket=[\"[\", \"]\"],\n    style=\"const\",\n    custom_style=[],\n)\n</code></pre> <p>Print tree to console, starting from <code>tree</code>.</p> <ul> <li>Able to select which node to print from, resulting in a subtree, using <code>node_name_or_path</code></li> <li>Able to customize for maximum depth to print, using <code>max_depth</code></li> <li>Able to choose which attributes to show or show all attributes, using <code>attr_name_filter</code> and <code>all_attrs</code></li> <li>Able to omit showing of attributes if it is null, using <code>attr_omit_null</code></li> <li>Able to customize open and close brackets if attributes are shown, using <code>attr_bracket</code></li> <li>Able to customize style, to choose from <code>ansi</code>, <code>ascii</code>, <code>const</code>, <code>const_bold</code>, <code>rounded</code>, <code>double</code>, and <code>custom</code> style     - Default style is <code>const</code> style     - If style is set to custom, user can choose their own style for stem, branch and final stem icons     - Stem, branch, and final stem symbol should have the same number of characters</li> </ul> <p>Examples:</p> <p>Printing tree</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, print_tree\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=b)\n&gt;&gt;&gt; e = Node(\"e\", age=35, parent=b)\n&gt;&gt;&gt; print_tree(root)\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2514\u2500\u2500 c\n</code></pre> <p>Printing Sub-tree</p> <pre><code>&gt;&gt;&gt; print_tree(root, node_name_or_path=\"b\")\nb\n\u251c\u2500\u2500 d\n\u2514\u2500\u2500 e\n</code></pre> <pre><code>&gt;&gt;&gt; print_tree(root, max_depth=2)\na\n\u251c\u2500\u2500 b\n\u2514\u2500\u2500 c\n</code></pre> <p>Printing Attributes</p> <pre><code>&gt;&gt;&gt; print_tree(root, attr_list=[\"age\"])\na [age=90]\n\u251c\u2500\u2500 b [age=65]\n\u2502   \u251c\u2500\u2500 d [age=40]\n\u2502   \u2514\u2500\u2500 e [age=35]\n\u2514\u2500\u2500 c [age=60]\n</code></pre> <pre><code>&gt;&gt;&gt; print_tree(root, attr_list=[\"age\"], attr_bracket=[\"*(\", \")\"])\na *(age=90)\n\u251c\u2500\u2500 b *(age=65)\n\u2502   \u251c\u2500\u2500 d *(age=40)\n\u2502   \u2514\u2500\u2500 e *(age=35)\n\u2514\u2500\u2500 c *(age=60)\n</code></pre> <p>Available Styles</p> <pre><code>&gt;&gt;&gt; print_tree(root, style=\"ansi\")\na\n|-- b\n|   |-- d\n|   `-- e\n`-- c\n</code></pre> <pre><code>&gt;&gt;&gt; print_tree(root, style=\"ascii\")\na\n|-- b\n|   |-- d\n|   +-- e\n+-- c\n</code></pre> <pre><code>&gt;&gt;&gt; print_tree(root, style=\"const\")\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2514\u2500\u2500 c\n</code></pre> <pre><code>&gt;&gt;&gt; print_tree(root, style=\"const_bold\")\na\n\u2523\u2501\u2501 b\n\u2503   \u2523\u2501\u2501 d\n\u2503   \u2517\u2501\u2501 e\n\u2517\u2501\u2501 c\n</code></pre> <pre><code>&gt;&gt;&gt; print_tree(root, style=\"rounded\")\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2570\u2500\u2500 e\n\u2570\u2500\u2500 c\n</code></pre> <pre><code>&gt;&gt;&gt; print_tree(root, style=\"double\")\na\n\u2560\u2550\u2550 b\n\u2551   \u2560\u2550\u2550 d\n\u2551   \u255a\u2550\u2550 e\n\u255a\u2550\u2550 c\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to print</p> required <code>node_name_or_path</code> <code>str</code> <p>node to print from, becomes the root node of printing</p> <code>''</code> <code>max_depth</code> <code>int</code> <p>maximum depth of tree to print, based on <code>depth</code> attribute, optional</p> <code>0</code> <code>all_attrs</code> <code>bool</code> <p>indicator to show all attributes, defaults to False, overrides <code>attr_list</code> and <code>attr_omit_null</code></p> <code>False</code> <code>attr_list</code> <code>Iterable[str]</code> <p>list of node attributes to print, optional</p> <code>[]</code> <code>attr_omit_null</code> <code>bool</code> <p>indicator whether to omit showing of null attributes, defaults to False</p> <code>False</code> <code>attr_bracket</code> <code>List[str]</code> <p>open and close bracket for <code>all_attrs</code> or <code>attr_list</code></p> <code>['[', ']']</code> <code>style</code> <code>str</code> <p>style of print, defaults to const style</p> <code>'const'</code> <code>custom_style</code> <code>Iterable[str]</code> <p>style of stem, branch and final stem, used when <code>style</code> is set to 'custom'</p> <code>[]</code>"},{"location":"bigtree/tree/export/#bigtree.tree.export.yield_tree","title":"yield_tree","text":"<pre><code>yield_tree(\n    tree,\n    node_name_or_path=\"\",\n    max_depth=0,\n    style=\"const\",\n    custom_style=[],\n)\n</code></pre> <p>Generator method for customizing printing of tree, starting from <code>tree</code>.</p> <ul> <li>Able to select which node to print from, resulting in a subtree, using <code>node_name_or_path</code></li> <li>Able to customize for maximum depth to print, using <code>max_depth</code></li> <li>Able to customize style, to choose from <code>ansi</code>, <code>ascii</code>, <code>const</code>, <code>const_bold</code>, <code>rounded</code>, <code>double</code>, and <code>custom</code> style     - Default style is <code>const</code> style     - If style is set to custom, user can choose their own style for stem, branch and final stem icons     - Stem, branch, and final stem symbol should have the same number of characters</li> </ul> <p>Examples:</p> <p>Yield tree</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, yield_tree\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=b)\n&gt;&gt;&gt; e = Node(\"e\", age=35, parent=b)\n&gt;&gt;&gt; for branch, stem, node in yield_tree(root):\n...     print(f\"{branch}{stem}{node.node_name}\")\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2514\u2500\u2500 c\n</code></pre> <p>Yield Sub-tree</p> <pre><code>&gt;&gt;&gt; for branch, stem, node in yield_tree(root, node_name_or_path=\"b\"):\n...     print(f\"{branch}{stem}{node.node_name}\")\nb\n\u251c\u2500\u2500 d\n\u2514\u2500\u2500 e\n</code></pre> <pre><code>&gt;&gt;&gt; for branch, stem, node in yield_tree(root, max_depth=2):\n...     print(f\"{branch}{stem}{node.node_name}\")\na\n\u251c\u2500\u2500 b\n\u2514\u2500\u2500 c\n</code></pre> <p>Available Styles</p> <pre><code>&gt;&gt;&gt; for branch, stem, node in yield_tree(root, style=\"ansi\"):\n...     print(f\"{branch}{stem}{node.node_name}\")\na\n|-- b\n|   |-- d\n|   `-- e\n`-- c\n</code></pre> <pre><code>&gt;&gt;&gt; for branch, stem, node in yield_tree(root, style=\"ascii\"):\n...     print(f\"{branch}{stem}{node.node_name}\")\na\n|-- b\n|   |-- d\n|   +-- e\n+-- c\n</code></pre> <pre><code>&gt;&gt;&gt; for branch, stem, node in yield_tree(root, style=\"const\"):\n...     print(f\"{branch}{stem}{node.node_name}\")\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2514\u2500\u2500 c\n</code></pre> <pre><code>&gt;&gt;&gt; for branch, stem, node in yield_tree(root, style=\"const_bold\"):\n...     print(f\"{branch}{stem}{node.node_name}\")\na\n\u2523\u2501\u2501 b\n\u2503   \u2523\u2501\u2501 d\n\u2503   \u2517\u2501\u2501 e\n\u2517\u2501\u2501 c\n</code></pre> <pre><code>&gt;&gt;&gt; for branch, stem, node in yield_tree(root, style=\"rounded\"):\n...     print(f\"{branch}{stem}{node.node_name}\")\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2570\u2500\u2500 e\n\u2570\u2500\u2500 c\n</code></pre> <pre><code>&gt;&gt;&gt; for branch, stem, node in yield_tree(root, style=\"double\"):\n...     print(f\"{branch}{stem}{node.node_name}\")\na\n\u2560\u2550\u2550 b\n\u2551   \u2560\u2550\u2550 d\n\u2551   \u255a\u2550\u2550 e\n\u255a\u2550\u2550 c\n</code></pre> <p>Printing Attributes</p> <pre><code>&gt;&gt;&gt; for branch, stem, node in yield_tree(root, style=\"const\"):\n...     print(f\"{branch}{stem}{node.node_name} [age={node.age}]\")\na [age=90]\n\u251c\u2500\u2500 b [age=65]\n\u2502   \u251c\u2500\u2500 d [age=40]\n\u2502   \u2514\u2500\u2500 e [age=35]\n\u2514\u2500\u2500 c [age=60]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to print</p> required <code>node_name_or_path</code> <code>str</code> <p>node to print from, becomes the root node of printing, optional</p> <code>''</code> <code>max_depth</code> <code>int</code> <p>maximum depth of tree to print, based on <code>depth</code> attribute, optional</p> <code>0</code> <code>style</code> <code>str</code> <p>style of print, defaults to const</p> <code>'const'</code> <code>custom_style</code> <code>Iterable[str]</code> <p>style of stem, branch and final stem, used when <code>style</code> is set to 'custom'</p> <code>[]</code>"},{"location":"bigtree/tree/export/#bigtree.tree.export.hprint_tree","title":"hprint_tree","text":"<pre><code>hprint_tree(\n    tree,\n    node_name_or_path=\"\",\n    max_depth=0,\n    intermediate_node_name=True,\n    style=\"const\",\n    custom_style=[],\n)\n</code></pre> <p>Print tree in horizontal orientation to console, starting from <code>tree</code>.</p> <ul> <li>Able to select which node to print from, resulting in a subtree, using <code>node_name_or_path</code></li> <li>Able to customize for maximum depth to print, using <code>max_depth</code></li> <li>Able to customize style, to choose from <code>ansi</code>, <code>ascii</code>, <code>const</code>, <code>const_bold</code>, <code>rounded</code>, <code>double</code>, and <code>custom</code> style     - Default style is <code>const</code> style     - If style is set to custom, user can choose their own style icons     - Style icons should have the same number of characters</li> </ul> <p>Examples:</p> <p>Printing tree</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, hprint_tree\n&gt;&gt;&gt; root = Node(\"a\")\n&gt;&gt;&gt; b = Node(\"b\", parent=root)\n&gt;&gt;&gt; c = Node(\"c\", parent=root)\n&gt;&gt;&gt; d = Node(\"d\", parent=b)\n&gt;&gt;&gt; e = Node(\"e\", parent=b)\n&gt;&gt;&gt; hprint_tree(root)\n           \u250c\u2500 d\n     \u250c\u2500 b \u2500\u2524\n\u2500 a \u2500\u2524     \u2514\u2500 e\n     \u2514\u2500 c\n</code></pre> <p>Printing Sub-tree</p> <pre><code>&gt;&gt;&gt; hprint_tree(root, node_name_or_path=\"b\")\n     \u250c\u2500 d\n\u2500 b \u2500\u2524\n     \u2514\u2500 e\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, max_depth=2)\n     \u250c\u2500 b\n\u2500 a \u2500\u2524\n     \u2514\u2500 c\n</code></pre> <p>Available Styles</p> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"ansi\")\n           /- d\n     /- b -+\n- a -+     \\- e\n     \\- c\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"ascii\")\n           +- d\n     +- b -+\n- a -+     +- e\n     +- c\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"const\")\n           \u250c\u2500 d\n     \u250c\u2500 b \u2500\u2524\n\u2500 a \u2500\u2524     \u2514\u2500 e\n     \u2514\u2500 c\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"const_bold\")\n           \u250f\u2501 d\n     \u250f\u2501 b \u2501\u252b\n\u2501 a \u2501\u252b     \u2517\u2501 e\n     \u2517\u2501 c\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"rounded\")\n           \u256d\u2500 d\n     \u256d\u2500 b \u2500\u2524\n\u2500 a \u2500\u2524     \u2570\u2500 e\n     \u2570\u2500 c\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"double\")\n           \u2554\u2550 d\n     \u2554\u2550 b \u2550\u2563\n\u2550 a \u2550\u2563     \u255a\u2550 e\n     \u255a\u2550 c\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to print</p> required <code>node_name_or_path</code> <code>str</code> <p>node to print from, becomes the root node of printing</p> <code>''</code> <code>max_depth</code> <code>int</code> <p>maximum depth of tree to print, based on <code>depth</code> attribute, optional</p> <code>0</code> <code>intermediate_node_name</code> <code>bool</code> <p>indicator if intermediate nodes have node names, defaults to True</p> <code>True</code> <code>style</code> <code>str</code> <p>style of print, defaults to const style</p> <code>'const'</code> <code>custom_style</code> <code>Iterable[str]</code> <p>style of icons, used when <code>style</code> is set to 'custom'</p> <code>[]</code>"},{"location":"bigtree/tree/export/#bigtree.tree.export.hyield_tree","title":"hyield_tree","text":"<pre><code>hyield_tree(\n    tree,\n    node_name_or_path=\"\",\n    max_depth=0,\n    intermediate_node_name=True,\n    style=\"const\",\n    custom_style=[],\n)\n</code></pre> <p>Yield tree in horizontal orientation to console, starting from <code>tree</code>.</p> <ul> <li>Able to select which node to print from, resulting in a subtree, using <code>node_name_or_path</code></li> <li>Able to customize for maximum depth to print, using <code>max_depth</code></li> <li>Able to customize style, to choose from <code>ansi</code>, <code>ascii</code>, <code>const</code>, <code>const_bold</code>, <code>rounded</code>, <code>double</code>, and <code>custom</code> style     - Default style is <code>const</code> style     - If style is set to custom, user can choose their own style icons     - Style icons should have the same number of characters</li> </ul> <p>Examples:</p> <p>Printing tree</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, hyield_tree\n&gt;&gt;&gt; root = Node(\"a\")\n&gt;&gt;&gt; b = Node(\"b\", parent=root)\n&gt;&gt;&gt; c = Node(\"c\", parent=root)\n&gt;&gt;&gt; d = Node(\"d\", parent=b)\n&gt;&gt;&gt; e = Node(\"e\", parent=b)\n&gt;&gt;&gt; result = hyield_tree(root)\n&gt;&gt;&gt; print(\"\\n\".join(result))\n           \u250c\u2500 d\n     \u250c\u2500 b \u2500\u2524\n\u2500 a \u2500\u2524     \u2514\u2500 e\n     \u2514\u2500 c\n</code></pre> <p>Printing Sub-tree</p> <pre><code>&gt;&gt;&gt; hprint_tree(root, node_name_or_path=\"b\")\n     \u250c\u2500 d\n\u2500 b \u2500\u2524\n     \u2514\u2500 e\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, max_depth=2)\n     \u250c\u2500 b\n\u2500 a \u2500\u2524\n     \u2514\u2500 c\n</code></pre> <p>Available Styles</p> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"ansi\")\n           /- d\n     /- b -+\n- a -+     \\- e\n     \\- c\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"ascii\")\n           +- d\n     +- b -+\n- a -+     +- e\n     +- c\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"const\")\n           \u250c\u2500 d\n     \u250c\u2500 b \u2500\u2524\n\u2500 a \u2500\u2524     \u2514\u2500 e\n     \u2514\u2500 c\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"const_bold\")\n           \u250f\u2501 d\n     \u250f\u2501 b \u2501\u252b\n\u2501 a \u2501\u252b     \u2517\u2501 e\n     \u2517\u2501 c\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"rounded\")\n           \u256d\u2500 d\n     \u256d\u2500 b \u2500\u2524\n\u2500 a \u2500\u2524     \u2570\u2500 e\n     \u2570\u2500 c\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"double\")\n           \u2554\u2550 d\n     \u2554\u2550 b \u2550\u2563\n\u2550 a \u2550\u2563     \u255a\u2550 e\n     \u255a\u2550 c\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to print</p> required <code>node_name_or_path</code> <code>str</code> <p>node to print from, becomes the root node of printing</p> <code>''</code> <code>max_depth</code> <code>int</code> <p>maximum depth of tree to print, based on <code>depth</code> attribute, optional</p> <code>0</code> <code>intermediate_node_name</code> <code>bool</code> <p>indicator if intermediate nodes have node names, defaults to True</p> <code>True</code> <code>style</code> <code>str</code> <p>style of print, defaults to const style</p> <code>'const'</code> <code>custom_style</code> <code>Iterable[str]</code> <p>style of icons, used when <code>style</code> is set to 'custom'</p> <code>[]</code> <p>Returns:</p> Type Description <code>List[str]</code> <p>(List[str])</p>"},{"location":"bigtree/tree/export/#bigtree.tree.export.tree_to_newick","title":"tree_to_newick","text":"<pre><code>tree_to_newick(\n    tree,\n    intermediate_node_name=True,\n    length_attr=\"\",\n    length_sep=NewickCharacter.SEP,\n    attr_list=[],\n    attr_prefix=\"&amp;&amp;NHX:\",\n    attr_sep=NewickCharacter.SEP,\n)\n</code></pre> <p>Export tree to Newick notation. Useful for describing phylogenetic tree.</p> <p>In the Newick Notation (or New Hampshire Notation),   - Tree is represented in round brackets i.e., <code>(child1,child2,child3)parent</code>.   - If there are nested tree, they will be in nested round brackets i.e., <code>((grandchild1)child1,(grandchild2,grandchild3)child2)parent</code>.   - If there is length attribute, they will be beside the name i.e., <code>(child1:0.5,child2:0.1)parent</code>.   - If there are other attributes, attributes are represented in square brackets i.e., <code>(child1:0.5[S:human],child2:0.1[S:human])parent[S:parent]</code>.</p> Customizations include <ul> <li>Omitting names of root and intermediate nodes, default all node names are shown.</li> <li>Changing length separator to other symbol, default is <code>:</code>.</li> <li>Adding an attribute prefix, default is <code>&amp;&amp;NHX:</code>.</li> <li>Changing the attribute separator to other symbol, default is <code>:</code>.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, tree_to_newick\n&gt;&gt;&gt; root = Node(\"a\", species=\"human\")\n&gt;&gt;&gt; b = Node(\"b\", age=65, species=\"human\", parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, species=\"human\", parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, species=\"human\", parent=b)\n&gt;&gt;&gt; e = Node(\"e\", age=35, species=\"human\", parent=b)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2514\u2500\u2500 c\n</code></pre> <pre><code>&gt;&gt;&gt; tree_to_newick(root)\n'((d,e)b,c)a'\n</code></pre> <pre><code>&gt;&gt;&gt; tree_to_newick(root, length_attr=\"age\")\n'((d:40,e:35)b:65,c:60)a'\n</code></pre> <pre><code>&gt;&gt;&gt; tree_to_newick(root, length_attr=\"age\", attr_list=[\"species\"])\n'((d:40[&amp;&amp;NHX:species=human],e:35[&amp;&amp;NHX:species=human])b:65[&amp;&amp;NHX:species=human],c:60[&amp;&amp;NHX:species=human])a[&amp;&amp;NHX:species=human]'\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to be exported</p> required <code>intermediate_node_name</code> <code>bool</code> <p>indicator if intermediate nodes have node names, defaults to True</p> <code>True</code> <code>length_attr</code> <code>str</code> <p>node length attribute to extract to beside name, optional</p> <code>''</code> <code>length_sep</code> <code>str</code> <p>separator between node name and length, used if length_attr is non-empty, defaults to \":\"</p> <code>SEP</code> <code>attr_list</code> <code>Iterable[str]</code> <p>list of node attributes to extract into square bracket, optional</p> <code>[]</code> <code>attr_prefix</code> <code>str</code> <p>prefix before all attributes, within square bracket, used if attr_list is non-empty, defaults to \"&amp;&amp;NHX:\"</p> <code>'&amp;&amp;NHX:'</code> <code>attr_sep</code> <code>str</code> <p>separator between attributes, within square brackets, used if attr_list is non-empty, defaults to \":\"</p> <code>SEP</code> <p>Returns:</p> Type Description <code>str</code> <p>(str)</p>"},{"location":"bigtree/tree/export/#bigtree.tree.export.tree_to_dict","title":"tree_to_dict","text":"<pre><code>tree_to_dict(\n    tree,\n    name_key=\"name\",\n    parent_key=\"\",\n    attr_dict={},\n    all_attrs=False,\n    max_depth=0,\n    skip_depth=0,\n    leaf_only=False,\n)\n</code></pre> <p>Export tree to dictionary.</p> <p>All descendants from <code>tree</code> will be exported, <code>tree</code> can be the root node or child node of tree.</p> <p>Exported dictionary will have key as node path, and node attributes as a nested dictionary.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, tree_to_dict\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=b)\n&gt;&gt;&gt; e = Node(\"e\", age=35, parent=b)\n&gt;&gt;&gt; tree_to_dict(root, name_key=\"name\", parent_key=\"parent\", attr_dict={\"age\": \"person age\"})\n{'/a': {'name': 'a', 'parent': None, 'person age': 90}, '/a/b': {'name': 'b', 'parent': 'a', 'person age': 65}, '/a/b/d': {'name': 'd', 'parent': 'b', 'person age': 40}, '/a/b/e': {'name': 'e', 'parent': 'b', 'person age': 35}, '/a/c': {'name': 'c', 'parent': 'a', 'person age': 60}}\n</code></pre> <p>For a subset of a tree</p> <pre><code>&gt;&gt;&gt; tree_to_dict(c, name_key=\"name\", parent_key=\"parent\", attr_dict={\"age\": \"person age\"})\n{'/a/c': {'name': 'c', 'parent': 'a', 'person age': 60}}\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to be exported</p> required <code>name_key</code> <code>str</code> <p>dictionary key for <code>node.node_name</code>, defaults to 'name'</p> <code>'name'</code> <code>parent_key</code> <code>str</code> <p>dictionary key for <code>node.parent.node_name</code>, optional</p> <code>''</code> <code>attr_dict</code> <code>Dict[str, str]</code> <p>dictionary mapping node attributes to dictionary key, key: node attributes, value: corresponding dictionary key, optional</p> <code>{}</code> <code>all_attrs</code> <code>bool</code> <p>indicator whether to retrieve all <code>Node</code> attributes, overrides <code>attr_dict</code>, defaults to False</p> <code>False</code> <code>max_depth</code> <code>int</code> <p>maximum depth to export tree, optional</p> <code>0</code> <code>skip_depth</code> <code>int</code> <p>number of initial depths to skip, optional</p> <code>0</code> <code>leaf_only</code> <code>bool</code> <p>indicator to retrieve only information from leaf nodes</p> <code>False</code> <p>Returns:</p> Type Description <code>Dict[str, Any]</code> <p>(Dict[str, Any])</p>"},{"location":"bigtree/tree/export/#bigtree.tree.export.tree_to_nested_dict","title":"tree_to_nested_dict","text":"<pre><code>tree_to_nested_dict(\n    tree,\n    name_key=\"name\",\n    child_key=\"children\",\n    attr_dict={},\n    all_attrs=False,\n    max_depth=0,\n)\n</code></pre> <p>Export tree to nested dictionary.</p> <p>All descendants from <code>tree</code> will be exported, <code>tree</code> can be the root node or child node of tree.</p> <p>Exported dictionary will have key as node attribute names, and children as a nested recursive dictionary.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, tree_to_nested_dict\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=b)\n&gt;&gt;&gt; e = Node(\"e\", age=35, parent=b)\n&gt;&gt;&gt; tree_to_nested_dict(root, all_attrs=True)\n{'name': 'a', 'age': 90, 'children': [{'name': 'b', 'age': 65, 'children': [{'name': 'd', 'age': 40}, {'name': 'e', 'age': 35}]}, {'name': 'c', 'age': 60}]}\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to be exported</p> required <code>name_key</code> <code>str</code> <p>dictionary key for <code>node.node_name</code>, defaults to 'name'</p> <code>'name'</code> <code>child_key</code> <code>str</code> <p>dictionary key for list of children, optional</p> <code>'children'</code> <code>attr_dict</code> <code>Dict[str, str]</code> <p>dictionary mapping node attributes to dictionary key, key: node attributes, value: corresponding dictionary key, optional</p> <code>{}</code> <code>all_attrs</code> <code>bool</code> <p>indicator whether to retrieve all <code>Node</code> attributes, overrides <code>attr_dict</code>, defaults to False</p> <code>False</code> <code>max_depth</code> <code>int</code> <p>maximum depth to export tree, optional</p> <code>0</code> <p>Returns:</p> Type Description <code>Dict[str, Any]</code> <p>(Dict[str, Any])</p>"},{"location":"bigtree/tree/export/#bigtree.tree.export.tree_to_dataframe","title":"tree_to_dataframe","text":"<pre><code>tree_to_dataframe(\n    tree,\n    path_col=\"path\",\n    name_col=\"name\",\n    parent_col=\"\",\n    attr_dict={},\n    all_attrs=False,\n    max_depth=0,\n    skip_depth=0,\n    leaf_only=False,\n)\n</code></pre> <p>Export tree to pandas DataFrame.</p> <p>All descendants from <code>tree</code> will be exported, <code>tree</code> can be the root node or child node of tree.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, tree_to_dataframe\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=b)\n&gt;&gt;&gt; e = Node(\"e\", age=35, parent=b)\n&gt;&gt;&gt; tree_to_dataframe(root, name_col=\"name\", parent_col=\"parent\", path_col=\"path\", attr_dict={\"age\": \"person age\"})\n     path name parent  person age\n0      /a    a   None          90\n1    /a/b    b      a          65\n2  /a/b/d    d      b          40\n3  /a/b/e    e      b          35\n4    /a/c    c      a          60\n</code></pre> <p>For a subset of a tree.</p> <pre><code>&gt;&gt;&gt; tree_to_dataframe(b, name_col=\"name\", parent_col=\"parent\", path_col=\"path\", attr_dict={\"age\": \"person age\"})\n     path name parent  person age\n0    /a/b    b      a          65\n1  /a/b/d    d      b          40\n2  /a/b/e    e      b          35\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to be exported</p> required <code>path_col</code> <code>str</code> <p>column name for <code>node.path_name</code>, defaults to 'path'</p> <code>'path'</code> <code>name_col</code> <code>str</code> <p>column name for <code>node.node_name</code>, defaults to 'name'</p> <code>'name'</code> <code>parent_col</code> <code>str</code> <p>column name for <code>node.parent.node_name</code>, optional</p> <code>''</code> <code>attr_dict</code> <code>Dict[str, str]</code> <p>dictionary mapping node attributes to column name, key: node attributes, value: corresponding column in dataframe, optional</p> <code>{}</code> <code>all_attrs</code> <code>bool</code> <p>indicator whether to retrieve all <code>Node</code> attributes, overrides <code>attr_dict</code>, defaults to False</p> <code>False</code> <code>max_depth</code> <code>int</code> <p>maximum depth to export tree, optional</p> <code>0</code> <code>skip_depth</code> <code>int</code> <p>number of initial depths to skip, optional</p> <code>0</code> <code>leaf_only</code> <code>bool</code> <p>indicator to retrieve only information from leaf nodes</p> <code>False</code> <p>Returns:</p> Type Description <code>DataFrame</code> <p>(pd.DataFrame)</p>"},{"location":"bigtree/tree/export/#bigtree.tree.export.tree_to_dot","title":"tree_to_dot","text":"<pre><code>tree_to_dot(\n    tree,\n    directed=True,\n    rankdir=\"TB\",\n    bg_colour=\"\",\n    node_colour=\"\",\n    node_shape=\"\",\n    edge_colour=\"\",\n    node_attr=\"\",\n    edge_attr=\"\",\n)\n</code></pre> <p>Export tree or list of trees to image. Possible node attributes include style, fillcolor, shape.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, tree_to_dot\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=b)\n&gt;&gt;&gt; e = Node(\"e\", age=35, parent=b)\n&gt;&gt;&gt; graph = tree_to_dot(root)\n</code></pre> <p>Display image directly without saving (requires IPython)</p> <pre><code>&gt;&gt;&gt; from IPython.display import Image, display\n&gt;&gt;&gt; plt = Image(graph.create_png())\n&gt;&gt;&gt; display(plt)\n&lt;IPython.core.display.Image object&gt;\n</code></pre> <p>Export to image, dot file, etc.</p> <pre><code>&gt;&gt;&gt; graph.write_png(\"assets/docstr/tree.png\")\n&gt;&gt;&gt; graph.write_dot(\"assets/docstr/tree.dot\")\n</code></pre> <p>Export to string</p> <pre><code>&gt;&gt;&gt; graph.to_string()\n'strict digraph G {\\nrankdir=TB;\\na0 [label=a];\\nb0 [label=b];\\na0 -&gt; b0;\\nd0 [label=d];\\nb0 -&gt; d0;\\ne0 [label=e];\\nb0 -&gt; e0;\\nc0 [label=c];\\na0 -&gt; c0;\\n}\\n'\n</code></pre> <p>Defining node and edge attributes (using node attribute)</p> <pre><code>&gt;&gt;&gt; class CustomNode(Node):\n...     def __init__(self, name, node_shape=\"\", edge_label=\"\", **kwargs):\n...         super().__init__(name, **kwargs)\n...         self.node_shape = node_shape\n...         self.edge_label = edge_label\n...\n...     @property\n...     def edge_attr(self):\n...         if self.edge_label:\n...             return {\"label\": self.edge_label}\n...         return {}\n...\n...     @property\n...     def node_attr(self):\n...         if self.node_shape:\n...             return {\"shape\": self.node_shape}\n...         return {}\n&gt;&gt;&gt;\n&gt;&gt;&gt;\n&gt;&gt;&gt; root = CustomNode(\"a\", node_shape=\"circle\")\n&gt;&gt;&gt; b = CustomNode(\"b\", edge_label=\"child\", parent=root)\n&gt;&gt;&gt; c = CustomNode(\"c\", edge_label=\"child\", parent=root)\n&gt;&gt;&gt; d = CustomNode(\"d\", node_shape=\"square\", edge_label=\"child\", parent=b)\n&gt;&gt;&gt; e = CustomNode(\"e\", node_shape=\"square\", edge_label=\"child\", parent=b)\n&gt;&gt;&gt; graph = tree_to_dot(root, node_colour=\"gold\", node_shape=\"diamond\", node_attr=\"node_attr\", edge_attr=\"edge_attr\")\n&gt;&gt;&gt; graph.write_png(\"assets/export_tree_dot.png\")\n</code></pre> <p></p> <p>Alternative way to define node and edge attributes (using callable function)</p> <pre><code>&gt;&gt;&gt; def get_node_attribute(node: Node):\n...     if node.is_leaf:\n...         return {\"shape\": \"square\"}\n...     return {\"shape\": \"circle\"}\n&gt;&gt;&gt;\n&gt;&gt;&gt;\n&gt;&gt;&gt; root = CustomNode(\"a\")\n&gt;&gt;&gt; b = CustomNode(\"b\", parent=root)\n&gt;&gt;&gt; c = CustomNode(\"c\", parent=root)\n&gt;&gt;&gt; d = CustomNode(\"d\", parent=b)\n&gt;&gt;&gt; e = CustomNode(\"e\", parent=b)\n&gt;&gt;&gt; graph = tree_to_dot(root, node_colour=\"gold\", node_attr=get_node_attribute)\n&gt;&gt;&gt; graph.write_png(\"assets/export_tree_dot_callable.png\")\n</code></pre> <p></p> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node / List[Node]</code> <p>tree or list of trees to be exported</p> required <code>directed</code> <code>bool</code> <p>indicator whether graph should be directed or undirected, defaults to True</p> <code>True</code> <code>rankdir</code> <code>str</code> <p>layout direction, defaults to 'TB' (top to bottom), can be 'BT' (bottom to top), 'LR' (left to right), 'RL' (right to left)</p> <code>'TB'</code> <code>bg_colour</code> <code>str</code> <p>background color of image, defaults to None</p> <code>''</code> <code>node_colour</code> <code>str</code> <p>fill colour of nodes, defaults to None</p> <code>''</code> <code>node_shape</code> <code>str</code> <p>shape of nodes, defaults to None Possible node_shape include \"circle\", \"square\", \"diamond\", \"triangle\"</p> <code>''</code> <code>edge_colour</code> <code>str</code> <p>colour of edges, defaults to None</p> <code>''</code> <code>node_attr</code> <code>str | Callable</code> <p>If string type, it refers to <code>Node</code> attribute for node style. If callable type, it takes in the node itself and returns the node style. This overrides <code>node_colour</code> and <code>node_shape</code> and defaults to None. Possible node styles include {\"style\": \"filled\", \"fillcolor\": \"gold\", \"shape\": \"diamond\"}</p> <code>''</code> <code>edge_attr</code> <code>str | Callable</code> <p>If stirng type, it refers to <code>Node</code> attribute for edge style. If callable type, it takes in the node itself and returns the edge style. This overrides <code>edge_colour</code>, and defaults to None. Possible edge styles include {\"style\": \"bold\", \"label\": \"edge label\", \"color\": \"black\"}</p> <code>''</code> <p>Returns:</p> Type Description <code>Dot</code> <p>(pydot.Dot)</p>"},{"location":"bigtree/tree/export/#bigtree.tree.export.tree_to_pillow","title":"tree_to_pillow","text":"<pre><code>tree_to_pillow(\n    tree,\n    width=0,\n    height=0,\n    start_pos=(10, 10),\n    font_family=\"\",\n    font_size=12,\n    font_colour=\"black\",\n    bg_colour=\"white\",\n    **kwargs\n)\n</code></pre> <p>Export tree to image (JPG, PNG). Image will be similar format as <code>print_tree</code>, accepts additional keyword arguments as input to <code>yield_tree</code>.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, tree_to_pillow\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=b)\n&gt;&gt;&gt; e = Node(\"e\", age=35, parent=b)\n&gt;&gt;&gt; pillow_image = tree_to_pillow(root)\n</code></pre> <p>Export to image (PNG, JPG) file, etc.</p> <pre><code>&gt;&gt;&gt; pillow_image.save(\"assets/docstr/tree_pillow.png\")\n&gt;&gt;&gt; pillow_image.save(\"assets/docstr/tree_pillow.jpg\")\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to be exported</p> required <code>width</code> <code>int</code> <p>width of image, optional as width of image is calculated automatically</p> <code>0</code> <code>height</code> <code>int</code> <p>height of image, optional as height of image is calculated automatically</p> <code>0</code> <code>start_pos</code> <code>Tuple[int, int]</code> <p>start position of text, (x-offset, y-offset), defaults to (10, 10)</p> <code>(10, 10)</code> <code>font_family</code> <code>str</code> <p>file path of font family, requires .ttf file, defaults to DejaVuSans</p> <code>''</code> <code>font_size</code> <code>int</code> <p>font size, defaults to 12</p> <code>12</code> <code>font_colour</code> <code>Union[Tuple[int, int, int], str]</code> <p>font colour, accepts tuple of RGB values or string, defaults to black</p> <code>'black'</code> <code>bg_colour</code> <code>Union[Tuple[int, int, int], str]</code> <p>background of image, accepts tuple of RGB values or string, defaults to white</p> <code>'white'</code> <p>Returns:</p> Type Description <code>Image</code> <p>(PIL.Image.Image)</p>"},{"location":"bigtree/tree/export/#bigtree.tree.export.tree_to_mermaid","title":"tree_to_mermaid","text":"<pre><code>tree_to_mermaid(\n    tree,\n    title=\"\",\n    rankdir=\"TB\",\n    line_shape=\"basis\",\n    node_colour=\"\",\n    node_border_colour=\"\",\n    node_border_width=1,\n    node_shape=\"rounded_edge\",\n    node_shape_attr=\"\",\n    edge_arrow=\"normal\",\n    edge_arrow_attr=\"\",\n    edge_label=\"\",\n    node_attr=\"\",\n    **kwargs\n)\n</code></pre> <p>Export tree to mermaid Markdown text. Accepts additional keyword arguments as input to <code>yield_tree</code>.</p> Parameters for customizations that applies to entire flowchart include <ul> <li>Title, <code>title</code></li> <li>Layout direction, <code>rankdir</code></li> <li>Line shape or curvature, <code>line_shape</code></li> <li>Fill colour of nodes, <code>node_colour</code></li> <li>Border colour of nodes, <code>node_border_colour</code></li> <li>Border width of nodes, <code>node_border_width</code></li> <li>Node shape, <code>node_shape</code></li> <li>Edge arrow style, <code>edge_arrow</code></li> </ul> Parameters for customizations that apply to customized nodes <ul> <li>Fill colour of nodes, fill under <code>node_attr</code></li> <li>Border colour of nodes, stroke under <code>node_attr</code></li> <li>Border width of nodes, stroke-width under <code>node_attr</code></li> <li>Node shape, <code>node_shape_attr</code></li> <li>Edge arrow style, <code>edge_arrow_attr</code></li> <li>Edge label, <code>edge_label</code></li> </ul> <p>Accepted Parameter Values</p> Possible rankdir <ul> <li><code>TB</code>: top-to-bottom</li> <li><code>BT</code>: bottom-to-top</li> <li><code>LR</code>: left-to-right</li> <li><code>RL</code>: right-to-left</li> </ul> Possible line_shape <ul> <li><code>basis</code></li> <li><code>bumpX</code>: used in LR or RL direction</li> <li><code>bumpY</code></li> <li><code>cardinal</code>: undirected</li> <li><code>catmullRom</code>: undirected</li> <li><code>linear</code>:</li> <li><code>monotoneX</code>: used in LR or RL direction</li> <li><code>monotoneY</code></li> <li><code>natural</code></li> <li><code>step</code>: used in LR or RL direction</li> <li><code>stepAfter</code></li> <li><code>stepBefore</code>: used in LR or RL direction</li> </ul> Possible node_shape <ul> <li><code>rounded_edge</code>: rectangular with rounded edges</li> <li><code>stadium</code>: (_) shape, rectangular with rounded ends</li> <li><code>subroutine</code>: ||_|| shape, rectangular with additional line at the ends</li> <li><code>cylindrical</code>: database node</li> <li><code>circle</code>: circular</li> <li><code>asymmetric</code>: &gt;_| shape</li> <li><code>rhombus</code>: decision node</li> <li><code>hexagon</code>: &lt;_&gt; shape</li> <li><code>parallelogram</code>: /_/ shape</li> <li><code>parallelogram_alt</code>: \\_\\ shape, inverted parallelogram</li> <li><code>trapezoid</code>: /_\\ shape</li> <li><code>trapezoid_alt</code>: \\_/ shape, inverted trapezoid</li> <li><code>double_circle</code></li> </ul> Possible edge_arrow <ul> <li><code>normal</code>: directed arrow, shaded arrowhead</li> <li><code>bold</code>: bold directed arrow</li> <li><code>dotted</code>: dotted directed arrow</li> <li><code>open</code>: line, undirected arrow</li> <li><code>bold_open</code>: bold line</li> <li><code>dotted_open</code>: dotted line</li> <li><code>invisible</code>: no line</li> <li><code>circle</code>: directed arrow with filled circle arrowhead</li> <li><code>cross</code>: directed arrow with cross arrowhead</li> <li><code>double_normal</code>: bidirectional directed arrow</li> <li><code>double_circle</code>: bidirectional directed arrow with filled circle arrowhead</li> <li><code>double_cross</code>: bidirectional directed arrow with cross arrowhead</li> </ul> <p>Refer to mermaid documentation for more information. Paste the output into any markdown file renderer to view the flowchart, alternatively visit the mermaid playground here.</p> <p>Note</p> <p>Advanced mermaid flowchart functionalities such as subgraphs and interactions (script, click) are not supported.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import tree_to_mermaid\n&gt;&gt;&gt; root = Node(\"a\", node_shape=\"rhombus\")\n&gt;&gt;&gt; b = Node(\"b\", edge_arrow=\"bold\", edge_label=\"Child 1\", parent=root)\n&gt;&gt;&gt; c = Node(\"c\", edge_arrow=\"dotted\", edge_label=\"Child 2\", parent=root)\n&gt;&gt;&gt; d = Node(\"d\", node_style=\"fill:yellow, stroke:black\", parent=b)\n&gt;&gt;&gt; e = Node(\"e\", parent=b)\n&gt;&gt;&gt; graph = tree_to_mermaid(root)\n&gt;&gt;&gt; print(graph)\n```mermaid\n%%{ init: { 'flowchart': { 'curve': 'basis' } } }%%\nflowchart TB\n0(\"a\") --&gt; 0-0(\"b\")\n0-0 --&gt; 0-0-0(\"d\")\n0-0 --&gt; 0-0-1(\"e\")\n0(\"a\") --&gt; 0-1(\"c\")\nclassDef default stroke-width:1\n```\n</code></pre> <p>Customize node shape, edge label, edge arrow, and custom node attributes</p> <pre><code>&gt;&gt;&gt; graph = tree_to_mermaid(root, node_shape_attr=\"node_shape\", edge_label=\"edge_label\", edge_arrow_attr=\"edge_arrow\", node_attr=\"node_style\")\n&gt;&gt;&gt; print(graph)\n```mermaid\n%%{ init: { 'flowchart': { 'curve': 'basis' } } }%%\nflowchart TB\n0{\"a\"} ==&gt;|Child 1| 0-0(\"b\")\n0-0:::class0-0-0 --&gt; 0-0-0(\"d\")\n0-0 --&gt; 0-0-1(\"e\")\n0{\"a\"} -.-&gt;|Child 2| 0-1(\"c\")\nclassDef default stroke-width:1\nclassDef class0-0-0 fill:yellow, stroke:black\n```\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to be exported</p> required <code>title</code> <code>str</code> <p>title, defaults to None</p> <code>''</code> <code>rankdir</code> <code>str</code> <p>layout direction, defaults to 'TB' (top to bottom), can be 'BT' (bottom to top), 'LR' (left to right), 'RL' (right to left)</p> <code>'TB'</code> <code>line_shape</code> <code>str</code> <p>line shape or curvature, defaults to 'basis'</p> <code>'basis'</code> <code>node_colour</code> <code>str</code> <p>fill colour of nodes, can be colour name or hexcode, defaults to None</p> <code>''</code> <code>node_border_colour</code> <code>str</code> <p>border colour of nodes, can be colour name or hexcode, defaults to None</p> <code>''</code> <code>node_border_width</code> <code>float</code> <p>width of node border, defaults to 1</p> <code>1</code> <code>node_shape</code> <code>str</code> <p>node shape, sets the shape of every node, defaults to 'rounded_edge'</p> <code>'rounded_edge'</code> <code>node_shape_attr</code> <code>str | Callable</code> <p>If string type, it refers to <code>Node</code> attribute for node shape. If callable type, it takes in the node itself and returns the node shape. This sets the shape of custom nodes, and overrides default <code>node_shape</code>, defaults to None</p> <code>''</code> <code>edge_arrow</code> <code>str</code> <p>edge arrow style from parent to itself, sets the arrow style of every edge, defaults to 'normal'</p> <code>'normal'</code> <code>edge_arrow_attr</code> <code>str | Callable</code> <p>If string type, it refers to <code>Node</code> attribute for edge arrow style. If callable type, it takes in the node itself and returns the edge arrow style. This sets the edge arrow style of custom nodes from parent to itself, and overrides default <code>edge_arrow</code>, defaults to None</p> <code>''</code> <code>edge_label</code> <code>str</code> <p><code>Node</code> attribute for edge label from parent to itself, defaults to None</p> <code>''</code> <code>node_attr</code> <code>str | Callable</code> <p>If string type, it refers to <code>Node</code> attribute for node style. If callable type, it takes in the node itself and returns the node style. This overrides <code>node_colour</code>, <code>node_border_colour</code>, and <code>node_border_width</code>, defaults to None</p> <code>''</code> <p>Returns:</p> Type Description <code>str</code> <p>(str)</p>"},{"location":"bigtree/tree/helper/","title":"\ud83d\udd27 Helper","text":"<p>Helper functions that can come in handy.</p>"},{"location":"bigtree/tree/helper/#bigtree.tree.helper","title":"bigtree.tree.helper","text":""},{"location":"bigtree/tree/helper/#bigtree.tree.helper.clone_tree","title":"clone_tree","text":"<pre><code>clone_tree(tree, node_type)\n</code></pre> <p>Clone tree to another <code>Node</code> type. If the same type is needed, simply do a tree.copy().</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import BaseNode, Node, clone_tree\n&gt;&gt;&gt; root = BaseNode(name=\"a\")\n&gt;&gt;&gt; b = BaseNode(name=\"b\", parent=root)\n&gt;&gt;&gt; clone_tree(root, Node)\nNode(/a, )\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode</code> <p>tree to be cloned, must inherit from BaseNode</p> required <code>node_type</code> <code>Type[BaseNode]</code> <p>type of cloned tree</p> required <p>Returns:</p> Type Description <code>BaseNodeT</code> <p>(BaseNode)</p>"},{"location":"bigtree/tree/helper/#bigtree.tree.helper.get_subtree","title":"get_subtree","text":"<pre><code>get_subtree(tree, node_name_or_path='', max_depth=0)\n</code></pre> <p>Get subtree based on node name or node path, and/or maximum depth of tree.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, get_subtree\n&gt;&gt;&gt; root = Node(\"a\")\n&gt;&gt;&gt; b = Node(\"b\", parent=root)\n&gt;&gt;&gt; c = Node(\"c\", parent=b)\n&gt;&gt;&gt; d = Node(\"d\", parent=b)\n&gt;&gt;&gt; e = Node(\"e\", parent=root)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 c\n\u2502   \u2514\u2500\u2500 d\n\u2514\u2500\u2500 e\n</code></pre> <p>Get subtree</p> <pre><code>&gt;&gt;&gt; root_subtree = get_subtree(root, \"b\")\n&gt;&gt;&gt; root_subtree.show()\nb\n\u251c\u2500\u2500 c\n\u2514\u2500\u2500 d\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>existing tree</p> required <code>node_name_or_path</code> <code>str</code> <p>node name or path to get subtree, defaults to None</p> <code>''</code> <code>max_depth</code> <code>int</code> <p>maximum depth of subtree, based on <code>depth</code> attribute, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>NodeT</code> <p>(Node)</p>"},{"location":"bigtree/tree/helper/#bigtree.tree.helper.prune_tree","title":"prune_tree","text":"<pre><code>prune_tree(\n    tree, prune_path=\"\", exact=False, sep=\"/\", max_depth=0\n)\n</code></pre> <p>Prune tree by path or depth, returns the root of a copy of the original tree.</p> <p>For pruning by <code>prune_path</code>,</p> <ul> <li>All siblings along the prune path will be removed.</li> <li>If <code>exact=True</code>, all descendants of prune path will be removed.</li> <li>Prune path can be string (only one path) or a list of strings (multiple paths).</li> <li>Prune path name should be unique, can be full path, partial path (trailing part of path), or node name.</li> </ul> <p>For pruning by <code>max_depth</code>,</p> <ul> <li>All nodes that are beyond <code>max_depth</code> will be removed.</li> </ul> <p>Path should contain <code>Node</code> name, separated by <code>sep</code>.</p> <ul> <li>For example: Path string \"a/b\" refers to Node(\"b\") with parent Node(\"a\").</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, prune_tree\n&gt;&gt;&gt; root = Node(\"a\")\n&gt;&gt;&gt; b = Node(\"b\", parent=root)\n&gt;&gt;&gt; c = Node(\"c\", parent=b)\n&gt;&gt;&gt; d = Node(\"d\", parent=b)\n&gt;&gt;&gt; e = Node(\"e\", parent=root)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 c\n\u2502   \u2514\u2500\u2500 d\n\u2514\u2500\u2500 e\n</code></pre> <p>Prune (default is keep descendants)</p> <pre><code>&gt;&gt;&gt; root_pruned = prune_tree(root, \"a/b\")\n&gt;&gt;&gt; root_pruned.show()\na\n\u2514\u2500\u2500 b\n    \u251c\u2500\u2500 c\n    \u2514\u2500\u2500 d\n</code></pre> <p>Prune exact path</p> <pre><code>&gt;&gt;&gt; root_pruned = prune_tree(root, \"a/b\", exact=True)\n&gt;&gt;&gt; root_pruned.show()\na\n\u2514\u2500\u2500 b\n</code></pre> <p>Prune multiple paths</p> <pre><code>&gt;&gt;&gt; root_pruned = prune_tree(root, [\"a/b/d\", \"a/e\"])\n&gt;&gt;&gt; root_pruned.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u2514\u2500\u2500 d\n\u2514\u2500\u2500 e\n</code></pre> <p>Prune by depth</p> <pre><code>&gt;&gt;&gt; root_pruned = prune_tree(root, max_depth=2)\n&gt;&gt;&gt; root_pruned.show()\na\n\u251c\u2500\u2500 b\n\u2514\u2500\u2500 e\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Union[BinaryNode, Node]</code> <p>existing tree</p> required <code>prune_path</code> <code>List[str] | str</code> <p>prune path(s), all siblings along the prune path(s) will be removed</p> <code>''</code> <code>exact</code> <code>bool</code> <p>prune path(s) to be exactly the path, defaults to False (descendants of the path are retained)</p> <code>False</code> <code>sep</code> <code>str</code> <p>path separator of <code>prune_path</code></p> <code>'/'</code> <code>max_depth</code> <code>int</code> <p>maximum depth of pruned tree, based on <code>depth</code> attribute, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>Union[BinaryNodeT, NodeT]</code> <p>(Union[BinaryNode, Node])</p>"},{"location":"bigtree/tree/helper/#bigtree.tree.helper.get_tree_diff","title":"get_tree_diff","text":"<pre><code>get_tree_diff(\n    tree, other_tree, only_diff=True, attr_list=[]\n)\n</code></pre> <p>Get difference of <code>tree</code> to <code>other_tree</code>, changes are relative to <code>tree</code>.</p> <p>Compares the difference in tree structure (default), but can also compare tree attributes using <code>attr_list</code>. Function can return only the differences (default), or all original tree nodes and differences.</p> <p>Comparing tree structure:</p> <ul> <li>(+) and (-) will be added to node name relative to <code>tree</code>.</li> <li>For example: (+) refers to nodes that are in <code>other_tree</code> but not <code>tree</code>.</li> <li>For example: (-) refers to nodes that are in <code>tree</code> but not <code>other_tree</code>.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; # Create original tree\n&gt;&gt;&gt; from bigtree import Node, get_tree_diff, list_to_tree\n&gt;&gt;&gt; root = list_to_tree([\"Downloads/Pictures/photo1.jpg\", \"Downloads/file1.doc\", \"Downloads/photo2.jpg\"])\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u251c\u2500\u2500 file1.doc\n\u2514\u2500\u2500 photo2.jpg\n</code></pre> <pre><code>&gt;&gt;&gt; # Create other tree\n&gt;&gt;&gt; root_other = list_to_tree([\"Downloads/Pictures/photo1.jpg\", \"Downloads/Pictures/photo2.jpg\", \"Downloads/file1.doc\"])\n&gt;&gt;&gt; root_other.show()\nDownloads\n\u251c\u2500\u2500 Pictures\n\u2502   \u251c\u2500\u2500 photo1.jpg\n\u2502   \u2514\u2500\u2500 photo2.jpg\n\u2514\u2500\u2500 file1.doc\n</code></pre> <pre><code>&gt;&gt;&gt; # Get tree differences\n&gt;&gt;&gt; tree_diff = get_tree_diff(root, root_other)\n&gt;&gt;&gt; tree_diff.show()\nDownloads\n\u251c\u2500\u2500 photo2.jpg (-)\n\u2514\u2500\u2500 Pictures\n    \u2514\u2500\u2500 photo2.jpg (+)\n</code></pre> <pre><code>&gt;&gt;&gt; tree_diff = get_tree_diff(root, root_other, only_diff=False)\n&gt;&gt;&gt; tree_diff.show()\nDownloads\n\u251c\u2500\u2500 Pictures\n\u2502   \u251c\u2500\u2500 photo1.jpg\n\u2502   \u2514\u2500\u2500 photo2.jpg (+)\n\u251c\u2500\u2500 file1.doc\n\u2514\u2500\u2500 photo2.jpg (-)\n</code></pre> <p>Comparing tree attributes</p> <ul> <li>(~) will be added to node name if there are differences in tree attributes defined in <code>attr_list</code>.</li> <li>The node's attributes will be a list of [value in <code>tree</code>, value in <code>other_tree</code>]</li> </ul> <pre><code>&gt;&gt;&gt; # Create original tree\n&gt;&gt;&gt; root = Node(\"Downloads\")\n&gt;&gt;&gt; picture_folder = Node(\"Pictures\", parent=root)\n&gt;&gt;&gt; photo2 = Node(\"photo1.jpg\", tags=\"photo1\", parent=picture_folder)\n&gt;&gt;&gt; file1 = Node(\"file1.doc\", tags=\"file1\", parent=root)\n&gt;&gt;&gt; root.show(attr_list=[\"tags\"])\nDownloads\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg [tags=photo1]\n\u2514\u2500\u2500 file1.doc [tags=file1]\n</code></pre> <pre><code>&gt;&gt;&gt; # Create other tree\n&gt;&gt;&gt; root_other = Node(\"Downloads\")\n&gt;&gt;&gt; picture_folder = Node(\"Pictures\", parent=root_other)\n&gt;&gt;&gt; photo1 = Node(\"photo1.jpg\", tags=\"photo1-edited\", parent=picture_folder)\n&gt;&gt;&gt; photo2 = Node(\"photo2.jpg\", tags=\"photo2-new\", parent=picture_folder)\n&gt;&gt;&gt; file1 = Node(\"file1.doc\", tags=\"file1\", parent=root_other)\n&gt;&gt;&gt; root_other.show(attr_list=[\"tags\"])\nDownloads\n\u251c\u2500\u2500 Pictures\n\u2502   \u251c\u2500\u2500 photo1.jpg [tags=photo1-edited]\n\u2502   \u2514\u2500\u2500 photo2.jpg [tags=photo2-new]\n\u2514\u2500\u2500 file1.doc [tags=file1]\n</code></pre> <pre><code>&gt;&gt;&gt; # Get tree differences\n&gt;&gt;&gt; tree_diff = get_tree_diff(root, root_other, attr_list=[\"tags\"])\n&gt;&gt;&gt; tree_diff.show(attr_list=[\"tags\"])\nDownloads\n\u2514\u2500\u2500 Pictures\n    \u251c\u2500\u2500 photo1.jpg (~) [tags=('photo1', 'photo1-edited')]\n    \u2514\u2500\u2500 photo2.jpg (+)\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to be compared against</p> required <code>other_tree</code> <code>Node</code> <p>tree to be compared with</p> required <code>only_diff</code> <code>bool</code> <p>indicator to show all nodes or only nodes that are different (+/-), defaults to True</p> <code>True</code> <code>attr_list</code> <code>List[str]</code> <p>tree attributes to check for difference, defaults to empty list</p> <code>[]</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/modify/","title":"\ud83d\udcdd Modify","text":"<p>There are two types of modification available</p> <ol> <li>Non-replacing scenario: Shift or copy nodes within same tree or between two trees using <code>from_paths</code> (list of paths) and <code>to_paths</code> (list of paths).</li> <li>Replacing scenario: Shift or copy nodes within same tree or between two trees while replacing the to-node using <code>from_paths</code> (list of paths) and <code>to_paths</code> (list of paths).</li> </ol>"},{"location":"bigtree/tree/modify/#available-configurations-for-customization","title":"Available Configurations for Customization","text":"<p>In non-replacing scenario, there are several configurations available for customization.</p> Configuration Description Default Value <code>copy</code> Indicates whether it is to shift the nodes, or copy the nodes False (nodes are shifted, not copied) <code>to_tree</code> Indicates whether shifting/copying is within the same tree, or between different trees None (nodes are shifted/copied within the same tree) <code>skippable</code> Skip shifting/copying of nodes if from_path cannot be found False (from-node must be found) <code>overriding</code> Override existing node if it exists False (to-node must not exist) <code>merge_children</code> Shift/copy children of from-node and remove intermediate parent node False (children are not merged) <code>merge_leaves</code> Shift/copy leaves of from-node and remove all intermediate nodes False (leaves are not merged) <code>delete_children</code> Shift/copy node only and delete its children False (nodes are shifted/copied together with children) <p>In replacing scenario, all the configurations are also available except <code>overriding</code>, <code>merge_children</code>, and <code>merge_leaves</code> as it is doing a one-to-one replacement. It is by default overriding, and there is nothing to merge.</p> <p>Note</p> <p><code>merge_children</code> and <code>merge_leaves</code> cannot be simultaneously set to <code>True</code>.</p> <p>Note</p> <p>Error will always be thrown if multiple from-nodes are found, paths in <code>from_paths</code> must be unique.</p>"},{"location":"bigtree/tree/modify/#tree-modification-permutations","title":"Tree Modification Permutations","text":"<p>There are several ways you can mix and match the tree modification methods. If you know all the parameters to choose, feel free to use <code>copy_or_shift_logic</code> or <code>replace_logic</code> methods as they are the most customizable. All other methods calls these 2 methods directly.</p> Shift / Copy? Same tree / Between two trees? Replace destination node? Method to use Shift Same tree No <code>shift_nodes</code> Copy Same tree No <code>copy_nodes</code> Copy Between two trees No <code>copy_nodes_from_tree_to_tree</code> Any Any No <code>copy_or_shift_logic</code> Shift Same tree Yes <code>shift_and_replace_nodes</code> Copy Between two trees Yes <code>copy_and_replace_nodes_from_tree_to_tree</code> Any Any Yes <code>replace_logic</code>"},{"location":"bigtree/tree/modify/#tree-modification-illustration","title":"Tree Modification Illustration","text":""},{"location":"bigtree/tree/modify/#sample-tree-modification-shift-copy-delete","title":"Sample Tree Modification (Shift, Copy, Delete)","text":"Setting Sample path in <code>from_paths</code> Sample path in <code>to_paths</code> Description Default \"/a/c\" \"/a/b/c\" Shift/copy node <code>c</code> Default \"/c\" \"/a/b/c\" Shift/copy node <code>c</code> Default \"c\" \"/a/b/c\" Shift/copy node <code>c</code> Default \"/a/e\" None Delete node <code>e</code> skippable \"/a/c\" \"/a/b/c\" Shift/copy node <code>c</code>, skip if \"/a/c\" cannot be found"},{"location":"bigtree/tree/modify/#sample-tree-modification-advanced","title":"Sample Tree Modification (Advanced)","text":"Setting Sample path in <code>from_paths</code> Sample path in <code>to_paths</code> Description overriding \"a/b/c\" \"a/d/c\" Shift/copy node <code>c</code>, override if \"a/d/c\" exists merge_children \"a/b/c\" \"a/d/c\" If path not present: Shift/copy children of node <code>c</code> to be children of node <code>d</code>, removing node <code>c</code>If path present: Shift/copy children of node <code>c</code> to be merged with existing \"a/d/c\" children merge_children + overriding \"a/b/c\" \"a/d/c\" If path not present: Behaves like merge_childrenIf path present: Behaves like overriding merge_leaves \"a/b/c\" \"a/d/c\" If path not present: Shift/copy leaves of node <code>c</code> to be children of node <code>d</code>If path present: Shift/copy leaves of node <code>c</code> to be merged with existing \"a/d/c\" children - merge_leaves + overriding \"a/b/c\" \"a/d/c\" If path not present: Behaves like merge_leavesIf path present: Behaves like overriding, but original node <code>c</code> remains delete_children \"a/b\" \"a/d/b\" Shift/copy node <code>b</code> only without any node <code>b</code> children"},{"location":"bigtree/tree/modify/#bigtree.tree.modify","title":"bigtree.tree.modify","text":""},{"location":"bigtree/tree/modify/#bigtree.tree.modify.shift_nodes","title":"shift_nodes","text":"<pre><code>shift_nodes(\n    tree,\n    from_paths,\n    to_paths,\n    sep=\"/\",\n    skippable=False,\n    overriding=False,\n    merge_children=False,\n    merge_leaves=False,\n    delete_children=False,\n    with_full_path=False,\n)\n</code></pre> <p>Shift nodes from <code>from_paths</code> to <code>to_paths</code> in-place.</p> <ul> <li>Creates intermediate nodes if to path is not present</li> <li>Able to skip nodes if from path is not found, defaults to False (from-nodes must be found; not skippable).</li> <li>Able to override existing node if it exists, defaults to False (to-nodes must not exist; not overridden).</li> <li>Able to merge children and remove intermediate parent node, defaults to False (nodes are shifted; not merged).</li> <li>Able to merge only leaf nodes and remove all intermediate nodes, defaults to False (nodes are shifted; not merged)</li> <li>Able to shift node only and delete children, defaults to False (nodes are shifted together with children).</li> </ul> <p>For paths in <code>from_paths</code> and <code>to_paths</code>,</p> <ul> <li>Path name can be with or without leading tree path separator symbol.</li> </ul> <p>For paths in <code>from_paths</code>,</p> <ul> <li>Path name can be partial path (trailing part of path) or node name.</li> <li>If <code>with_full_path=True</code>, path name must be full path.</li> <li>Path name must be unique to one node.</li> </ul> <p>For paths in <code>to_paths</code>,</p> <ul> <li>Path name must be full path.</li> <li>Can set to empty string or None to delete the path in <code>from_paths</code>, note that <code>copy</code> must be set to False.</li> </ul> <p>If <code>merge_children=True</code>,</p> <ul> <li>If <code>to_path</code> is not present, it shifts children of <code>from_path</code>.</li> <li>If <code>to_path</code> is present, and <code>overriding=False</code>, original and new children are merged.</li> <li>If <code>to_path</code> is present and <code>overriding=True</code>, it behaves like overriding and only new children are retained.</li> </ul> <p>If <code>merge_leaves=True</code>,</p> <ul> <li>If <code>to_path</code> is not present, it shifts leaves of <code>from_path</code>.</li> <li>If <code>to_path</code> is present, and <code>overriding=False</code>, original children and leaves are merged.</li> <li>If <code>to_path</code> is present and <code>overriding=True</code>, it behaves like overriding and only new leaves are retained,     original non-leaf nodes in <code>from_path</code> are retained.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import list_to_tree, str_to_tree, shift_nodes\n&gt;&gt;&gt; root = list_to_tree([\"Downloads/photo1.jpg\", \"Downloads/file1.doc\"])\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 file1.doc\n</code></pre> <pre><code>&gt;&gt;&gt; shift_nodes(\n...     tree=root,\n...     from_paths=[\"Downloads/photo1.jpg\", \"Downloads/file1.doc\"],\n...     to_paths=[\"Downloads/Pictures/photo1.jpg\", \"Downloads/Files/file1.doc\"],\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Files\n    \u2514\u2500\u2500 file1.doc\n</code></pre> <p>To delete node,</p> <pre><code>&gt;&gt;&gt; root = list_to_tree([\"Downloads/photo1.jpg\", \"Downloads/file1.doc\"])\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 file1.doc\n</code></pre> <pre><code>&gt;&gt;&gt; shift_nodes(root, [\"Downloads/photo1.jpg\"], [None])\n&gt;&gt;&gt; root.show()\nDownloads\n\u2514\u2500\u2500 file1.doc\n</code></pre> <p>In overriding case,</p> <pre><code>&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 Misc\\n\"\n... \"\u2502   \u2514\u2500\u2500 Pictures\\n\"\n... \"\u2502       \u2514\u2500\u2500 photo1.jpg\\n\"\n... \"\u2514\u2500\u2500 Pictures\\n\"\n... \"    \u2514\u2500\u2500 photo2.jpg\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u2514\u2500\u2500 Pictures\n\u2502       \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Pictures\n    \u2514\u2500\u2500 photo2.jpg\n</code></pre> <pre><code>&gt;&gt;&gt; shift_nodes(root, [\"Downloads/Misc/Pictures\"], [\"Downloads/Pictures\"], overriding=True)\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2514\u2500\u2500 Pictures\n    \u2514\u2500\u2500 photo1.jpg\n</code></pre> <p>In <code>merge_children=True</code> case, child nodes are shifted instead of the parent node.</p> <ul> <li>If the path already exists, child nodes are merged with existing children.</li> <li>If same node is shifted, the child nodes of the node are merged with the node's parent.</li> </ul> <pre><code>&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 Misc\\n\"\n... \"\u2502   \u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2502   \u2514\u2500\u2500 photo2.jpg\\n\"\n... \"\u2502   \u2514\u2500\u2500 Applications\\n\"\n... \"\u2502       \u2514\u2500\u2500 Chrome.exe\\n\"\n... \"\u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2514\u2500\u2500 photo1.jpg\\n\"\n... \"\u2514\u2500\u2500 dummy\\n\"\n... \"    \u2514\u2500\u2500 Files\\n\"\n... \"        \u2514\u2500\u2500 file1.doc\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u251c\u2500\u2500 Pictures\n\u2502   \u2502   \u2514\u2500\u2500 photo2.jpg\n\u2502   \u2514\u2500\u2500 Applications\n\u2502       \u2514\u2500\u2500 Chrome.exe\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 dummy\n    \u2514\u2500\u2500 Files\n        \u2514\u2500\u2500 file1.doc\n</code></pre> <pre><code>&gt;&gt;&gt; shift_nodes(\n...     root,\n...     [\"Downloads/Misc/Pictures\", \"Applications\", \"Downloads/dummy\"],\n...     [\"Downloads/Pictures\", \"Downloads/Applications\", \"Downloads/dummy\"],\n...     merge_children=True,\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u251c\u2500\u2500 Pictures\n\u2502   \u251c\u2500\u2500 photo1.jpg\n\u2502   \u2514\u2500\u2500 photo2.jpg\n\u251c\u2500\u2500 Chrome.exe\n\u2514\u2500\u2500 Files\n    \u2514\u2500\u2500 file1.doc\n</code></pre> <p>In <code>merge_leaves=True</code> case, leaf nodes are copied instead of the parent node.</p> <ul> <li>If the path already exists, leaf nodes are merged with existing children.</li> <li>If same node is copied, the leaf nodes of the node are merged with the node's parent.</li> </ul> <pre><code>&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 Misc\\n\"\n... \"\u2502   \u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2502   \u2514\u2500\u2500 photo2.jpg\\n\"\n... \"\u2502   \u2514\u2500\u2500 Applications\\n\"\n... \"\u2502       \u2514\u2500\u2500 Chrome.exe\\n\"\n... \"\u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2514\u2500\u2500 photo1.jpg\\n\"\n... \"\u2514\u2500\u2500 dummy\\n\"\n... \"    \u2514\u2500\u2500 Files\\n\"\n... \"        \u2514\u2500\u2500 file1.doc\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u251c\u2500\u2500 Pictures\n\u2502   \u2502   \u2514\u2500\u2500 photo2.jpg\n\u2502   \u2514\u2500\u2500 Applications\n\u2502       \u2514\u2500\u2500 Chrome.exe\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 dummy\n    \u2514\u2500\u2500 Files\n        \u2514\u2500\u2500 file1.doc\n</code></pre> <pre><code>&gt;&gt;&gt; shift_nodes(\n...     root,\n...     [\"Downloads/Misc/Pictures\", \"Applications\", \"Downloads/dummy\"],\n...     [\"Downloads/Pictures\", \"Downloads/Applications\", \"Downloads/dummy\"],\n...     merge_leaves=True,\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 Applications\n\u251c\u2500\u2500 Pictures\n\u2502   \u251c\u2500\u2500 photo1.jpg\n\u2502   \u2514\u2500\u2500 photo2.jpg\n\u251c\u2500\u2500 dummy\n\u2502   \u2514\u2500\u2500 Files\n\u251c\u2500\u2500 Chrome.exe\n\u2514\u2500\u2500 file1.doc\n</code></pre> <p>In <code>delete_children=True</code> case, only the node is shifted without its accompanying children/descendants.</p> <pre><code>&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 Misc\\n\"\n... \"\u2502   \u2514\u2500\u2500 Applications\\n\"\n... \"\u2502       \u2514\u2500\u2500 Chrome.exe\\n\"\n... \"\u2514\u2500\u2500 Pictures\\n\"\n... \"    \u2514\u2500\u2500 photo1.jpg\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u2514\u2500\u2500 Applications\n\u2502       \u2514\u2500\u2500 Chrome.exe\n\u2514\u2500\u2500 Pictures\n    \u2514\u2500\u2500 photo1.jpg\n</code></pre> <pre><code>&gt;&gt;&gt; shift_nodes(root, [\"Applications\"], [\"Downloads/Applications\"], delete_children=True)\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Applications\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to modify</p> required <code>from_paths</code> <code>List[str]</code> <p>original paths to shift nodes from</p> required <code>to_paths</code> <code>List[str]</code> <p>new paths to shift nodes to</p> required <code>sep</code> <code>str</code> <p>path separator for input paths, applies to <code>from_path</code> and <code>to_path</code></p> <code>'/'</code> <code>skippable</code> <code>bool</code> <p>indicator to skip if from path is not found, defaults to False</p> <code>False</code> <code>overriding</code> <code>bool</code> <p>indicator to override existing to path if there is clashes, defaults to False</p> <code>False</code> <code>merge_children</code> <code>bool</code> <p>indicator to merge children and remove intermediate parent node, defaults to False</p> <code>False</code> <code>merge_leaves</code> <code>bool</code> <p>indicator to merge leaf nodes and remove intermediate parent node(s), defaults to False</p> <code>False</code> <code>delete_children</code> <code>bool</code> <p>indicator to shift node only without children, defaults to False</p> <code>False</code> <code>with_full_path</code> <code>bool</code> <p>indicator to shift/copy node with full path in <code>from_paths</code>, results in faster search, defaults to False</p> <code>False</code>"},{"location":"bigtree/tree/modify/#bigtree.tree.modify.copy_nodes","title":"copy_nodes","text":"<pre><code>copy_nodes(\n    tree,\n    from_paths,\n    to_paths,\n    sep=\"/\",\n    skippable=False,\n    overriding=False,\n    merge_children=False,\n    merge_leaves=False,\n    delete_children=False,\n    with_full_path=False,\n)\n</code></pre> <p>Copy nodes from <code>from_paths</code> to <code>to_paths</code> in-place.</p> <ul> <li>Creates intermediate nodes if to path is not present</li> <li>Able to skip nodes if from path is not found, defaults to False (from-nodes must be found; not skippable).</li> <li>Able to override existing node if it exists, defaults to False (to-nodes must not exist; not overridden).</li> <li>Able to merge children and remove intermediate parent node, defaults to False (nodes are shifted; not merged).</li> <li>Able to merge only leaf nodes and remove all intermediate nodes, defaults to False (nodes are shifted; not merged)</li> <li>Able to copy node only and delete children, defaults to False (nodes are copied together with children).</li> </ul> <p>For paths in <code>from_paths</code> and <code>to_paths</code>,</p> <ul> <li>Path name can be with or without leading tree path separator symbol.</li> </ul> <p>For paths in <code>from_paths</code>,</p> <ul> <li>Path name can be partial path (trailing part of path) or node name.</li> <li>If <code>with_full_path=True</code>, path name must be full path.</li> <li>Path name must be unique to one node.</li> </ul> <p>For paths in <code>to_paths</code>,</p> <ul> <li>Path name must be full path.</li> </ul> <p>If <code>merge_children=True</code>,</p> <ul> <li>If <code>to_path</code> is not present, it copies children of <code>from_path</code>.</li> <li>If <code>to_path</code> is present, and <code>overriding=False</code>, original and new children are merged.</li> <li>If <code>to_path</code> is present and <code>overriding=True</code>, it behaves like overriding and only new children are retained.</li> </ul> <p>If <code>merge_leaves=True</code>,</p> <ul> <li>If <code>to_path</code> is not present, it copies leaves of <code>from_path</code>.</li> <li>If <code>to_path</code> is present, and <code>overriding=False</code>, original children and leaves are merged.</li> <li>If <code>to_path</code> is present and <code>overriding=True</code>, it behaves like overriding and only new leaves are retained.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import list_to_tree, str_to_tree, copy_nodes\n&gt;&gt;&gt; root = list_to_tree([\"Downloads/Pictures\", \"Downloads/photo1.jpg\", \"Downloads/file1.doc\"])\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Pictures\n\u251c\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 file1.doc\n</code></pre> <pre><code>&gt;&gt;&gt; copy_nodes(\n...     tree=root,\n...     from_paths=[\"Downloads/photo1.jpg\", \"Downloads/file1.doc\"],\n...     to_paths=[\"Downloads/Pictures/photo1.jpg\", \"Downloads/Files/file1.doc\"],\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u251c\u2500\u2500 photo1.jpg\n\u251c\u2500\u2500 file1.doc\n\u2514\u2500\u2500 Files\n    \u2514\u2500\u2500 file1.doc\n</code></pre> <p>In overriding case,</p> <pre><code>&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 Misc\\n\"\n... \"\u2502   \u2514\u2500\u2500 Pictures\\n\"\n... \"\u2502       \u2514\u2500\u2500 photo1.jpg\\n\"\n... \"\u2514\u2500\u2500 Pictures\\n\"\n... \"    \u2514\u2500\u2500 photo2.jpg\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u2514\u2500\u2500 Pictures\n\u2502       \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Pictures\n    \u2514\u2500\u2500 photo2.jpg\n</code></pre> <pre><code>&gt;&gt;&gt; copy_nodes(root, [\"Downloads/Misc/Pictures\"], [\"Downloads/Pictures\"], overriding=True)\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u2514\u2500\u2500 Pictures\n\u2502       \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Pictures\n    \u2514\u2500\u2500 photo1.jpg\n</code></pre> <p>In <code>merge_children=True</code> case, child nodes are copied instead of the parent node.</p> <ul> <li>If the path already exists, child nodes are merged with existing children.</li> <li>If same node is copied, the child nodes of the node are merged with the node's parent.</li> </ul> <pre><code>&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 Misc\\n\"\n... \"\u2502   \u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2502   \u2514\u2500\u2500 photo2.jpg\\n\"\n... \"\u2502   \u2514\u2500\u2500 Applications\\n\"\n... \"\u2502       \u2514\u2500\u2500 Chrome.exe\\n\"\n... \"\u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2514\u2500\u2500 photo1.jpg\\n\"\n... \"\u2514\u2500\u2500 dummy\\n\"\n... \"    \u2514\u2500\u2500 Files\\n\"\n... \"        \u2514\u2500\u2500 file1.doc\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u251c\u2500\u2500 Pictures\n\u2502   \u2502   \u2514\u2500\u2500 photo2.jpg\n\u2502   \u2514\u2500\u2500 Applications\n\u2502       \u2514\u2500\u2500 Chrome.exe\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 dummy\n    \u2514\u2500\u2500 Files\n        \u2514\u2500\u2500 file1.doc\n</code></pre> <pre><code>&gt;&gt;&gt; copy_nodes(\n...     root,\n...     [\"Downloads/Misc/Pictures\", \"Applications\", \"Downloads/dummy\"],\n...     [\"Downloads/Pictures\", \"Downloads/Applications\", \"Downloads/dummy\"],\n...     merge_children=True,\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u251c\u2500\u2500 Pictures\n\u2502   \u2502   \u2514\u2500\u2500 photo2.jpg\n\u2502   \u2514\u2500\u2500 Applications\n\u2502       \u2514\u2500\u2500 Chrome.exe\n\u251c\u2500\u2500 Pictures\n\u2502   \u251c\u2500\u2500 photo1.jpg\n\u2502   \u2514\u2500\u2500 photo2.jpg\n\u251c\u2500\u2500 Chrome.exe\n\u2514\u2500\u2500 Files\n    \u2514\u2500\u2500 file1.doc\n</code></pre> <p>In <code>merge_leaves=True</code> case, leaf nodes are copied instead of the parent node.</p> <ul> <li>If the path already exists, leaf nodes are merged with existing children.</li> <li>If same node is copied, the leaf nodes of the node are merged with the node's parent.</li> </ul> <pre><code>&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 Misc\\n\"\n... \"\u2502   \u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2502   \u2514\u2500\u2500 photo2.jpg\\n\"\n... \"\u2502   \u2514\u2500\u2500 Applications\\n\"\n... \"\u2502       \u2514\u2500\u2500 Chrome.exe\\n\"\n... \"\u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2514\u2500\u2500 photo1.jpg\\n\"\n... \"\u2514\u2500\u2500 dummy\\n\"\n... \"    \u2514\u2500\u2500 Files\\n\"\n... \"        \u2514\u2500\u2500 file1.doc\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u251c\u2500\u2500 Pictures\n\u2502   \u2502   \u2514\u2500\u2500 photo2.jpg\n\u2502   \u2514\u2500\u2500 Applications\n\u2502       \u2514\u2500\u2500 Chrome.exe\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 dummy\n    \u2514\u2500\u2500 Files\n        \u2514\u2500\u2500 file1.doc\n</code></pre> <pre><code>&gt;&gt;&gt; copy_nodes(\n...     root,\n...     [\"Downloads/Misc/Pictures\", \"Applications\", \"Downloads/dummy\"],\n...     [\"Downloads/Pictures\", \"Downloads/Applications\", \"Downloads/dummy\"],\n...     merge_leaves=True,\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u251c\u2500\u2500 Pictures\n\u2502   \u2502   \u2514\u2500\u2500 photo2.jpg\n\u2502   \u2514\u2500\u2500 Applications\n\u2502       \u2514\u2500\u2500 Chrome.exe\n\u251c\u2500\u2500 Pictures\n\u2502   \u251c\u2500\u2500 photo1.jpg\n\u2502   \u2514\u2500\u2500 photo2.jpg\n\u251c\u2500\u2500 dummy\n\u2502   \u2514\u2500\u2500 Files\n\u2502       \u2514\u2500\u2500 file1.doc\n\u251c\u2500\u2500 Chrome.exe\n\u2514\u2500\u2500 file1.doc\n</code></pre> <p>In <code>delete_children=True</code> case, only the node is copied without its accompanying children/descendants.</p> <pre><code>&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 Misc\\n\"\n... \"\u2502   \u2514\u2500\u2500 Applications\\n\"\n... \"\u2502       \u2514\u2500\u2500 Chrome.exe\\n\"\n... \"\u2514\u2500\u2500 Pictures\\n\"\n... \"    \u2514\u2500\u2500 photo1.jpg\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u2514\u2500\u2500 Applications\n\u2502       \u2514\u2500\u2500 Chrome.exe\n\u2514\u2500\u2500 Pictures\n    \u2514\u2500\u2500 photo1.jpg\n</code></pre> <pre><code>&gt;&gt;&gt; copy_nodes(root, [\"Applications\"], [\"Downloads/Applications\"], delete_children=True)\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u2514\u2500\u2500 Applications\n\u2502       \u2514\u2500\u2500 Chrome.exe\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Applications\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to modify</p> required <code>from_paths</code> <code>List[str]</code> <p>original paths to shift nodes from</p> required <code>to_paths</code> <code>List[str]</code> <p>new paths to shift nodes to</p> required <code>sep</code> <code>str</code> <p>path separator for input paths, applies to <code>from_path</code> and <code>to_path</code></p> <code>'/'</code> <code>skippable</code> <code>bool</code> <p>indicator to skip if from path is not found, defaults to False</p> <code>False</code> <code>overriding</code> <code>bool</code> <p>indicator to override existing to path if there is clashes, defaults to False</p> <code>False</code> <code>merge_children</code> <code>bool</code> <p>indicator to merge children and remove intermediate parent node, defaults to False</p> <code>False</code> <code>merge_leaves</code> <code>bool</code> <p>indicator to merge leaf nodes and remove intermediate parent node(s), defaults to False</p> <code>False</code> <code>delete_children</code> <code>bool</code> <p>indicator to copy node only without children, defaults to False</p> <code>False</code> <code>with_full_path</code> <code>bool</code> <p>indicator to shift/copy node with full path in <code>from_paths</code>, results in faster search, defaults to False</p> <code>False</code>"},{"location":"bigtree/tree/modify/#bigtree.tree.modify.shift_and_replace_nodes","title":"shift_and_replace_nodes","text":"<pre><code>shift_and_replace_nodes(\n    tree,\n    from_paths,\n    to_paths,\n    sep=\"/\",\n    skippable=False,\n    delete_children=False,\n    with_full_path=False,\n)\n</code></pre> <p>Shift nodes from <code>from_paths</code> to replace <code>to_paths</code> in-place.</p> <ul> <li>Creates intermediate nodes if to path is not present</li> <li>Able to skip nodes if from path is not found, defaults to False (from-nodes must be found; not skippable).</li> <li>Able to shift node only and delete children, defaults to False (nodes are shifted together with children).</li> </ul> <p>For paths in <code>from_paths</code> and <code>to_paths</code>,</p> <ul> <li>Path name can be with or without leading tree path separator symbol.</li> </ul> <p>For paths in <code>from_paths</code>,</p> <ul> <li>Path name can be partial path (trailing part of path) or node name.</li> <li>If <code>with_full_path=True</code>, path name must be full path.</li> <li>Path name must be unique to one node.</li> </ul> <p>For paths in <code>to_paths</code>,</p> <ul> <li>Path name must be full path.</li> <li>Path must exist, node-to-be-replaced must be present.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import str_to_tree, shift_and_replace_nodes\n&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2514\u2500\u2500 photo1.jpg\\n\"\n... \"\u2514\u2500\u2500 Misc\\n\"\n... \"    \u2514\u2500\u2500 dummy\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Misc\n    \u2514\u2500\u2500 dummy\n</code></pre> <pre><code>&gt;&gt;&gt; shift_and_replace_nodes(root, [\"Downloads/Pictures\"], [\"Downloads/Misc/dummy\"])\n&gt;&gt;&gt; root.show()\nDownloads\n\u2514\u2500\u2500 Misc\n    \u2514\u2500\u2500 Pictures\n        \u2514\u2500\u2500 photo1.jpg\n</code></pre> <p>In <code>delete_children=True</code> case, only the node is shifted without its accompanying children/descendants.</p> <pre><code>&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2514\u2500\u2500 photo1.jpg\\n\"\n... \"\u2514\u2500\u2500 Misc\\n\"\n... \"    \u2514\u2500\u2500 dummy\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Misc\n    \u2514\u2500\u2500 dummy\n</code></pre> <pre><code>&gt;&gt;&gt; shift_and_replace_nodes(root, [\"Downloads/Pictures\"], [\"Downloads/Misc/dummy\"], delete_children=True)\n&gt;&gt;&gt; root.show()\nDownloads\n\u2514\u2500\u2500 Misc\n    \u2514\u2500\u2500 Pictures\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to modify</p> required <code>from_paths</code> <code>List[str]</code> <p>original paths to shift nodes from</p> required <code>to_paths</code> <code>List[str]</code> <p>new paths to shift nodes to</p> required <code>sep</code> <code>str</code> <p>path separator for input paths, applies to <code>from_path</code> and <code>to_path</code></p> <code>'/'</code> <code>skippable</code> <code>bool</code> <p>indicator to skip if from path is not found, defaults to False</p> <code>False</code> <code>delete_children</code> <code>bool</code> <p>indicator to shift node only without children, defaults to False</p> <code>False</code> <code>with_full_path</code> <code>bool</code> <p>indicator to shift/copy node with full path in <code>from_paths</code>, results in faster search, defaults to False</p> <code>False</code>"},{"location":"bigtree/tree/modify/#bigtree.tree.modify.copy_nodes_from_tree_to_tree","title":"copy_nodes_from_tree_to_tree","text":"<pre><code>copy_nodes_from_tree_to_tree(\n    from_tree,\n    to_tree,\n    from_paths,\n    to_paths,\n    sep=\"/\",\n    skippable=False,\n    overriding=False,\n    merge_children=False,\n    merge_leaves=False,\n    delete_children=False,\n    with_full_path=False,\n)\n</code></pre> <p>Copy nodes from <code>from_paths</code> to <code>to_paths</code> in-place.</p> <ul> <li>Creates intermediate nodes if to path is not present</li> <li>Able to skip nodes if from path is not found, defaults to False (from-nodes must be found; not skippable).</li> <li>Able to override existing node if it exists, defaults to False (to-nodes must not exist; not overridden).</li> <li>Able to merge children and remove intermediate parent node, defaults to False (nodes are shifted; not merged).</li> <li>Able to merge only leaf nodes and remove all intermediate nodes, defaults to False (nodes are shifted; not merged)</li> <li>Able to copy node only and delete children, defaults to False (nodes are copied together with children).</li> </ul> <p>For paths in <code>from_paths</code> and <code>to_paths</code>,</p> <ul> <li>Path name can be with or without leading tree path separator symbol.</li> </ul> <p>For paths in <code>from_paths</code>,</p> <ul> <li>Path name can be partial path (trailing part of path) or node name.</li> <li>If <code>with_full_path=True</code>, path name must be full path.</li> <li>Path name must be unique to one node.</li> </ul> <p>For paths in <code>to_paths</code>,</p> <ul> <li>Path name must be full path.</li> </ul> <p>If <code>merge_children=True</code>,</p> <ul> <li>If <code>to_path</code> is not present, it copies children of <code>from_path</code></li> <li>If <code>to_path</code> is present, and <code>overriding=False</code>, original and new children are merged</li> <li>If <code>to_path</code> is present and <code>overriding=True</code>, it behaves like overriding and only new leaves are retained.</li> </ul> <p>If <code>merge_leaves=True</code>,</p> <ul> <li>If <code>to_path</code> is not present, it copies leaves of <code>from_path</code>.</li> <li>If <code>to_path</code> is present, and <code>overriding=False</code>, original children and leaves are merged.</li> <li>If <code>to_path</code> is present and <code>overriding=True</code>, it behaves like overriding and only new leaves are retained.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, str_to_tree, copy_nodes_from_tree_to_tree\n&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 file1.doc\\n\"\n... \"\u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2514\u2500\u2500 photo1.jpg\\n\"\n... \"\u2514\u2500\u2500 Misc\\n\"\n... \"    \u2514\u2500\u2500 dummy\\n\"\n... \"        \u2514\u2500\u2500 photo2.jpg\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 file1.doc\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Misc\n    \u2514\u2500\u2500 dummy\n        \u2514\u2500\u2500 photo2.jpg\n</code></pre> <pre><code>&gt;&gt;&gt; root_other = Node(\"Documents\")\n&gt;&gt;&gt; copy_nodes_from_tree_to_tree(\n...     from_tree=root,\n...     to_tree=root_other,\n...     from_paths=[\"Downloads/Pictures\", \"Downloads/Misc\"],\n...     to_paths=[\"Documents/Pictures\", \"Documents/New Misc/Misc\"],\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 New Misc\n    \u2514\u2500\u2500 Misc\n        \u2514\u2500\u2500 dummy\n            \u2514\u2500\u2500 photo2.jpg\n</code></pre> <p>In overriding case,</p> <pre><code>&gt;&gt;&gt; root_other = str_to_tree(\n... \"Documents\\n\"\n... \"\u2514\u2500\u2500 Pictures\\n\"\n... \"    \u2514\u2500\u2500 photo3.jpg\"\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u2514\u2500\u2500 Pictures\n    \u2514\u2500\u2500 photo3.jpg\n</code></pre> <pre><code>&gt;&gt;&gt; copy_nodes_from_tree_to_tree(\n...     root,\n...     root_other,\n...     [\"Downloads/Pictures\", \"Downloads/Misc\"],\n...     [\"Documents/Pictures\", \"Documents/Misc\"],\n...     overriding=True,\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Misc\n    \u2514\u2500\u2500 dummy\n        \u2514\u2500\u2500 photo2.jpg\n</code></pre> <p>In <code>merge_children=True</code> case, child nodes are copied instead of the parent node.</p> <ul> <li>If the path already exists, child nodes are merged with existing children.</li> </ul> <pre><code>&gt;&gt;&gt; root_other = str_to_tree(\n... \"Documents\\n\"\n... \"\u2514\u2500\u2500 Pictures\\n\"\n... \"    \u2514\u2500\u2500 photo3.jpg\"\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u2514\u2500\u2500 Pictures\n    \u2514\u2500\u2500 photo3.jpg\n</code></pre> <pre><code>&gt;&gt;&gt; copy_nodes_from_tree_to_tree(\n...     root,\n...     root_other,\n...     [\"Downloads/Pictures\", \"Downloads/Misc\"],\n...     [\"Documents/Pictures\", \"Documents/Misc\"],\n...     merge_children=True,\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u251c\u2500\u2500 Pictures\n\u2502   \u251c\u2500\u2500 photo3.jpg\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 dummy\n    \u2514\u2500\u2500 photo2.jpg\n</code></pre> <p>In <code>merge_leaves=True</code> case, leaf nodes are copied instead of the parent node.</p> <ul> <li>If the path already exists, leaf nodes are merged with existing children.</li> </ul> <pre><code>&gt;&gt;&gt; root_other = str_to_tree(\n... \"Documents\\n\"\n... \"\u2514\u2500\u2500 Pictures\\n\"\n... \"    \u2514\u2500\u2500 photo3.jpg\"\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u2514\u2500\u2500 Pictures\n    \u2514\u2500\u2500 photo3.jpg\n</code></pre> <pre><code>&gt;&gt;&gt; copy_nodes_from_tree_to_tree(\n...     root,\n...     root_other,\n...     [\"Downloads/Pictures\", \"Downloads/Misc\"],\n...     [\"Documents/Pictures\", \"Documents/Misc\"],\n...     merge_leaves=True,\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u251c\u2500\u2500 Pictures\n\u2502   \u251c\u2500\u2500 photo3.jpg\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 photo2.jpg\n</code></pre> <p>In <code>delete_children=True</code> case, only the node is copied without its accompanying children/descendants.</p> <pre><code>&gt;&gt;&gt; root_other = Node(\"Documents\")\n&gt;&gt;&gt; root_other.show()\nDocuments\n</code></pre> <pre><code>&gt;&gt;&gt; copy_nodes_from_tree_to_tree(\n...     root,\n...     root_other,\n...     [\"Downloads/Pictures\", \"Downloads/Misc\"],\n...     [\"Documents/Pictures\", \"Documents/Misc\"],\n...     delete_children=True,\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u251c\u2500\u2500 Pictures\n\u2514\u2500\u2500 Misc\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>from_tree</code> <code>Node</code> <p>tree to copy nodes from</p> required <code>to_tree</code> <code>Node</code> <p>tree to copy nodes to</p> required <code>from_paths</code> <code>List[str]</code> <p>original paths to shift nodes from</p> required <code>to_paths</code> <code>List[str]</code> <p>new paths to shift nodes to</p> required <code>sep</code> <code>str</code> <p>path separator for input paths, applies to <code>from_path</code> and <code>to_path</code></p> <code>'/'</code> <code>skippable</code> <code>bool</code> <p>indicator to skip if from path is not found, defaults to False</p> <code>False</code> <code>overriding</code> <code>bool</code> <p>indicator to override existing to path if there is clashes, defaults to False</p> <code>False</code> <code>merge_children</code> <code>bool</code> <p>indicator to merge children and remove intermediate parent node, defaults to False</p> <code>False</code> <code>merge_leaves</code> <code>bool</code> <p>indicator to merge leaf nodes and remove intermediate parent node(s), defaults to False</p> <code>False</code> <code>delete_children</code> <code>bool</code> <p>indicator to copy node only without children, defaults to False</p> <code>False</code> <code>with_full_path</code> <code>bool</code> <p>indicator to shift/copy node with full path in <code>from_paths</code>, results in faster search, defaults to False</p> <code>False</code>"},{"location":"bigtree/tree/modify/#bigtree.tree.modify.copy_and_replace_nodes_from_tree_to_tree","title":"copy_and_replace_nodes_from_tree_to_tree","text":"<pre><code>copy_and_replace_nodes_from_tree_to_tree(\n    from_tree,\n    to_tree,\n    from_paths,\n    to_paths,\n    sep=\"/\",\n    skippable=False,\n    delete_children=False,\n    with_full_path=False,\n)\n</code></pre> <p>Copy nodes from <code>from_paths</code> to replace <code>to_paths</code> in-place.</p> <ul> <li>Creates intermediate nodes if to path is not present</li> <li>Able to skip nodes if from path is not found, defaults to False (from-nodes must be found; not skippable).</li> <li>Able to copy node only and delete children, defaults to False (nodes are copied together with children).</li> </ul> <p>For paths in <code>from_paths</code> and <code>to_paths</code>,</p> <ul> <li>Path name can be with or without leading tree path separator symbol.</li> </ul> <p>For paths in <code>from_paths</code>,</p> <ul> <li>Path name can be partial path (trailing part of path) or node name.</li> <li>If <code>with_full_path=True</code>, path name must be full path.</li> <li>Path name must be unique to one node.</li> </ul> <p>For paths in <code>to_paths</code>,</p> <ul> <li>Path name must be full path.</li> <li>Path must exist, node-to-be-replaced must be present.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import str_to_tree, copy_and_replace_nodes_from_tree_to_tree\n&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 file1.doc\\n\"\n... \"\u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2514\u2500\u2500 photo1.jpg\\n\"\n... \"\u2514\u2500\u2500 Misc\\n\"\n... \"    \u2514\u2500\u2500 dummy\\n\"\n... \"        \u2514\u2500\u2500 photo2.jpg\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 file1.doc\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Misc\n    \u2514\u2500\u2500 dummy\n        \u2514\u2500\u2500 photo2.jpg\n</code></pre> <pre><code>&gt;&gt;&gt; root_other = str_to_tree(\n... \"Documents\\n\"\n... \"\u251c\u2500\u2500 Pictures2\\n\"\n... \"\u2502   \u2514\u2500\u2500 photo2.jpg\\n\"\n... \"\u2514\u2500\u2500 Misc2\"\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u251c\u2500\u2500 Pictures2\n\u2502   \u2514\u2500\u2500 photo2.jpg\n\u2514\u2500\u2500 Misc2\n</code></pre> <pre><code>&gt;&gt;&gt; copy_and_replace_nodes_from_tree_to_tree(\n...     from_tree=root,\n...     to_tree=root_other,\n...     from_paths=[\"Downloads/Pictures\", \"Downloads/Misc\"],\n...     to_paths=[\"Documents/Pictures2/photo2.jpg\", \"Documents/Misc2\"],\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u251c\u2500\u2500 Pictures2\n\u2502   \u2514\u2500\u2500 Pictures\n\u2502       \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Misc\n    \u2514\u2500\u2500 dummy\n        \u2514\u2500\u2500 photo2.jpg\n</code></pre> <p>In <code>delete_children=True</code> case, only the node is copied without its accompanying children/descendants.</p> <pre><code>&gt;&gt;&gt; root_other = str_to_tree(\n... \"Documents\\n\"\n... \"\u251c\u2500\u2500 Pictures2\\n\"\n... \"\u2502   \u2514\u2500\u2500 photo2.jpg\\n\"\n... \"\u2514\u2500\u2500 Misc2\"\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u251c\u2500\u2500 Pictures2\n\u2502   \u2514\u2500\u2500 photo2.jpg\n\u2514\u2500\u2500 Misc2\n</code></pre> <pre><code>&gt;&gt;&gt; copy_and_replace_nodes_from_tree_to_tree(\n...     from_tree=root,\n...     to_tree=root_other,\n...     from_paths=[\"Downloads/Pictures\", \"Downloads/Misc\"],\n...     to_paths=[\"Documents/Pictures2/photo2.jpg\", \"Documents/Misc2\"],\n...     delete_children=True,\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u251c\u2500\u2500 Pictures2\n\u2502   \u2514\u2500\u2500 Pictures\n\u2514\u2500\u2500 Misc\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>from_tree</code> <code>Node</code> <p>tree to copy nodes from</p> required <code>to_tree</code> <code>Node</code> <p>tree to copy nodes to</p> required <code>from_paths</code> <code>List[str]</code> <p>original paths to shift nodes from</p> required <code>to_paths</code> <code>List[str]</code> <p>new paths to shift nodes to</p> required <code>sep</code> <code>str</code> <p>path separator for input paths, applies to <code>from_path</code> and <code>to_path</code></p> <code>'/'</code> <code>skippable</code> <code>bool</code> <p>indicator to skip if from path is not found, defaults to False</p> <code>False</code> <code>delete_children</code> <code>bool</code> <p>indicator to copy node only without children, defaults to False</p> <code>False</code> <code>with_full_path</code> <code>bool</code> <p>indicator to shift/copy node with full path in <code>from_paths</code>, results in faster search, defaults to False</p> <code>False</code>"},{"location":"bigtree/tree/modify/#bigtree.tree.modify.copy_or_shift_logic","title":"copy_or_shift_logic","text":"<pre><code>copy_or_shift_logic(\n    tree,\n    from_paths,\n    to_paths,\n    sep=\"/\",\n    copy=False,\n    skippable=False,\n    overriding=False,\n    merge_children=False,\n    merge_leaves=False,\n    delete_children=False,\n    to_tree=None,\n    with_full_path=False,\n)\n</code></pre> <p>Shift or copy nodes from <code>from_paths</code> to <code>to_paths</code> in-place.</p> <ul> <li>Creates intermediate nodes if to path is not present</li> <li>Able to copy node, defaults to False (nodes are shifted; not copied).</li> <li>Able to skip nodes if from path is not found, defaults to False (from-nodes must be found; not skippable)</li> <li>Able to override existing node if it exists, defaults to False (to-nodes must not exist; not overridden)</li> <li>Able to merge children and remove intermediate parent node, defaults to False (nodes are shifted; not merged)</li> <li>Able to merge only leaf nodes and remove all intermediate nodes, defaults to False (nodes are shifted; not merged)</li> <li>Able to shift/copy node only and delete children, defaults to False (nodes are shifted/copied together with children).</li> <li>Able to shift/copy nodes from one tree to another tree, defaults to None (shifting/copying happens within same tree)</li> </ul> <p>For paths in <code>from_paths</code> and <code>to_paths</code>,</p> <ul> <li>Path name can be with or without leading tree path separator symbol.</li> </ul> <p>For paths in <code>from_paths</code>,</p> <ul> <li>Path name can be partial path (trailing part of path) or node name.</li> <li>If <code>with_full_path=True</code>, path name must be full path.</li> <li>Path name must be unique to one node.</li> </ul> <p>For paths in <code>to_paths</code>,</p> <ul> <li>Path name must be full path.</li> <li>Can set to empty string or None to delete the path in <code>from_paths</code>, note that <code>copy</code> must be set to False.</li> </ul> <p>If <code>merge_children=True</code>,</p> <ul> <li>If <code>to_path</code> is not present, it shifts/copies children of <code>from_path</code>.</li> <li>If <code>to_path</code> is present, and <code>overriding=False</code>, original and new children are merged.</li> <li>If <code>to_path</code> is present and <code>overriding=True</code>, it behaves like overriding and only new children are retained.</li> </ul> <p>If <code>merge_leaves=True</code>,</p> <ul> <li>If <code>to_path</code> is not present, it shifts/copies leaves of <code>from_path</code>.</li> <li>If <code>to_path</code> is present, and <code>overriding=False</code>, original children and leaves are merged.</li> <li>If <code>to_path</code> is present and <code>overriding=True</code>, it behaves like overriding and only new leaves are retained,     original non-leaf nodes in <code>from_path</code> are retained.</li> </ul> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to modify</p> required <code>from_paths</code> <code>List[str]</code> <p>original paths to shift nodes from</p> required <code>to_paths</code> <code>List[str]</code> <p>new paths to shift nodes to</p> required <code>sep</code> <code>str</code> <p>path separator for input paths, applies to <code>from_path</code> and <code>to_path</code></p> <code>'/'</code> <code>copy</code> <code>bool</code> <p>indicator to copy node, defaults to False</p> <code>False</code> <code>skippable</code> <code>bool</code> <p>indicator to skip if from path is not found, defaults to False</p> <code>False</code> <code>overriding</code> <code>bool</code> <p>indicator to override existing to path if there is clashes, defaults to False</p> <code>False</code> <code>merge_children</code> <code>bool</code> <p>indicator to merge children and remove intermediate parent node, defaults to False</p> <code>False</code> <code>merge_leaves</code> <code>bool</code> <p>indicator to merge leaf nodes and remove intermediate parent node(s), defaults to False</p> <code>False</code> <code>delete_children</code> <code>bool</code> <p>indicator to shift/copy node only without children, defaults to False</p> <code>False</code> <code>to_tree</code> <code>Node</code> <p>tree to copy to, defaults to None</p> <code>None</code> <code>with_full_path</code> <code>bool</code> <p>indicator to shift/copy node with full path in <code>from_paths</code>, results in faster search, defaults to False</p> <code>False</code>"},{"location":"bigtree/tree/modify/#bigtree.tree.modify.replace_logic","title":"replace_logic","text":"<pre><code>replace_logic(\n    tree,\n    from_paths,\n    to_paths,\n    sep=\"/\",\n    copy=False,\n    skippable=False,\n    delete_children=False,\n    to_tree=None,\n    with_full_path=False,\n)\n</code></pre> <p>Shift or copy nodes from <code>from_paths</code> to replace <code>to_paths</code> in-place.</p> <ul> <li>Creates intermediate nodes if to path is not present</li> <li>Able to copy node, defaults to False (nodes are shifted; not copied).</li> <li>Able to skip nodes if from path is not found, defaults to False (from-nodes must be found; not skippable)</li> <li>Able to replace node only and delete children, defaults to False (nodes are shifted/copied together with children).</li> <li>Able to shift/copy nodes from one tree to another tree, defaults to None (shifting/copying happens within same tree)</li> </ul> <p>For paths in <code>from_paths</code> and <code>to_paths</code>,</p> <ul> <li>Path name can be with or without leading tree path separator symbol.</li> </ul> <p>For paths in <code>from_paths</code>,</p> <ul> <li>Path name can be partial path (trailing part of path) or node name.</li> <li>If <code>with_full_path=True</code>, path name must be full path.</li> <li>Path name must be unique to one node.</li> </ul> <p>For paths in <code>to_paths</code>,</p> <ul> <li>Path name must be full path.</li> <li>Path must exist, node-to-be-replaced must be present.</li> </ul> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to modify</p> required <code>from_paths</code> <code>List[str]</code> <p>original paths to shift nodes from</p> required <code>to_paths</code> <code>List[str]</code> <p>new paths to shift nodes to</p> required <code>sep</code> <code>str</code> <p>path separator for input paths, applies to <code>from_path</code> and <code>to_path</code></p> <code>'/'</code> <code>copy</code> <code>bool</code> <p>indicator to copy node, defaults to False</p> <code>False</code> <code>skippable</code> <code>bool</code> <p>indicator to skip if from path is not found, defaults to False</p> <code>False</code> <code>delete_children</code> <code>bool</code> <p>indicator to shift/copy node only without children, defaults to False</p> <code>False</code> <code>to_tree</code> <code>Node</code> <p>tree to copy to, defaults to None</p> <code>None</code> <code>with_full_path</code> <code>bool</code> <p>indicator to shift/copy node with full path in <code>from_paths</code>, results in faster search, defaults to False</p> <code>False</code>"},{"location":"bigtree/tree/search/","title":"\ud83d\udd0d Search","text":"<p>Search methods for Trees.</p> Search by One node One or more nodes General method <code>find</code>, <code>find_child</code> <code>findall</code>, <code>find_children</code> Node name <code>find_name</code>, <code>find_child_by_name</code> <code>find_names</code> Node path <code>find_path</code>, <code>find_full_path</code>, <code>find_relative_path</code> <code>find_paths</code>, <code>find_relative_path</code> Node attributes <code>find_attr</code> <code>find_attrs</code>"},{"location":"bigtree/tree/search/#bigtree.tree.search","title":"bigtree.tree.search","text":""},{"location":"bigtree/tree/search/#bigtree.tree.search.findall","title":"findall","text":"<pre><code>findall(\n    tree, condition, max_depth=0, min_count=0, max_count=0\n)\n</code></pre> <p>Search tree for nodes matching condition (callable function).</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, findall\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=c)\n&gt;&gt;&gt; findall(root, lambda node: node.age &gt; 62)\n(Node(/a, age=90), Node(/a/b, age=65))\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode</code> <p>tree to search</p> required <code>condition</code> <code>Callable</code> <p>function that takes in node as argument, returns node if condition evaluates to <code>True</code></p> required <code>max_depth</code> <code>int</code> <p>maximum depth to search for, based on the <code>depth</code> attribute, defaults to None</p> <code>0</code> <code>min_count</code> <code>int</code> <p>checks for minimum number of occurrences, raise SearchError if the number of results do not meet min_count, defaults to None</p> <code>0</code> <code>max_count</code> <code>int</code> <p>checks for maximum number of occurrences, raise SearchError if the number of results do not meet min_count, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>Tuple[T, ...]</code> <p>(Tuple[BaseNode, ...])</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find","title":"find","text":"<pre><code>find(tree, condition, max_depth=0)\n</code></pre> <p>Search tree for single node matching condition (callable function).</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=c)\n&gt;&gt;&gt; find(root, lambda node: node.age == 65)\nNode(/a/b, age=65)\n&gt;&gt;&gt; find(root, lambda node: node.age &gt; 5)\nTraceback (most recent call last):\n    ...\nbigtree.utils.exceptions.SearchError: Expected less than 1 element(s), found 4 elements\n(Node(/a, age=90), Node(/a/b, age=65), Node(/a/c, age=60), Node(/a/c/d, age=40))\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode</code> <p>tree to search</p> required <code>condition</code> <code>Callable</code> <p>function that takes in node as argument, returns node if condition evaluates to <code>True</code></p> required <code>max_depth</code> <code>int</code> <p>maximum depth to search for, based on the <code>depth</code> attribute, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>T</code> <p>(BaseNode)</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find_name","title":"find_name","text":"<pre><code>find_name(tree, name, max_depth=0)\n</code></pre> <p>Search tree for single node matching name attribute.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find_name\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=c)\n&gt;&gt;&gt; find_name(root, \"c\")\nNode(/a/c, age=60)\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to search</p> required <code>name</code> <code>str</code> <p>value to match for name attribute</p> required <code>max_depth</code> <code>int</code> <p>maximum depth to search for, based on the <code>depth</code> attribute, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>NodeT</code> <p>(Node)</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find_names","title":"find_names","text":"<pre><code>find_names(tree, name, max_depth=0)\n</code></pre> <p>Search tree for multiple node(s) matching name attribute.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find_names\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"b\", age=40, parent=c)\n&gt;&gt;&gt; find_names(root, \"c\")\n(Node(/a/c, age=60),)\n&gt;&gt;&gt; find_names(root, \"b\")\n(Node(/a/b, age=65), Node(/a/c/b, age=40))\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to search</p> required <code>name</code> <code>str</code> <p>value to match for name attribute</p> required <code>max_depth</code> <code>int</code> <p>maximum depth to search for, based on the <code>depth</code> attribute, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>Iterable[NodeT]</code> <p>(Iterable[Node])</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find_relative_path","title":"find_relative_path","text":"<pre><code>find_relative_path(tree, path_name)\n</code></pre> <p>Search tree for single node matching relative path attribute.</p> <ul> <li>Supports unix folder expression for relative path, i.e., '../../node_name'</li> <li>Supports wildcards, i.e., '*/node_name'</li> <li>If path name starts with leading separator symbol, it will start at root node.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find_relative_path\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=c)\n&gt;&gt;&gt; find_relative_path(d, \"..\")\n(Node(/a/c, age=60),)\n&gt;&gt;&gt; find_relative_path(d, \"../../b\")\n(Node(/a/b, age=65),)\n&gt;&gt;&gt; find_relative_path(d, \"../../*\")\n(Node(/a/b, age=65), Node(/a/c, age=60))\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to search</p> required <code>path_name</code> <code>str</code> <p>value to match (relative path) of path_name attribute</p> required <p>Returns:</p> Type Description <code>Iterable[NodeT]</code> <p>(Iterable[Node])</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find_full_path","title":"find_full_path","text":"<pre><code>find_full_path(tree, path_name)\n</code></pre> <p>Search tree for single node matching path attribute.</p> <ul> <li>Path name can be with or without leading tree path separator symbol.</li> <li>Path name must be full path, works similar to <code>find_path</code> but faster.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find_full_path\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=c)\n&gt;&gt;&gt; find_full_path(root, \"/a/c/d\")\nNode(/a/c/d, age=40)\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to search</p> required <code>path_name</code> <code>str</code> <p>value to match (full path) of path_name attribute</p> required <p>Returns:</p> Type Description <code>NodeT</code> <p>(Node)</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find_path","title":"find_path","text":"<pre><code>find_path(tree, path_name)\n</code></pre> <p>Search tree for single node matching path attribute.</p> <ul> <li>Path name can be with or without leading tree path separator symbol.</li> <li>Path name can be full path or partial path (trailing part of path) or node name.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find_path\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=c)\n&gt;&gt;&gt; find_path(root, \"c\")\nNode(/a/c, age=60)\n&gt;&gt;&gt; find_path(root, \"/c\")\nNode(/a/c, age=60)\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to search</p> required <code>path_name</code> <code>str</code> <p>value to match (full path) or trailing part (partial path) of path_name attribute</p> required <p>Returns:</p> Type Description <code>NodeT</code> <p>(Node)</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find_paths","title":"find_paths","text":"<pre><code>find_paths(tree, path_name)\n</code></pre> <p>Search tree for multiple nodes matching path attribute.</p> <ul> <li>Path name can be with or without leading tree path separator symbol.</li> <li>Path name can be partial path (trailing part of path) or node name.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find_paths\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"c\", age=40, parent=c)\n&gt;&gt;&gt; find_paths(root, \"/a/c\")\n(Node(/a/c, age=60),)\n&gt;&gt;&gt; find_paths(root, \"/c\")\n(Node(/a/c, age=60), Node(/a/c/c, age=40))\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to search</p> required <code>path_name</code> <code>str</code> <p>value to match (full path) or trailing part (partial path) of path_name attribute</p> required <p>Returns:</p> Type Description <code>Tuple[NodeT, ...]</code> <p>(Tuple[Node, ...])</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find_attr","title":"find_attr","text":"<pre><code>find_attr(tree, attr_name, attr_value, max_depth=0)\n</code></pre> <p>Search tree for single node matching custom attribute.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find_attr\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=c)\n&gt;&gt;&gt; find_attr(root, \"age\", 65)\nNode(/a/b, age=65)\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode</code> <p>tree to search</p> required <code>attr_name</code> <code>str</code> <p>attribute name to perform matching</p> required <code>attr_value</code> <code>Any</code> <p>value to match for attr_name attribute</p> required <code>max_depth</code> <code>int</code> <p>maximum depth to search for, based on the <code>depth</code> attribute, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>BaseNode</code> <p>(BaseNode)</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find_attrs","title":"find_attrs","text":"<pre><code>find_attrs(tree, attr_name, attr_value, max_depth=0)\n</code></pre> <p>Search tree for node(s) matching custom attribute.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find_attrs\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=65, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=c)\n&gt;&gt;&gt; find_attrs(root, \"age\", 65)\n(Node(/a/b, age=65), Node(/a/c, age=65))\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode</code> <p>tree to search</p> required <code>attr_name</code> <code>str</code> <p>attribute name to perform matching</p> required <code>attr_value</code> <code>Any</code> <p>value to match for attr_name attribute</p> required <code>max_depth</code> <code>int</code> <p>maximum depth to search for, based on the <code>depth</code> attribute, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>Tuple[BaseNode, ...]</code> <p>(Tuple[BaseNode, ...])</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find_children","title":"find_children","text":"<pre><code>find_children(tree, condition, min_count=0, max_count=0)\n</code></pre> <p>Search children for nodes matching condition (callable function).</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find_children\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=c)\n&gt;&gt;&gt; find_children(root, lambda node: node.age &gt; 30)\n(Node(/a/b, age=65), Node(/a/c, age=60))\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode / DAGNode</code> <p>tree to search for its children</p> required <code>condition</code> <code>Callable</code> <p>function that takes in node as argument, returns node if condition evaluates to <code>True</code></p> required <code>min_count</code> <code>int</code> <p>checks for minimum number of occurrences, raise SearchError if the number of results do not meet min_count, defaults to None</p> <code>0</code> <code>max_count</code> <code>int</code> <p>checks for maximum number of occurrences, raise SearchError if the number of results do not meet min_count, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>Tuple[Union[T, DAGNodeT], ...]</code> <p>(BaseNode/DAGNode)</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find_child","title":"find_child","text":"<pre><code>find_child(tree, condition)\n</code></pre> <p>Search children for single node matching condition (callable function).</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find_child\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=c)\n&gt;&gt;&gt; find_child(root, lambda node: node.age &gt; 62)\nNode(/a/b, age=65)\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode / DAGNode</code> <p>tree to search for its child</p> required <code>condition</code> <code>Callable</code> <p>function that takes in node as argument, returns node if condition evaluates to <code>True</code></p> required <p>Returns:</p> Type Description <code>Union[T, DAGNodeT]</code> <p>(BaseNode/DAGNode)</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find_child_by_name","title":"find_child_by_name","text":"<pre><code>find_child_by_name(tree, name)\n</code></pre> <p>Search tree for single node matching name attribute.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find_child_by_name\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=c)\n&gt;&gt;&gt; find_child_by_name(root, \"c\")\nNode(/a/c, age=60)\n&gt;&gt;&gt; find_child_by_name(c, \"d\")\nNode(/a/c/d, age=40)\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node / DAGNode</code> <p>tree to search, parent node</p> required <code>name</code> <code>str</code> <p>value to match for name attribute, child node</p> required <p>Returns:</p> Type Description <code>Union[NodeT, DAGNodeT]</code> <p>(Node/DAGNode)</p>"},{"location":"bigtree/utils/","title":"\ud83d\udd27 Utils","text":""},{"location":"bigtree/utils/iterators/","title":"\u27b0 Iterators","text":"<p>Iterator methods for Trees and DAGs.</p>"},{"location":"bigtree/utils/iterators/#iterator-methods","title":"Iterator Methods","text":"Data Structure Algorithm Description Binary Tree In-order Traversal Depth-First Search, LNR Tree Pre-order Traversal Depth-First Search, NLR Tree Post-Order Traversal Depth-First Search, LRN Tree Level-Order Traversal Breadth-First Search Tree ZigZag Traversal Breadth-First Search Tree ZigZag Group Traversal Breadth-First Search DAG General Depth-First Search"},{"location":"bigtree/utils/iterators/#bigtree.utils.iterators","title":"bigtree.utils.iterators","text":""},{"location":"bigtree/utils/iterators/#bigtree.utils.iterators.inorder_iter","title":"inorder_iter","text":"<pre><code>inorder_iter(tree, filter_condition=None, max_depth=0)\n</code></pre> <p>Iterate through all children of a tree.</p> <p>In-Order Iteration Algorithm, LNR     1. Recursively traverse the current node's left subtree.     2. Visit the current node.     3. Recursively traverse the current node's right subtree.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import BinaryNode, list_to_binarytree, inorder_iter\n&gt;&gt;&gt; num_list = [1, 2, 3, 4, 5, 6, 7, 8]\n&gt;&gt;&gt; root = list_to_binarytree(num_list)\n&gt;&gt;&gt; root.show()\n1\n\u251c\u2500\u2500 2\n\u2502   \u251c\u2500\u2500 4\n\u2502   \u2502   \u2514\u2500\u2500 8\n\u2502   \u2514\u2500\u2500 5\n\u2514\u2500\u2500 3\n    \u251c\u2500\u2500 6\n    \u2514\u2500\u2500 7\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in inorder_iter(root)]\n['8', '4', '2', '5', '1', '6', '3', '7']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in inorder_iter(root, filter_condition=lambda x: x.node_name in [\"1\", \"4\", \"3\", \"6\", \"7\"])]\n['4', '1', '6', '3', '7']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in inorder_iter(root, max_depth=3)]\n['4', '2', '5', '1', '6', '3', '7']\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BinaryNode</code> <p>input tree</p> required <code>filter_condition</code> <code>Optional[Callable[[BinaryNode], bool]]</code> <p>function that takes in node as argument, optional Return node if condition evaluates to <code>True</code></p> <code>None</code> <code>max_depth</code> <code>int</code> <p>maximum depth of iteration, based on <code>depth</code> attribute, optional</p> <code>0</code> <p>Returns:</p> Type Description <code>Iterable[BinaryNodeT]</code> <p>(Iterable[BinaryNode])</p>"},{"location":"bigtree/utils/iterators/#bigtree.utils.iterators.preorder_iter","title":"preorder_iter","text":"<pre><code>preorder_iter(\n    tree,\n    filter_condition=None,\n    stop_condition=None,\n    max_depth=0,\n)\n</code></pre> <p>Iterate through all children of a tree.</p> <p>Pre-Order Iteration Algorithm, NLR     1. Visit the current node.     2. Recursively traverse the current node's left subtree.     3. Recursively traverse the current node's right subtree.</p> <p>It is topologically sorted because a parent node is processed before its child nodes.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, list_to_tree, preorder_iter\n&gt;&gt;&gt; path_list = [\"a/b/d\", \"a/b/e/g\", \"a/b/e/h\", \"a/c/f\"]\n&gt;&gt;&gt; root = list_to_tree(path_list)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in preorder_iter(root)]\n['a', 'b', 'd', 'e', 'g', 'h', 'c', 'f']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in preorder_iter(root, filter_condition=lambda x: x.node_name in [\"a\", \"d\", \"e\", \"f\", \"g\"])]\n['a', 'd', 'e', 'g', 'f']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in preorder_iter(root, stop_condition=lambda x: x.node_name == \"e\")]\n['a', 'b', 'd', 'c', 'f']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in preorder_iter(root, max_depth=3)]\n['a', 'b', 'd', 'e', 'c', 'f']\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Union[BaseNode, DAGNode]</code> <p>input tree</p> required <code>filter_condition</code> <code>Optional[Callable[[T], bool]]</code> <p>function that takes in node as argument, optional Return node if condition evaluates to <code>True</code></p> <code>None</code> <code>stop_condition</code> <code>Optional[Callable[[T], bool]]</code> <p>function that takes in node as argument, optional Stops iteration if condition evaluates to <code>True</code></p> <code>None</code> <code>max_depth</code> <code>int</code> <p>maximum depth of iteration, based on <code>depth</code> attribute, optional</p> <code>0</code> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Union[Iterable[BaseNode], Iterable[DAGNode]])</p>"},{"location":"bigtree/utils/iterators/#bigtree.utils.iterators.postorder_iter","title":"postorder_iter","text":"<pre><code>postorder_iter(\n    tree,\n    filter_condition=None,\n    stop_condition=None,\n    max_depth=0,\n)\n</code></pre> <p>Iterate through all children of a tree.</p> <p>Post-Order Iteration Algorithm, LRN     1. Recursively traverse the current node's left subtree.     2. Recursively traverse the current node's right subtree.     3. Visit the current node.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, list_to_tree, postorder_iter\n&gt;&gt;&gt; path_list = [\"a/b/d\", \"a/b/e/g\", \"a/b/e/h\", \"a/c/f\"]\n&gt;&gt;&gt; root = list_to_tree(path_list)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in postorder_iter(root)]\n['d', 'g', 'h', 'e', 'b', 'f', 'c', 'a']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in postorder_iter(root, filter_condition=lambda x: x.node_name in [\"a\", \"d\", \"e\", \"f\", \"g\"])]\n['d', 'g', 'e', 'f', 'a']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in postorder_iter(root, stop_condition=lambda x: x.node_name == \"e\")]\n['d', 'b', 'f', 'c', 'a']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in postorder_iter(root, max_depth=3)]\n['d', 'e', 'b', 'f', 'c', 'a']\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode</code> <p>input tree</p> required <code>filter_condition</code> <code>Optional[Callable[[BaseNode], bool]]</code> <p>function that takes in node as argument, optional Return node if condition evaluates to <code>True</code></p> <code>None</code> <code>stop_condition</code> <code>Optional[Callable[[BaseNode], bool]]</code> <p>function that takes in node as argument, optional Stops iteration if condition evaluates to <code>True</code></p> <code>None</code> <code>max_depth</code> <code>int</code> <p>maximum depth of iteration, based on <code>depth</code> attribute, optional</p> <code>0</code> <p>Returns:</p> Type Description <code>Iterable[BaseNodeT]</code> <p>(Iterable[BaseNode])</p>"},{"location":"bigtree/utils/iterators/#bigtree.utils.iterators.levelorder_iter","title":"levelorder_iter","text":"<pre><code>levelorder_iter(\n    tree,\n    filter_condition=None,\n    stop_condition=None,\n    max_depth=0,\n)\n</code></pre> <p>Iterate through all children of a tree.</p> <p>Level-Order Iteration Algorithm     1. Recursively traverse the nodes on same level.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, list_to_tree, levelorder_iter\n&gt;&gt;&gt; path_list = [\"a/b/d\", \"a/b/e/g\", \"a/b/e/h\", \"a/c/f\"]\n&gt;&gt;&gt; root = list_to_tree(path_list)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in levelorder_iter(root)]\n['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in levelorder_iter(root, filter_condition=lambda x: x.node_name in [\"a\", \"d\", \"e\", \"f\", \"g\"])]\n['a', 'd', 'e', 'f', 'g']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in levelorder_iter(root, stop_condition=lambda x: x.node_name == \"e\")]\n['a', 'b', 'c', 'd', 'f']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in levelorder_iter(root, max_depth=3)]\n['a', 'b', 'c', 'd', 'e', 'f']\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode</code> <p>input tree</p> required <code>filter_condition</code> <code>Optional[Callable[[BaseNode], bool]]</code> <p>function that takes in node as argument, optional Return node if condition evaluates to <code>True</code></p> <code>None</code> <code>stop_condition</code> <code>Optional[Callable[[BaseNode], bool]]</code> <p>function that takes in node as argument, optional Stops iteration if condition evaluates to <code>True</code></p> <code>None</code> <code>max_depth</code> <code>int</code> <p>maximum depth of iteration, based on <code>depth</code> attribute, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>Iterable[BaseNodeT]</code> <p>(Iterable[BaseNode])</p>"},{"location":"bigtree/utils/iterators/#bigtree.utils.iterators.levelordergroup_iter","title":"levelordergroup_iter","text":"<pre><code>levelordergroup_iter(\n    tree,\n    filter_condition=None,\n    stop_condition=None,\n    max_depth=0,\n)\n</code></pre> <p>Iterate through all children of a tree.</p> <p>Level-Order Group Iteration Algorithm     1. Recursively traverse the nodes on same level, returns nodes level by level in a nested list.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, list_to_tree, levelordergroup_iter\n&gt;&gt;&gt; path_list = [\"a/b/d\", \"a/b/e/g\", \"a/b/e/h\", \"a/c/f\"]\n&gt;&gt;&gt; root = list_to_tree(path_list)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n</code></pre> <pre><code>&gt;&gt;&gt; [[node.node_name for node in group] for group in levelordergroup_iter(root)]\n[['a'], ['b', 'c'], ['d', 'e', 'f'], ['g', 'h']]\n</code></pre> <pre><code>&gt;&gt;&gt; [[node.node_name for node in group] for group in levelordergroup_iter(root, filter_condition=lambda x: x.node_name in [\"a\", \"d\", \"e\", \"f\", \"g\"])]\n[['a'], [], ['d', 'e', 'f'], ['g']]\n</code></pre> <pre><code>&gt;&gt;&gt; [[node.node_name for node in group] for group in levelordergroup_iter(root, stop_condition=lambda x: x.node_name == \"e\")]\n[['a'], ['b', 'c'], ['d', 'f']]\n</code></pre> <pre><code>&gt;&gt;&gt; [[node.node_name for node in group] for group in levelordergroup_iter(root, max_depth=3)]\n[['a'], ['b', 'c'], ['d', 'e', 'f']]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode</code> <p>input tree</p> required <code>filter_condition</code> <code>Optional[Callable[[BaseNode], bool]]</code> <p>function that takes in node as argument, optional Return node if condition evaluates to <code>True</code></p> <code>None</code> <code>stop_condition</code> <code>Optional[Callable[[BaseNode], bool]]</code> <p>function that takes in node as argument, optional Stops iteration if condition evaluates to <code>True</code></p> <code>None</code> <code>max_depth</code> <code>int</code> <p>maximum depth of iteration, based on <code>depth</code> attribute, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>Iterable[Iterable[BaseNodeT]]</code> <p>(Iterable[Iterable[BaseNode]])</p>"},{"location":"bigtree/utils/iterators/#bigtree.utils.iterators.zigzag_iter","title":"zigzag_iter","text":"<pre><code>zigzag_iter(\n    tree,\n    filter_condition=None,\n    stop_condition=None,\n    max_depth=0,\n)\n</code></pre> <p>Iterate through all children of a tree.</p> <p>ZigZag Iteration Algorithm     1. Recursively traverse the nodes on same level, in a zigzag manner across different levels.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, list_to_tree, zigzag_iter\n&gt;&gt;&gt; path_list = [\"a/b/d\", \"a/b/e/g\", \"a/b/e/h\", \"a/c/f\"]\n&gt;&gt;&gt; root = list_to_tree(path_list)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in zigzag_iter(root)]\n['a', 'c', 'b', 'd', 'e', 'f', 'h', 'g']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in zigzag_iter(root, filter_condition=lambda x: x.node_name in [\"a\", \"d\", \"e\", \"f\", \"g\"])]\n['a', 'd', 'e', 'f', 'g']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in zigzag_iter(root, stop_condition=lambda x: x.node_name == \"e\")]\n['a', 'c', 'b', 'd', 'f']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in zigzag_iter(root, max_depth=3)]\n['a', 'c', 'b', 'd', 'e', 'f']\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode</code> <p>input tree</p> required <code>filter_condition</code> <code>Optional[Callable[[BaseNode], bool]]</code> <p>function that takes in node as argument, optional Return node if condition evaluates to <code>True</code></p> <code>None</code> <code>stop_condition</code> <code>Optional[Callable[[BaseNode], bool]]</code> <p>function that takes in node as argument, optional Stops iteration if condition evaluates to <code>True</code></p> <code>None</code> <code>max_depth</code> <code>int</code> <p>maximum depth of iteration, based on <code>depth</code> attribute, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>Iterable[BaseNodeT]</code> <p>(Iterable[BaseNode])</p>"},{"location":"bigtree/utils/iterators/#bigtree.utils.iterators.zigzaggroup_iter","title":"zigzaggroup_iter","text":"<pre><code>zigzaggroup_iter(\n    tree,\n    filter_condition=None,\n    stop_condition=None,\n    max_depth=0,\n)\n</code></pre> <p>Iterate through all children of a tree.</p> <p>ZigZag Group Iteration Algorithm     1. Recursively traverse the nodes on same level, in a zigzag manner across different levels,         returns nodes level by level in a nested list.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, list_to_tree, zigzaggroup_iter\n&gt;&gt;&gt; path_list = [\"a/b/d\", \"a/b/e/g\", \"a/b/e/h\", \"a/c/f\"]\n&gt;&gt;&gt; root = list_to_tree(path_list)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n</code></pre> <pre><code>&gt;&gt;&gt; [[node.node_name for node in group] for group in zigzaggroup_iter(root)]\n[['a'], ['c', 'b'], ['d', 'e', 'f'], ['h', 'g']]\n</code></pre> <pre><code>&gt;&gt;&gt; [[node.node_name for node in group] for group in zigzaggroup_iter(root, filter_condition=lambda x: x.node_name in [\"a\", \"d\", \"e\", \"f\", \"g\"])]\n[['a'], [], ['d', 'e', 'f'], ['g']]\n</code></pre> <pre><code>&gt;&gt;&gt; [[node.node_name for node in group] for group in zigzaggroup_iter(root, stop_condition=lambda x: x.node_name == \"e\")]\n[['a'], ['c', 'b'], ['d', 'f']]\n</code></pre> <pre><code>&gt;&gt;&gt; [[node.node_name for node in group] for group in zigzaggroup_iter(root, max_depth=3)]\n[['a'], ['c', 'b'], ['d', 'e', 'f']]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode</code> <p>input tree</p> required <code>filter_condition</code> <code>Optional[Callable[[BaseNode], bool]]</code> <p>function that takes in node as argument, optional Return node if condition evaluates to <code>True</code></p> <code>None</code> <code>stop_condition</code> <code>Optional[Callable[[BaseNode], bool]]</code> <p>function that takes in node as argument, optional Stops iteration if condition evaluates to <code>True</code></p> <code>None</code> <code>max_depth</code> <code>int</code> <p>maximum depth of iteration, based on <code>depth</code> attribute, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>Iterable[Iterable[BaseNodeT]]</code> <p>(Iterable[Iterable[BaseNode]])</p>"},{"location":"bigtree/utils/iterators/#bigtree.utils.iterators.dag_iterator","title":"dag_iterator","text":"<pre><code>dag_iterator(dag)\n</code></pre> <p>Iterate through all nodes of a Directed Acyclic Graph (DAG). Note that node names must be unique. Note that DAG must at least have two nodes to be shown on graph.</p> <ol> <li>Visit the current node.</li> <li>Recursively traverse the current node's parents.</li> <li>Recursively traverse the current node's children.</li> </ol> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode, dag_iterator\n&gt;&gt;&gt; a = DAGNode(\"a\", step=1)\n&gt;&gt;&gt; b = DAGNode(\"b\", step=1)\n&gt;&gt;&gt; c = DAGNode(\"c\", step=2, parents=[a, b])\n&gt;&gt;&gt; d = DAGNode(\"d\", step=2, parents=[a, c])\n&gt;&gt;&gt; e = DAGNode(\"e\", step=3, parents=[d])\n&gt;&gt;&gt; [(parent.node_name, child.node_name) for parent, child in dag_iterator(a)]\n[('a', 'c'), ('a', 'd'), ('b', 'c'), ('c', 'd'), ('d', 'e')]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>dag</code> <code>DAGNode</code> <p>input dag</p> required <p>Returns:</p> Type Description <code>Iterable[Tuple[DAGNodeT, DAGNodeT]]</code> <p>(Iterable[Tuple[DAGNode, DAGNode]])</p>"},{"location":"bigtree/utils/plot/","title":"\ud83d\udcca Plot","text":"<p>Plotting methods for Trees.</p>"},{"location":"bigtree/utils/plot/#bigtree.utils.plot","title":"bigtree.utils.plot","text":""},{"location":"bigtree/utils/plot/#bigtree.utils.plot.reingold_tilford","title":"reingold_tilford","text":"<pre><code>reingold_tilford(\n    tree_node,\n    sibling_separation=1.0,\n    subtree_separation=1.0,\n    level_separation=1.0,\n    x_offset=0.0,\n    y_offset=0.0,\n)\n</code></pre> <p>Algorithm for drawing tree structure, retrieves <code>(x, y)</code> coordinates for a tree structure. Adds <code>x</code> and <code>y</code> attributes to every node in the tree. Modifies tree in-place.</p> <p>This algorithm[1] is an improvement over Reingold Tilford algorithm[2].</p> <p>According to Reingold Tilford's paper, a tree diagram should satisfy the following aesthetic rules,</p> <ol> <li>Nodes at the same depth should lie along a straight line, and the straight lines defining the depths should be parallel.</li> <li>A left child should be positioned to the left of its parent node and a right child to the right.</li> <li>A parent should be centered over their children.</li> <li>A tree and its mirror image should produce drawings that are reflections of one another; a subtree should be drawn the same way regardless of where it occurs in the tree.</li> </ol> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import reingold_tilford, list_to_tree\n&gt;&gt;&gt; path_list = [\"a/b/d\", \"a/b/e/g\", \"a/b/e/h\", \"a/c/f\"]\n&gt;&gt;&gt; root = list_to_tree(path_list)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n</code></pre> <pre><code>&gt;&gt;&gt; reingold_tilford(root)\n&gt;&gt;&gt; root.show(attr_list=[\"x\", \"y\"])\na [x=1.25, y=3.0]\n\u251c\u2500\u2500 b [x=0.5, y=2.0]\n\u2502   \u251c\u2500\u2500 d [x=0.0, y=1.0]\n\u2502   \u2514\u2500\u2500 e [x=1.0, y=1.0]\n\u2502       \u251c\u2500\u2500 g [x=0.5, y=0.0]\n\u2502       \u2514\u2500\u2500 h [x=1.5, y=0.0]\n\u2514\u2500\u2500 c [x=2.0, y=2.0]\n    \u2514\u2500\u2500 f [x=2.0, y=1.0]\n</code></pre> <p>References</p> <ul> <li>[1] Walker, J. (1991). Positioning Nodes for General Trees. https://www.drdobbs.com/positioning-nodes-for-general-trees/184402320?pgno=4</li> <li>[2] Reingold, E., Tilford, J. (1981). Tidier Drawings of Trees. IEEE Transactions on Software Engineering. https://reingold.co/tidier-drawings.pdf</li> </ul> <p>Parameters:</p> Name Type Description Default <code>tree_node</code> <code>BaseNode</code> <p>tree to compute (x, y) coordinate</p> required <code>sibling_separation</code> <code>float</code> <p>minimum distance between adjacent siblings of the tree</p> <code>1.0</code> <code>subtree_separation</code> <code>float</code> <p>minimum distance between adjacent subtrees of the tree</p> <code>1.0</code> <code>level_separation</code> <code>float</code> <p>fixed distance between adjacent levels of the tree</p> <code>1.0</code> <code>x_offset</code> <code>float</code> <p>graph offset of x-coordinates</p> <code>0.0</code> <code>y_offset</code> <code>float</code> <p>graph offset of y-coordinates</p> <code>0.0</code>"},{"location":"bigtree/workflows/","title":"\ud83d\udc77 Workflows","text":""},{"location":"bigtree/workflows/app_calendar/","title":"\ud83d\udcc6 Calendar App","text":""},{"location":"bigtree/workflows/app_calendar/#bigtree.workflows.app_calendar","title":"bigtree.workflows.app_calendar","text":""},{"location":"bigtree/workflows/app_calendar/#bigtree.workflows.app_calendar.Calendar","title":"Calendar","text":"<pre><code>Calendar(name)\n</code></pre> <p>Calendar Implementation with Big Tree.   - Calendar has four levels - year, month, day, and event name (with event attributes)</p> <p>Examples:</p> <p>Initializing and Adding Events</p> <pre><code>&gt;&gt;&gt; from bigtree import Calendar\n&gt;&gt;&gt; calendar = Calendar(\"My Calendar\")\n&gt;&gt;&gt; calendar.add_event(\"Gym\", \"2023-01-01 18:00\")\n&gt;&gt;&gt; calendar.add_event(\"Dinner\", \"2023-01-01\", date_format=\"%Y-%m-%d\", budget=20)\n&gt;&gt;&gt; calendar.add_event(\"Gym\", \"2023-01-02 18:00\")\n&gt;&gt;&gt; calendar.show()\nMy Calendar\n2023-01-01 00:00:00 - Dinner (budget: 20)\n2023-01-01 18:00:00 - Gym\n2023-01-02 18:00:00 - Gym\n</code></pre> <p>Search for Events</p> <pre><code>&gt;&gt;&gt; calendar.find_event(\"Gym\")\n2023-01-01 18:00:00 - Gym\n2023-01-02 18:00:00 - Gym\n</code></pre> <p>Removing Events</p> <pre><code>&gt;&gt;&gt; import datetime as dt\n&gt;&gt;&gt; calendar.delete_event(\"Gym\", dt.date(2023, 1, 1))\n&gt;&gt;&gt; calendar.show()\nMy Calendar\n2023-01-01 00:00:00 - Dinner (budget: 20)\n2023-01-02 18:00:00 - Gym\n</code></pre> <p>Export Calendar</p> <pre><code>&gt;&gt;&gt; calendar.to_dataframe()\n                             path    name        date      time  budget\n0  /My Calendar/2023/01/01/Dinner  Dinner  2023-01-01  00:00:00    20.0\n1     /My Calendar/2023/01/02/Gym     Gym  2023-01-02  18:00:00     NaN\n</code></pre>"},{"location":"bigtree/workflows/app_calendar/#bigtree.workflows.app_calendar.Calendar.add_event","title":"add_event","text":"<pre><code>add_event(\n    event_name,\n    event_datetime,\n    date_format=\"%Y-%m-%d %H:%M\",\n    **kwargs\n)\n</code></pre> <p>Add event to calendar</p> <p>Parameters:</p> Name Type Description Default <code>event_name</code> <code>str</code> <p>event name to be added</p> required <code>event_datetime</code> <code>Union[str, datetime]</code> <p>event date and time</p> required <code>date_format</code> <code>str</code> <p>specify datetime format if event_datetime is str</p> <code>'%Y-%m-%d %H:%M'</code>"},{"location":"bigtree/workflows/app_calendar/#bigtree.workflows.app_calendar.Calendar.delete_event","title":"delete_event","text":"<pre><code>delete_event(event_name, event_date=None)\n</code></pre> <p>Delete event from calendar</p> <p>Parameters:</p> Name Type Description Default <code>event_name</code> <code>str</code> <p>event name to be deleted</p> required <code>event_date</code> <code>date</code> <p>event date to be deleted</p> <code>None</code>"},{"location":"bigtree/workflows/app_calendar/#bigtree.workflows.app_calendar.Calendar.find_event","title":"find_event","text":"<pre><code>find_event(event_name)\n</code></pre> <p>Find event by name, prints result to console</p> <p>Parameters:</p> Name Type Description Default <code>event_name</code> <code>str</code> <p>event name</p> required"},{"location":"bigtree/workflows/app_calendar/#bigtree.workflows.app_calendar.Calendar.show","title":"show","text":"<pre><code>show()\n</code></pre> <p>Show calendar, prints result to console</p>"},{"location":"bigtree/workflows/app_calendar/#bigtree.workflows.app_calendar.Calendar.to_dataframe","title":"to_dataframe","text":"<pre><code>to_dataframe()\n</code></pre> <p>Export calendar to DataFrame</p> <p>Returns:</p> Type Description <code>DataFrame</code> <p>(pd.DataFrame)</p>"},{"location":"bigtree/workflows/app_todo/","title":"\u2714\ufe0f To Do App","text":""},{"location":"bigtree/workflows/app_todo/#bigtree.workflows.app_todo","title":"bigtree.workflows.app_todo","text":""},{"location":"bigtree/workflows/app_todo/#bigtree.workflows.app_todo.AppToDo","title":"AppToDo","text":"<pre><code>AppToDo(app_name='')\n</code></pre> <p>To-Do List Implementation with Big Tree.   - To-Do List has three levels - app name, list name, and item name.   - If list name is not given, item will be assigned to a <code>General</code> list.</p> <p>Examples:</p> <p>Initializing and Adding Items</p> <pre><code>&gt;&gt;&gt; from bigtree import AppToDo\n&gt;&gt;&gt; app = AppToDo(\"To Do App\")\n&gt;&gt;&gt; app.add_item(item_name=\"Homework 1\", list_name=\"School\")\n&gt;&gt;&gt; app.add_item(item_name=[\"Milk\", \"Bread\"], list_name=\"Groceries\", description=\"Urgent\")\n&gt;&gt;&gt; app.add_item(item_name=\"Cook\")\n&gt;&gt;&gt; app.show()\nTo Do App\n\u251c\u2500\u2500 School\n\u2502   \u2514\u2500\u2500 Homework 1\n\u251c\u2500\u2500 Groceries\n\u2502   \u251c\u2500\u2500 Milk [description=Urgent]\n\u2502   \u2514\u2500\u2500 Bread [description=Urgent]\n\u2514\u2500\u2500 General\n    \u2514\u2500\u2500 Cook\n</code></pre> <p>Reorder List and Item</p> <pre><code>&gt;&gt;&gt; app.prioritize_list(list_name=\"General\")\n&gt;&gt;&gt; app.show()\nTo Do App\n\u251c\u2500\u2500 General\n\u2502   \u2514\u2500\u2500 Cook\n\u251c\u2500\u2500 School\n\u2502   \u2514\u2500\u2500 Homework 1\n\u2514\u2500\u2500 Groceries\n    \u251c\u2500\u2500 Milk [description=Urgent]\n    \u2514\u2500\u2500 Bread [description=Urgent]\n</code></pre> <pre><code>&gt;&gt;&gt; app.prioritize_item(item_name=\"Bread\")\n&gt;&gt;&gt; app.show()\nTo Do App\n\u251c\u2500\u2500 General\n\u2502   \u2514\u2500\u2500 Cook\n\u251c\u2500\u2500 School\n\u2502   \u2514\u2500\u2500 Homework 1\n\u2514\u2500\u2500 Groceries\n    \u251c\u2500\u2500 Bread [description=Urgent]\n    \u2514\u2500\u2500 Milk [description=Urgent]\n</code></pre> <p>Removing Items</p> <pre><code>&gt;&gt;&gt; app.remove_item(\"Homework 1\")\n&gt;&gt;&gt; app.show()\nTo Do App\n\u251c\u2500\u2500 General\n\u2502   \u2514\u2500\u2500 Cook\n\u2514\u2500\u2500 Groceries\n    \u251c\u2500\u2500 Bread [description=Urgent]\n    \u2514\u2500\u2500 Milk [description=Urgent]\n</code></pre> <p>Exporting and Importing List</p> <pre><code>&gt;&gt;&gt; app.save(\"assets/docstr/list.json\")\n&gt;&gt;&gt; app2 = AppToDo.load(\"assets/docstr/list.json\")\n&gt;&gt;&gt; app2.show()\nTo Do App\n\u251c\u2500\u2500 General\n\u2502   \u2514\u2500\u2500 Cook\n\u2514\u2500\u2500 Groceries\n    \u251c\u2500\u2500 Bread [description=Urgent]\n    \u2514\u2500\u2500 Milk [description=Urgent]\n</code></pre> <p>Initialize To-Do app</p> <p>Parameters:</p> Name Type Description Default <code>app_name</code> <code>str</code> <p>name of to-do app, optional</p> <code>''</code>"},{"location":"bigtree/workflows/app_todo/#bigtree.workflows.app_todo.AppToDo.add_list","title":"add_list","text":"<pre><code>add_list(list_name, **kwargs)\n</code></pre> <p>Add list to app</p> <p>If list is present, return list node, else a new list will be created</p> <p>Parameters:</p> Name Type Description Default <code>list_name</code> <code>str</code> <p>name of list</p> required <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/workflows/app_todo/#bigtree.workflows.app_todo.AppToDo.prioritize_list","title":"prioritize_list","text":"<pre><code>prioritize_list(list_name)\n</code></pre> <p>Prioritize list in app, shift it to be the first list</p> <p>Parameters:</p> Name Type Description Default <code>list_name</code> <code>str</code> <p>name of list</p> required"},{"location":"bigtree/workflows/app_todo/#bigtree.workflows.app_todo.AppToDo.add_item","title":"add_item","text":"<pre><code>add_item(item_name, list_name='', **kwargs)\n</code></pre> <p>Add items to list</p> <p>Parameters:</p> Name Type Description Default <code>item_name</code> <code>str / List[str]</code> <p>items to be added</p> required <code>list_name</code> <code>str</code> <p>list to add items to, optional</p> <code>''</code>"},{"location":"bigtree/workflows/app_todo/#bigtree.workflows.app_todo.AppToDo.remove_item","title":"remove_item","text":"<pre><code>remove_item(item_name, list_name='')\n</code></pre> <p>Remove items from list</p> <p>Parameters:</p> Name Type Description Default <code>item_name</code> <code>str / List[str]</code> <p>items to be added</p> required <code>list_name</code> <code>str</code> <p>list to add items to, optional</p> <code>''</code>"},{"location":"bigtree/workflows/app_todo/#bigtree.workflows.app_todo.AppToDo.prioritize_item","title":"prioritize_item","text":"<pre><code>prioritize_item(item_name)\n</code></pre> <p>Prioritize item in list, shift it to be the first item in list</p> <p>Parameters:</p> Name Type Description Default <code>item_name</code> <code>str</code> <p>name of item</p> required"},{"location":"bigtree/workflows/app_todo/#bigtree.workflows.app_todo.AppToDo.show","title":"show","text":"<pre><code>show(**kwargs)\n</code></pre> <p>Print tree to console</p>"},{"location":"bigtree/workflows/app_todo/#bigtree.workflows.app_todo.AppToDo.load","title":"load  <code>staticmethod</code>","text":"<pre><code>load(json_path)\n</code></pre> <p>Load To-Do app from json</p> <p>Parameters:</p> Name Type Description Default <code>json_path</code> <code>str</code> <p>json load path</p> required <p>Returns:</p> Type Description <code>AppToDo</code> <p>(Self)</p>"},{"location":"bigtree/workflows/app_todo/#bigtree.workflows.app_todo.AppToDo.save","title":"save","text":"<pre><code>save(json_path)\n</code></pre> <p>Save To-Do app as json</p> <p>Parameters:</p> Name Type Description Default <code>json_path</code> <code>str</code> <p>json save path</p> required"},{"location":"demo/","title":"\ud83d\udccb Demonstration","text":""},{"location":"demo/binarytree/","title":"\ud83d\udccb Binary Tree Demonstration","text":"<p>Compared to nodes in tree, nodes in Binary Tree are only allowed maximum of 2 children. Since BinaryNode extends from Node, construct, traverse, search, export methods from Node are applicable to Binary Tree as well.</p>"},{"location":"demo/binarytree/#construct-binary-tree","title":"Construct Binary Tree","text":""},{"location":"demo/binarytree/#1-from-binarynode","title":"1. From BinaryNode","text":"<p>BinaryNode can be linked to each other with <code>parent</code>, <code>children</code>, <code>left</code>, and <code>right</code> setter methods, or using bitshift operator with the convention <code>parent_node &gt;&gt; child_node</code> or <code>child_node &lt;&lt; parent_node</code>.</p> <pre><code>from bigtree import BinaryNode, tree_to_dot\n\ne = BinaryNode(5)\nd = BinaryNode(4)\nc = BinaryNode(3)\nb = BinaryNode(2, left=d, right=e)\na = BinaryNode(1, children=[b, c])\nf = BinaryNode(6, parent=c)\ng = BinaryNode(7, parent=c)\nh = BinaryNode(8, parent=d)\n\ngraph = tree_to_dot(a, node_colour=\"gold\")\ngraph.write_png(\"assets/demo/binarytree.png\")\n</code></pre> <p></p>"},{"location":"demo/binarytree/#2-from-list","title":"2. From list","text":"<p>Construct nodes only, list has similar format as <code>heapq</code> list.</p> <pre><code>from bigtree import list_to_binarytree\n\nnums_list = [1, 2, 3, 4, 5, 6, 7, 8]\nroot = list_to_binarytree(nums_list)\nroot.show()\n# 1\n# \u251c\u2500\u2500 2\n# \u2502   \u251c\u2500\u2500 4\n# \u2502   \u2502   \u2514\u2500\u2500 8\n# \u2502   \u2514\u2500\u2500 5\n# \u2514\u2500\u2500 3\n#     \u251c\u2500\u2500 6\n#     \u2514\u2500\u2500 7\n</code></pre>"},{"location":"demo/binarytree/#traverse-binary-tree","title":"Traverse Binary Tree","text":"<p>In addition to the traversal methods in the usual tree, binary tree includes in-order traversal method.</p> <pre><code>from bigtree import (\n    inorder_iter,\n    levelorder_iter,\n    levelordergroup_iter,\n    list_to_binarytree,\n    postorder_iter,\n    preorder_iter,\n    zigzag_iter,\n    zigzaggroup_iter,\n)\n\nnums_list = [1, 2, 3, 4, 5, 6, 7, 8]\nroot = list_to_binarytree(nums_list)\nroot.show()\n# 1\n# \u251c\u2500\u2500 2\n# \u2502   \u251c\u2500\u2500 4\n# \u2502   \u2502   \u2514\u2500\u2500 8\n# \u2502   \u2514\u2500\u2500 5\n# \u2514\u2500\u2500 3\n#     \u251c\u2500\u2500 6\n#     \u2514\u2500\u2500 7\n\n[node.name for node in inorder_iter(root)]\n# ['8', '4', '2', '5', '1', '6', '3', '7']\n\n[node.name for node in preorder_iter(root)]\n# ['1', '2', '4', '8', '5', '3', '6', '7']\n\n[node.name for node in postorder_iter(root)]\n# ['8', '4', '5', '2', '6', '7', '3', '1']\n\n[node.name for node in levelorder_iter(root)]\n# ['1', '2', '3', '4', '5', '6', '7', '8']\n\n[[node.name for node in node_group] for node_group in levelordergroup_iter(root)]\n# [['1'], ['2', '3'], ['4', '5', '6', '7'], ['8']]\n\n[node.name for node in zigzag_iter(root)]\n# ['1', '3', '2', '4', '5', '6', '7', '8']\n\n[[node.name for node in node_group] for node_group in zigzaggroup_iter(root)]\n# [['1'], ['3', '2'], ['4', '5', '6', '7'], ['8']]\n</code></pre>"},{"location":"demo/dag/","title":"\ud83d\udccb DAG Demonstration","text":"<p>Compared to nodes in tree, nodes in DAG are able to have multiple parents.</p>"},{"location":"demo/dag/#construct-dag","title":"Construct DAG","text":""},{"location":"demo/dag/#1-from-dagnode","title":"1. From DAGNode","text":"<p>DAGNodes can be linked to each other in the following ways:</p> <ul> <li>Using <code>parents</code> and <code>children</code> setter methods</li> <li>Directly passing <code>parents</code> or <code>children</code> argument</li> <li>Using bitshift operator with the convention <code>parent_node &gt;&gt; child_node</code> or <code>child_node &lt;&lt; parent_node</code></li> </ul> <pre><code>from bigtree import DAGNode, dag_to_dot\n\na = DAGNode(\"a\")\nb = DAGNode(\"b\")\nc = DAGNode(\"c\", parents=[a, b])\nd = DAGNode(\"d\", parents=[a, c])\ne = DAGNode(\"e\", parents=[d])\nf = DAGNode(\"f\", parents=[c, d])\nh = DAGNode(\"h\")\ng = DAGNode(\"g\", parents=[c], children=[h])\n\ngraph = dag_to_dot(a, node_colour=\"gold\")\ngraph.write_png(\"assets/demo/dag.png\")\n</code></pre> <p></p>"},{"location":"demo/dag/#2-from-list","title":"2. From list","text":"<p>Construct nodes only, list contains parent-child tuples.</p> <pre><code>from bigtree import list_to_dag, dag_iterator\n\nrelations_list = [(\"a\", \"c\"), (\"a\", \"d\"), (\"b\", \"c\"), (\"c\", \"d\"), (\"d\", \"e\")]\ndag = list_to_dag(relations_list)\n\nprint([(parent.node_name, child.node_name) for parent, child in dag_iterator(dag)])\n# [('a', 'd'), ('c', 'd'), ('d', 'e'), ('a', 'c'), ('b', 'c')]\n</code></pre>"},{"location":"demo/dag/#3-from-nested-dictionary","title":"3. From nested dictionary","text":"<p>Construct nodes with attributes, <code>key</code>: child name, <code>value</code>: dict of parent name, child node attributes.</p> <pre><code>from bigtree import dict_to_dag, dag_iterator\n\nrelation_dict = {\n    \"a\": {\"step\": 1},\n    \"b\": {\"step\": 1},\n    \"c\": {\"parents\": [\"a\", \"b\"], \"step\": 2},\n    \"d\": {\"parents\": [\"a\", \"c\"], \"step\": 2},\n    \"e\": {\"parents\": [\"d\"], \"step\": 3},\n}\ndag = dict_to_dag(relation_dict, parent_key=\"parents\")\n\nprint([(parent.node_name, child.node_name) for parent, child in dag_iterator(dag)])\n# [('a', 'd'), ('c', 'd'), ('d', 'e'), ('a', 'c'), ('b', 'c')]\n</code></pre>"},{"location":"demo/dag/#4-from-pandas-dataframe","title":"4. From pandas DataFrame","text":"<p>Construct nodes with attributes, pandas DataFrame contains child column, parent column, and attribute columns.</p> <pre><code>import pandas as pd\nfrom bigtree import dataframe_to_dag, dag_iterator\n\npath_data = pd.DataFrame(\n    [\n        [\"a\", None, 1],\n        [\"b\", None, 1],\n        [\"c\", \"a\", 2],\n        [\"c\", \"b\", 2],\n        [\"d\", \"a\", 2],\n        [\"d\", \"c\", 2],\n        [\"e\", \"d\", 3],\n    ],\n    columns=[\"child\", \"parent\", \"step\"],\n)\ndag = dataframe_to_dag(path_data)\n\nprint([(parent.node_name, child.node_name) for parent, child in dag_iterator(dag)])\n# [('a', 'd'), ('c', 'd'), ('d', 'e'), ('a', 'c'), ('b', 'c')]\n</code></pre>"},{"location":"demo/dag/#dag-attributes-and-operations","title":"DAG Attributes and Operations","text":"<p>Note that using <code>DAGNode</code> as superclass inherits the default class attributes (properties) and operations (methods).</p> <pre><code>from bigtree import list_to_dag\n\nrelations_list = [(\"a\", \"c\"), (\"a\", \"d\"), (\"b\", \"c\"), (\"c\", \"d\"), (\"d\", \"e\")]\ndag = list_to_dag(relations_list)\ndag\n# DAGNode(d, )\n\n# Accessing children\nnode_e = dag[\"e\"]\nnode_a = dag.parents[0]\n</code></pre> <p>Below are the tables of attributes available to <code>DAGNode</code> class.</p> Attributes wrt self Code Returns Check if root <code>node_a.is_root</code> True Check if leaf node <code>dag.is_leaf</code> False Get node name (only for <code>Node</code>) <code>dag.node_name</code> 'd' Attributes wrt structure Code Returns Get child/children <code>node_a.children</code> (DAGNode(c, ), DAGNode(d, )) Get parents <code>dag.parents</code> (DAGNode(a, ), DAGNode(c, )) Get siblings <code>dag.siblings</code> (DAGNode(c, ),) Get ancestors <code>dag.ancestors</code> [DAGNode(a, ), DAGNode(b, ), DAGNode(c, )] Get descendants <code>dag.descendants</code> [DAGNode(e, )] <p>Below is the table of operations available to <code>DAGNode</code> class.</p> Operations Code Returns Get node information <code>dag.describe(exclude_prefix=\"_\")</code> [('name', 'd')] Find path(s) from one node to another <code>node_a.go_to(dag)</code> [[DAGNode(a, ), DAGNode(c, ), DAGNode(d, description=dag-tag)], [DAGNode(a, ), DAGNode(d, description=dag-tag)]] Set attribute(s) <code>dag.set_attrs({\"description\": \"dag-tag\"})</code> None Get attribute <code>dag.get_attr(\"description\")</code> 'dag-tag' Copy DAG <code>dag.copy()</code> None"},{"location":"demo/tree/","title":"\ud83d\udccb Tree Demonstration","text":"<p>Here are some codes to get started.</p>"},{"location":"demo/tree/#construct-tree","title":"Construct Tree","text":"<p>Nodes can have attributes if they are initialized from <code>Node</code>, dictionary, or pandas DataFrame.</p>"},{"location":"demo/tree/#1-from-node","title":"1. From Node","text":"<p>Nodes can be linked to each other in the following ways:</p> <ul> <li>Using <code>parent</code> and <code>children</code> setter methods</li> <li>Directly passing <code>parent</code> or <code>children</code> argument</li> <li>Using bitshift operator with the convention <code>parent &gt;&gt; child</code> or <code>child &lt;&lt; parent</code></li> <li>Using <code>.append(child)</code> or <code>.extend([child1, child2])</code> methods</li> </ul> <code>parent</code> and <code>children</code> setter methods<code>parent</code> or <code>children</code> argumentBitshift operator<code>append</code> and <code>extend</code> <pre><code>from bigtree import Node, tree_to_dot\n\nroot = Node(\"a\")\nb = Node(\"b\")\nc = Node(\"c\")\nd = Node(\"d\")\n\nroot.children = [b, c]\nd.parent = b\n\nroot.show()\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u2514\u2500\u2500 d\n# \u2514\u2500\u2500 c\n\nroot.hshow()\n#      \u250c\u2500 b \u2500\u2500\u2500 d\n# \u2500 a \u2500\u2524\n#      \u2514\u2500 c\n\ngraph = tree_to_dot(root, node_colour=\"gold\")\ngraph.write_png(\"assets/demo/tree.png\")\n</code></pre> <pre><code>from bigtree import Node\n\nb = Node(\"b\")\nc = Node(\"c\")\nd = Node(\"d\", parent=b)\nroot = Node(\"a\", children=[b, c])\n</code></pre> <pre><code>from bigtree import Node\n\nroot = Node(\"a\")\nb = Node(\"b\")\nc = Node(\"c\")\nd = Node(\"d\")\n\nroot &gt;&gt; b\nroot &gt;&gt; c\nd &lt;&lt; b\n</code></pre> <pre><code>from bigtree import Node\n\nroot = Node(\"a\")\nb = Node(\"b\")\nc = Node(\"c\")\nd = Node(\"d\")\n\nroot.extend([b, c])\nb.append(d)\n</code></pre> <p></p>"},{"location":"demo/tree/#2-from-str","title":"2. From str","text":"<p>Construct nodes only. Newick string notation supports parsing attributes.</p> Tree stringNewick string <pre><code>from bigtree import str_to_tree\n\ntree_str = \"\"\"\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n\"\"\"\nroot = str_to_tree(tree_str)\n\nroot.show()\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u251c\u2500\u2500 d\n# \u2502   \u2514\u2500\u2500 e\n# \u2502       \u251c\u2500\u2500 g\n# \u2502       \u2514\u2500\u2500 h\n# \u2514\u2500\u2500 c\n#     \u2514\u2500\u2500 f\n</code></pre> <pre><code>from bigtree import newick_to_tree\n\nnewick_str = \"((d,(g,h)e)b,(f)c)a\"\nroot = newick_to_tree(newick_str)\n\nroot.show()\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u251c\u2500\u2500 d\n# \u2502   \u2514\u2500\u2500 e\n# \u2502       \u251c\u2500\u2500 g\n# \u2502       \u2514\u2500\u2500 h\n# \u2514\u2500\u2500 c\n#     \u2514\u2500\u2500 f\n</code></pre>"},{"location":"demo/tree/#3-from-list","title":"3. From list","text":"<p>Construct nodes only. List can contain either full paths or tuples of parent-child names.</p> Full pathsParent-child names <pre><code>from bigtree import list_to_tree\n\nroot = list_to_tree([\"a/b/d\", \"a/c\"])\n\nroot.show()\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u2514\u2500\u2500 d\n# \u2514\u2500\u2500 c\n</code></pre> <pre><code>from bigtree import list_to_tree_by_relation\n\nroot = list_to_tree_by_relation([(\"a\", \"b\"), (\"a\", \"c\"), (\"b\", \"d\")])\n\nroot.show()\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u2514\u2500\u2500 d\n# \u2514\u2500\u2500 c\n</code></pre>"},{"location":"demo/tree/#4-from-nested-dictionary","title":"4. From nested dictionary","text":"<p>Construct nodes with attributes. Dictionary can be in a flat structure where <code>key</code> is path and <code>value</code> is dictionary of node attribute names and values, or in a recursive structure where <code>key</code> is node attribute names and <code>value</code> is node attribute values, and list of children (recursive).</p> Flat structureRecursive structure <pre><code>from bigtree import dict_to_tree\n\npath_dict = {\n   \"a\": {\"age\": 90},\n   \"a/b\": {\"age\": 65},\n   \"a/c\": {\"age\": 60},\n   \"a/b/d\": {\"age\": 40},\n}\nroot = dict_to_tree(path_dict)\n\nroot.show(attr_list=[\"age\"])\n# a [age=90]\n# \u251c\u2500\u2500 b [age=65]\n# \u2502   \u2514\u2500\u2500 d [age=40]\n# \u2514\u2500\u2500 c [age=60]\n</code></pre> <pre><code>from bigtree import nested_dict_to_tree\n\npath_dict = {\n   \"name\": \"a\",\n   \"age\": 90,\n   \"children\": [\n      {\n         \"name\": \"b\",\n         \"age\": 65,\n         \"children\": [\n            {\"name\": \"d\", \"age\": 40},\n         ],\n      },\n      {\"name\": \"c\", \"age\": 60},\n   ],\n}\nroot = nested_dict_to_tree(path_dict)\n\nroot.show(attr_list=[\"age\"])\n# a [age=90]\n# \u251c\u2500\u2500 b [age=65]\n# \u2502   \u2514\u2500\u2500 d [age=40]\n# \u2514\u2500\u2500 c [age=60]\n</code></pre>"},{"location":"demo/tree/#5-from-pandas-dataframe","title":"5. From pandas DataFrame","text":"<p>Construct nodes with attributes. Pandas DataFrame can contain either path column or parent-child columns. Other columns can be used to specify attributes.</p> Path columnParent-child columns <pre><code>import pandas as pd\n\nfrom bigtree import dataframe_to_tree\n\ndata = pd.DataFrame(\n   [\n      [\"a\", 90],\n      [\"a/b\", 65],\n      [\"a/c\", 60],\n      [\"a/b/d\", 40],\n   ],\n   columns=[\"path\", \"age\"],\n)\nroot = dataframe_to_tree(data)\n\nroot.show(attr_list=[\"age\"])\n# a [age=90]\n# \u251c\u2500\u2500 b [age=65]\n# \u2502   \u2514\u2500\u2500 d [age=40]\n# \u2514\u2500\u2500 c [age=60]\n</code></pre> <pre><code>import pandas as pd\n\nfrom bigtree import dataframe_to_tree_by_relation\n\ndata = pd.DataFrame(\n   [\n      [\"a\", None, 90],\n      [\"b\", \"a\", 65],\n      [\"c\", \"a\", 60],\n      [\"d\", \"b\", 40],\n   ],\n   columns=[\"child\", \"parent\", \"age\"],\n)\nroot = dataframe_to_tree_by_relation(data)\n\nroot.show(attr_list=[\"age\"])\n# a [age=90]\n# \u251c\u2500\u2500 b [age=65]\n# \u2502   \u2514\u2500\u2500 d [age=40]\n# \u2514\u2500\u2500 c [age=60]\n</code></pre> <p>Note</p> <p>If tree is already created, nodes can still be added using path string, dictionary, and pandas DataFrame! Attributes can be added to existing nodes using a dictionary or pandas DataFrame.</p>"},{"location":"demo/tree/#print-tree","title":"Print Tree","text":"<p>After tree is constructed, it can be viewed by printing to console using <code>show</code> or <code>hshow</code> method directly, for vertical and horizontal orientation respectively. Alternatively, the <code>print_tree</code> or <code>hprint_tree</code> method can be used.</p> <pre><code>from bigtree import Node, print_tree, hprint_tree\n\nroot = Node(\"a\", age=90, gender=\"F\")\nb = Node(\"b\", age=65, gender=\"M\", parent=root)\nc = Node(\"c\", age=60, gender=\"M\", parent=root)\nd = Node(\"d\", age=40, gender=\"F\", parent=b)\ne = Node(\"e\", age=35, gender=\"M\", parent=b)\nprint_tree(root) # (1)!\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u251c\u2500\u2500 d\n# \u2502   \u2514\u2500\u2500 e\n# \u2514\u2500\u2500 c\n\nhprint_tree(root) # (2)!\n#            \u250c\u2500 d\n#      \u250c\u2500 b \u2500\u2524\n# \u2500 a \u2500\u2524     \u2514\u2500 e\n#      \u2514\u2500 c\n\n# Print subtree\nprint_tree(root, node_name_or_path=\"b\")\n# b\n# \u251c\u2500\u2500 d\n# \u2514\u2500\u2500 e\n\nprint_tree(root, max_depth=2)\n# a\n# \u251c\u2500\u2500 b\n# \u2514\u2500\u2500 c\n\n# Print attributes\nprint_tree(root, attr_list=[\"age\"])\n# a [age=90]\n# \u251c\u2500\u2500 b [age=65]\n# \u2502   \u251c\u2500\u2500 d [age=40]\n# \u2502   \u2514\u2500\u2500 e [age=35]\n# \u2514\u2500\u2500 c [age=60]\n\nprint_tree(root, attr_list=[\"age\"], attr_bracket=[\"*(\", \")\"])\n# a *(age=90)\n# \u251c\u2500\u2500 b *(age=65)\n# \u2502   \u251c\u2500\u2500 d *(age=40)\n# \u2502   \u2514\u2500\u2500 e *(age=35)\n# \u2514\u2500\u2500 c *(age=60)\n\nprint_tree(root, all_attrs=True)\n# a [age=90, gender=F]\n# \u251c\u2500\u2500 b [age=65, gender=M]\n# \u2502   \u251c\u2500\u2500 d [age=40, gender=F]\n# \u2502   \u2514\u2500\u2500 e [age=35, gender=M]\n# \u2514\u2500\u2500 c [age=60, gender=M]\n\n# Available styles\nprint_tree(root, style=\"ansi\")\n# a\n# |-- b\n# |   |-- d\n# |   `-- e\n# `-- c\n\nprint_tree(root, style=\"ascii\")\n# a\n# |-- b\n# |   |-- d\n# |   +-- e\n# +-- c\n\nprint_tree(root, style=\"const\")\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u251c\u2500\u2500 d\n# \u2502   \u2514\u2500\u2500 e\n# \u2514\u2500\u2500 c\n\nprint_tree(root, style=\"const_bold\")\n# a\n# \u2523\u2501\u2501 b\n# \u2503   \u2523\u2501\u2501 d\n# \u2503   \u2517\u2501\u2501 e\n# \u2517\u2501\u2501 c\n\nprint_tree(root, style=\"rounded\")\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u251c\u2500\u2500 d\n# \u2502   \u2570\u2500\u2500 e\n# \u2570\u2500\u2500 c\n\nprint_tree(root, style=\"double\")\n# a\n# \u2560\u2550\u2550 b\n# \u2551   \u2560\u2550\u2550 d\n# \u2551   \u255a\u2550\u2550 e\n# \u255a\u2550\u2550 c\n\nprint_tree(\n    root,\n    style=\"custom\",\n    custom_style=(\"\u2502  \", \"\u251c\u2192 \", \"\u2570\u2192 \"),\n)\n# a\n# \u251c\u2192 b\n# \u2502  \u251c\u2192 d\n# \u2502  \u2570\u2192 e\n# \u2570\u2192 c\n</code></pre> <ol> <li>Alternatively, <code>root.show()</code> can be used</li> <li>Alternatively, <code>root.hshow()</code> can be used</li> </ol>"},{"location":"demo/tree/#tree-attributes-and-operations","title":"Tree Attributes and Operations","text":"<p>Note that using <code>BaseNode</code> or <code>Node</code> as superclass inherits the default class attributes (properties) and operations (methods).</p> <pre><code>from bigtree import str_to_tree\n\n# Initialize tree\ntree_str = \"\"\"\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u251c\u2500\u2500 e\n\u2502   \u2514\u2500\u2500 f\n\u2502       \u251c\u2500\u2500 h\n\u2502       \u2514\u2500\u2500 i\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 g\n\"\"\"\nroot = str_to_tree(tree_str)\n\n# Accessing children\nnode_b = root[\"b\"]\nnode_e = root[\"b\"][\"e\"]\n</code></pre> <p>Below are the tables of attributes available to <code>BaseNode</code> and <code>Node</code> classes.</p> Attributes wrt self Code Returns Check if root <code>root.is_root</code> True Check if leaf node <code>root.is_leaf</code> False Check diameter of tree <code>node_b.diameter</code> 3 Check depth of node <code>node_b.depth</code> 2 Check depth of tree <code>node_b.max_depth</code> 4 Get root of tree <code>node_b.root</code> Node(/a, ) Get node path <code>node_b.node_path</code> (Node(/a, ), Node(/a/b, )) Get node name (only for <code>Node</code>) <code>node_b.node_name</code> 'b' Get node path name (only for <code>Node</code>) <code>node_b.path_name</code> '/a/b' Attributes wrt structure Code Returns Get child/children <code>root.children</code> (Node(/a/b, ), Node(/a/c, )) Get parent <code>node_e.parent</code> Node(/a/b, ) Get siblings <code>node_e.siblings</code> (Node(/a/b/d, ), Node(/a/b/f, )) Get left sibling <code>node_e.left_sibling</code> Node(/a/b/d, ) Get right sibling <code>node_e.right_sibling</code> Node(/a/b/f, ) Get ancestors (lazy evaluation) <code>list(node_e.ancestors)</code> [Node(/a/b, ), Node(/a, )] Get descendants (lazy evaluation) <code>list(node_b.descendants)</code> [Node(/a/b/d, ), Node(/a/b/e, ), Node(/a/b/f, ), Node(/a/b/f/h, ), Node(/a/b/f/i, )] Get leaves (lazy evaluation) <code>list(node_b.leaves)</code> [Node(/a/b/d, ), Node(/a/b/e, ), Node(/a/b/f/h, ), Node(/a/b/f/i, )] <p>Below is the table of operations available to <code>BaseNode</code> and <code>Node</code> classes.</p> Operations Code Returns Visualize tree (only for <code>Node</code>) <code>root.show()</code> None Visualize tree (horizontally) (only for <code>Node</code>) <code>root.hshow()</code> None Get node information <code>root.describe(exclude_prefix=\"_\")</code> [('name', 'a')] Find path from one node to another <code>root.go_to(node_e)</code> [Node(/a, ), Node(/a/b, ), Node(/a/b/e, )] Add child to node <code>root.append(Node(\"j\"))</code> None Add multiple children to node <code>root.extend([Node(\"k\"), Node(\"l\")])</code> None Set attribute(s) <code>root.set_attrs({\"description\": \"root-tag\"})</code> None Get attribute <code>root.get_attr(\"description\")</code> 'root-tag' Copy tree <code>root.copy()</code> None Sort children <code>root.sort(key=lambda node: node.node_name, reverse=True)</code> None"},{"location":"demo/tree/#traverse-tree","title":"Traverse Tree","text":"<p>Tree can be traversed using the following traversal methods.</p> <pre><code>from bigtree import (\n    Node,\n    levelorder_iter,\n    levelordergroup_iter,\n    postorder_iter,\n    preorder_iter,\n    zigzag_iter,\n    zigzaggroup_iter,\n)\n\nroot = Node(\"a\")\nb = Node(\"b\", parent=root)\nc = Node(\"c\", parent=root)\nd = Node(\"d\", parent=b)\ne = Node(\"e\", parent=b)\nroot.show()\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u251c\u2500\u2500 d\n# \u2502   \u2514\u2500\u2500 e\n# \u2514\u2500\u2500 c\n\n[node.name for node in preorder_iter(root)]\n# ['a', 'b', 'd', 'e', 'c']\n\n[node.name for node in postorder_iter(root)]\n# ['d', 'e', 'b', 'c', 'a']\n\n[node.name for node in levelorder_iter(root)]\n# ['a', 'b', 'c', 'd', 'e']\n\n[[node.name for node in node_group] for node_group in levelordergroup_iter(root)]\n# [['a'], ['b', 'c'], ['d', 'e']]\n\n[node.name for node in zigzag_iter(root)]\n# ['a', 'c', 'b', 'd', 'e']\n\n[[node.name for node in node_group] for node_group in zigzaggroup_iter(root)]\n# [['a'], ['c', 'b'], ['d', 'e']]\n</code></pre>"},{"location":"demo/tree/#modify-tree","title":"Modify Tree","text":"<p>Nodes can be shifted (with or without replacement) or copied (without replacement) from one path to another, this changes the tree in-place. Nodes can also be copied (with or without replacement) between two different trees.</p> Shift nodes <pre><code>from bigtree import list_to_tree, shift_nodes, shift_and_replace_nodes\n\nroot = list_to_tree(\n    [\"Downloads/Pictures\", \"Downloads/photo1.jpg\", \"Downloads/file1.doc\"]\n)\nroot.show()\n# Downloads\n# \u251c\u2500\u2500 Pictures\n# \u251c\u2500\u2500 photo1.jpg\n# \u2514\u2500\u2500 file1.doc\n\nshift_nodes(\n   tree=root,\n   from_paths=[\"photo1.jpg\", \"Downloads/file1.doc\"],\n   to_paths=[\"Downloads/Pictures/photo1.jpg\", \"Downloads/Files/file1.doc\"],\n)\nroot.show()\n# Downloads\n# \u251c\u2500\u2500 Pictures\n# \u2502   \u2514\u2500\u2500 photo1.jpg (1)\n# \u2514\u2500\u2500 Files\n#     \u2514\u2500\u2500 file1.doc (2)\n\nshift_and_replace_nodes(\n   tree=root,\n   from_paths=[\"Downloads/Files\"],\n   to_paths=[\"Downloads/Pictures/photo1.jpg\"],\n)\nroot.show()\n# Downloads\n# \u2514\u2500\u2500 Pictures\n#     \u2514\u2500\u2500 Files (3)\n#         \u2514\u2500\u2500 file1.doc\n</code></pre> <ol> <li>The first shift to destination <code>Downloads/Pictures/photo1.jpg</code></li> <li>The second shift to destination <code>Downloads/Files/file1.doc</code>, this creates intermediate Node <code>Files</code> as well</li> <li>Shift and replace <code>photo1.jpg</code> with <code>Files</code> folder</li> </ol> Copy nodes <pre><code>from bigtree import list_to_tree, copy_nodes\n\nroot = list_to_tree(\n    [\"Downloads/Pictures\", \"Downloads/photo1.jpg\", \"Downloads/file1.doc\"]\n)\nroot.show()\n# Downloads\n# \u251c\u2500\u2500 Pictures\n# \u251c\u2500\u2500 photo1.jpg\n# \u2514\u2500\u2500 file1.doc\n\ncopy_nodes(\n   tree=root,\n   from_paths=[\"photo1.jpg\", \"Downloads/file1.doc\"],\n   to_paths=[\"Downloads/Pictures/photo1.jpg\", \"Downloads/Files/file1.doc\"],\n)\nroot.show()\n# Downloads\n# \u251c\u2500\u2500 Pictures\n# \u2502   \u2514\u2500\u2500 photo1.jpg (1)\n# \u251c\u2500\u2500 photo1.jpg (2)\n# \u251c\u2500\u2500 file1.doc (4)\n# \u2514\u2500\u2500 Files\n#     \u2514\u2500\u2500 file1.doc (3)\n</code></pre> <ol> <li>The first copy to destination <code>Downloads/Pictures/photo1.jpg</code></li> <li>Original <code>photo1.jpg</code> still remains</li> <li>The second copy to destination <code>Downloads/Files/file1.doc</code>, this creates intermediate Node <code>Files</code> as well</li> <li>Original <code>file1.doc</code> still remains</li> </ol> Copy nodes between two trees <pre><code>from bigtree import (\n    Node,\n    copy_nodes_from_tree_to_tree,\n    copy_and_replace_nodes_from_tree_to_tree,\n    list_to_tree,\n)\n\nroot = list_to_tree(\n    [\"Downloads/Pictures\", \"Downloads/photo1.jpg\", \"Downloads/file1.doc\"]\n)\nroot.show()\n# Downloads\n# \u251c\u2500\u2500 Pictures\n# \u251c\u2500\u2500 photo1.jpg\n# \u2514\u2500\u2500 file1.doc\n\nroot_other = Node(\"Documents\")\ncopy_nodes_from_tree_to_tree(\n    from_tree=root,\n    to_tree=root_other,\n    from_paths=[\"Downloads/Pictures\", \"photo1.jpg\", \"file1.doc\"],\n    to_paths=[\n        \"Documents/Pictures\",\n        \"Documents/Pictures/photo1.jpg\",\n        \"Documents/Files/file1.doc\",\n    ],\n)\nroot_other.show()\n# Documents\n# \u251c\u2500\u2500 Pictures (1)\n# \u2502   \u2514\u2500\u2500 photo1.jpg (2)\n# \u2514\u2500\u2500 Files\n#     \u2514\u2500\u2500 file1.doc (3)\n\nroot_other = Node(\"Documents\")\npicture_folder = Node(\"Pictures\", parent=root_other)\nphoto2 = Node(\"photo2.jpg\", parent=picture_folder)\nfile2 = Node(\"file2.doc\", parent=root_other)\nroot_other.show()\n# Documents\n# \u251c\u2500\u2500 Pictures\n# \u2502   \u2514\u2500\u2500 photo2.jpg\n# \u2514\u2500\u2500 file2.doc\n\ncopy_and_replace_nodes_from_tree_to_tree(\n    from_tree=root,\n    to_tree=root_other,\n    from_paths=[\"Downloads/photo1.jpg\", \"Downloads/file1.doc\"],\n    to_paths=[\"Documents/Pictures/photo2.jpg\", \"Documents/file2.doc\"],\n)\nroot_other.show()\n# Documents\n# \u251c\u2500\u2500 Pictures\n# \u2502   \u2514\u2500\u2500 photo1.jpg (4)\n# \u2514\u2500\u2500 file1.doc (5)\n</code></pre> <ol> <li>The first copy to destination <code>Documents/Pictures</code></li> <li>The second copy to destination <code>Documents/Pictures/photo1.jpg</code></li> <li>The third copy to destination <code>Documents/Files/file1.doc</code>, this creates intermediate Node <code>Files</code> as well</li> <li>The first copy and replace of <code>Documents/Pictures/photo2.jpg</code> with <code>photo1.jpg</code></li> <li>The second copy and replace of <code>Documents/file2.doc</code> with <code>file1.doc</code></li> </ol>"},{"location":"demo/tree/#tree-search","title":"Tree Search","text":"<p>One or multiple nodes can be searched based on name, path, attribute value, or user-defined condition. It is also possible to search for one or more child node(s) based on attributes, this search will be faster as it does not require traversing the whole tree to find the node(s).</p> Find single nodeFind multiple nodesFind child nodes <pre><code>from bigtree import Node, find, find_name, find_path, find_relative_path, find_full_path, find_attr\nroot = Node(\"a\", age=90)\nb = Node(\"b\", age=65, parent=root)\nc = Node(\"c\", age=60, parent=root)\nd = Node(\"d\", age=40, parent=c)\nroot.show(attr_list=[\"age\"])\n# a [age=90]\n# \u251c\u2500\u2500 b [age=65]\n# \u2514\u2500\u2500 c [age=60]\n#     \u2514\u2500\u2500 d [age=40]\n\nfind(root, lambda node: node.age == 60)\n# Node(/a/c, age=60)\n\nfind_name(root, \"d\")\n# Node(/a/c/d, age=40)\n\nfind_relative_path(c, \"../b\")  # relative path\n# (Node(/a/b, age=65),)\n\nfind_path(root, \"/c/d\")  # partial path\n# Node(/a/c/d, age=40)\n\nfind_full_path(root, \"a/c/d\")  # full path\n# Node(/a/c/d, age=40)\n\nfind_attr(root, \"age\", 40)\n# Node(/a/c/d, age=40)\n</code></pre> <pre><code>from bigtree import Node, findall, find_names, find_relative_path, find_paths, find_attrs\nroot = Node(\"a\", age=90)\nb = Node(\"b\", age=65, parent=root)\nc = Node(\"c\", age=60, parent=root)\nd = Node(\"c\", age=40, parent=c)\nroot.show(attr_list=[\"age\"])\n# a [age=90]\n# \u251c\u2500\u2500 b [age=65]\n# \u2514\u2500\u2500 c [age=60]\n#     \u2514\u2500\u2500 c [age=40]\n\nfindall(root, lambda node: node.age &gt;= 65)\n# (Node(/a, age=90), Node(/a/b, age=65))\n\nfind_names(root, \"c\")\n# (Node(/a/c, age=60), Node(/a/c/c, age=40))\n\nfind_relative_path(c, \"../*\")  # relative path\n# (Node(/a/b, age=65), Node(/a/c, age=60))\n\nfind_paths(root, \"/c\")  # partial path\n# (Node(/a/c, age=60), Node(/a/c/c, age=40))\n\nfind_attrs(root, \"age\", 40)\n# (Node(/a/c/c, age=40),)\n</code></pre> <pre><code>from bigtree import Node, find_children, find_child, find_child_by_name\nroot = Node(\"a\", age=90)\nb = Node(\"b\", age=65, parent=root)\nc = Node(\"c\", age=60, parent=root)\nd = Node(\"c\", age=40, parent=c)\nroot.show(attr_list=[\"age\"])\n# a [age=90]\n# \u251c\u2500\u2500 b [age=65]\n# \u2514\u2500\u2500 c [age=60]\n#     \u2514\u2500\u2500 c [age=40]\n\nfind_children(root, lambda node: node.age &gt;= 60)\n# (Node(/a/b, age=65), Node(/a/c, age=60))\n\nfind_child(root, lambda node: node.name == \"c\")\n# Node(/a/c, age=60)\n\nfind_child_by_name(root, \"c\")\n# Node(/a/c, age=60)\n\nfind_child_by_name(c, \"c\")\n# Node(/a/c/c, age=40)\n</code></pre>"},{"location":"demo/tree/#helper-utility","title":"Helper Utility","text":"<p>There following are helper functions for</p>"},{"location":"demo/tree/#1-cloning-tree-to-another-node-type","title":"1. Cloning tree to another Node type","text":"<pre><code>from bigtree import BaseNode, Node, clone_tree\n\n# Cloning tree from `BaseNode` to `Node` type\nroot = BaseNode(name=\"a\")\nb = BaseNode(name=\"b\", parent=root)\nclone_tree(root, Node)\n# Node(/a, )\n</code></pre>"},{"location":"demo/tree/#2-getting-subtree-smaller-tree-with-different-root","title":"2. Getting subtree (smaller tree with different root)","text":"<pre><code>from bigtree import str_to_tree, get_subtree\n\nroot = str_to_tree(\"\"\"\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n\"\"\")\n\n# Getting subtree with root b\nroot_subtree = get_subtree(root, \"b\")\nroot_subtree.show()\n# b\n# \u251c\u2500\u2500 d\n# \u2514\u2500\u2500 e\n</code></pre>"},{"location":"demo/tree/#3-pruning-tree-smaller-tree-with-same-root","title":"3. Pruning tree (smaller tree with same root)","text":"<pre><code>from bigtree import str_to_tree, prune_tree\n\nroot = str_to_tree(\"\"\"\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n\"\"\")\n\n# Prune tree to only path a/b\nroot_pruned = prune_tree(root, \"a/b\")\nroot_pruned.show()\n# a\n# \u2514\u2500\u2500 b\n#     \u251c\u2500\u2500 d\n#     \u2514\u2500\u2500 e\n\n# Prune tree to exactly path a/b\nroot_pruned = prune_tree(root, \"a/b\", exact=True)\nroot_pruned.show()\n# a\n# \u2514\u2500\u2500 b\n</code></pre>"},{"location":"demo/tree/#4-getting-difference-between-two-trees","title":"4. Getting difference between two trees","text":"<pre><code>from bigtree import str_to_tree, get_tree_diff\n\nroot = str_to_tree(\"\"\"\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n\"\"\")\n\n# Get difference between two trees\nroot_other = str_to_tree(\"\"\"\na\n\u251c\u2500\u2500 b\n\u2502   \u2514\u2500\u2500 d\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 g\n\"\"\")\n\ntree_diff = get_tree_diff(root, root_other)\ntree_diff.show()\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u2514\u2500\u2500 e (-)\n# \u2514\u2500\u2500 c\n#     \u251c\u2500\u2500 f (-)\n#     \u2514\u2500\u2500 g (+)\n\ntree_diff = get_tree_diff(root, root_other, only_diff=False)\ntree_diff.show()\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u251c\u2500\u2500 d\n# \u2502   \u2514\u2500\u2500 e (-)\n# \u2514\u2500\u2500 c\n#     \u251c\u2500\u2500 f (-)\n#     \u2514\u2500\u2500 g (+)\n</code></pre>"},{"location":"demo/tree/#export-tree","title":"Export Tree","text":"<p>Tree can be exported to other data types:</p> <ol> <li>Newick string notation</li> <li>Nested dictionary (flat structure and recursive structure)</li> <li>pandas DataFrame</li> <li>Dot (can save to .dot, .png, .svg, .jpeg files)</li> <li>Pillow (can save to .png, .jpg)</li> <li>Mermaid Flowchart (can display on .md)</li> </ol> <pre><code>from bigtree import Node\n\nroot = Node(\"a\", age=90)\nb = Node(\"b\", age=65, parent=root)\nc = Node(\"c\", age=60, parent=root)\nd = Node(\"d\", age=40, parent=b)\ne = Node(\"e\", age=35, parent=b)\nroot.show()\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u251c\u2500\u2500 d\n# \u2502   \u2514\u2500\u2500 e\n# \u2514\u2500\u2500 c\n</code></pre> Newick string notationDictionary (flat structure)Dictionary (recursive structure)pandas DataFrameDotPillowMermaid Flowchart <pre><code>from bigtree import tree_to_newick\n\ntree_to_newick(root)\n# '((d,e)b,c)a'\n\ntree_to_newick(root, attr_list=[\"age\"])\n# '((d[&amp;&amp;NHX:age=40],e[&amp;&amp;NHX:age=35])b[&amp;&amp;NHX:age=65],c[&amp;&amp;NHX:age=60])a[&amp;&amp;NHX:age=90]'\n</code></pre> <pre><code>from bigtree import tree_to_dict\n\ntree_to_dict(\n   root,\n   name_key=\"name\",\n   parent_key=\"parent\",\n   attr_dict={\"age\": \"person age\"}\n)\n# {\n#    '/a': {'name': 'a', 'parent': None, 'person age': 90},\n#    '/a/b': {'name': 'b', 'parent': 'a', 'person age': 65},\n#    '/a/b/d': {'name': 'd', 'parent': 'b', 'person age': 40},\n#    '/a/b/e': {'name': 'e', 'parent': 'b', 'person age': 35},\n#    '/a/c': {'name': 'c', 'parent': 'a', 'person age': 60}\n# }\n</code></pre> <pre><code>from bigtree import tree_to_nested_dict\n\ntree_to_nested_dict(root, all_attrs=True)\n# {\n#    'name': 'a',\n#    'age': 90,\n#    'children': [\n#       {\n#          'name': 'b',\n#          'age': 65,\n#          'children': [\n#             {\n#                'name': 'd',\n#                'age': 40\n#             },\n#             {\n#                'name': 'e',\n#                'age': 35\n#             }\n#          ]\n#       },\n#       {\n#          'name': 'c',\n#          'age': 60\n#       }\n#    ]\n# }\n</code></pre> <pre><code>from bigtree import tree_to_dataframe\n\ntree_to_dataframe(\n   root,\n   name_col=\"name\",\n   parent_col=\"parent\",\n   path_col=\"path\",\n   attr_dict={\"age\": \"person age\"}\n)\n#      path name parent  person age\n# 0      /a    a   None          90\n# 1    /a/b    b      a          65\n# 2  /a/b/d    d      b          40\n# 3  /a/b/e    e      b          35\n# 4    /a/c    c      a          60\n</code></pre> <pre><code>from bigtree import tree_to_dot\n\ngraph = tree_to_dot(root, node_colour=\"gold\")\ngraph.write_png(\"assets/demo/dot.png\")\n</code></pre> <pre><code>from bigtree import tree_to_pillow\n\npillow_image = tree_to_pillow(root)\npillow_image.save(\"assets/demo/pillow.png\")\n</code></pre> <pre><code>from bigtree import tree_to_mermaid\n\nmermaid_md = tree_to_mermaid(root)\nprint(mermaid_md)\n</code></pre> <ul> <li>dot.png</li> </ul> <p></p> <ul> <li>pillow.png</li> </ul> <p></p> <ul> <li>Mermaid flowchart <pre><code>%%{ init: { 'flowchart': { 'curve': 'basis' } } }%%\nflowchart TB\n0(\"a\") --&gt; 0-0(\"b\")\n0-0 --&gt; 0-0-0(\"d\")\n0-0 --&gt; 0-0-1(\"e\")\n0(\"a\") --&gt; 0-1(\"c\")\nclassDef default stroke-width:1</code></pre></li> </ul>"},{"location":"demo/workflow/","title":"\ud83d\udccb Workflow Demonstration","text":"<p>There are existing implementations of workflows to showcase how <code>bigtree</code> can be used!</p>"},{"location":"demo/workflow/#to-do-application","title":"To Do Application","text":"<p>There are functions to:</p> <ul> <li>Add or remove list to To-Do application</li> <li>Add or remove item to list, default list is the 'General' list</li> <li>Prioritize a list/item by reordering them as first list/item</li> <li>Save and import To-Do application to and from an external JSON file</li> <li>Show To-Do application, which prints tree to console</li> </ul> <pre><code>from bigtree import AppToDo\n\napp = AppToDo(\"To Do App\")\napp.add_item(item_name=\"Homework 1\", list_name=\"School\")\napp.add_item(item_name=[\"Milk\", \"Bread\"], list_name=\"Groceries\", description=\"Urgent\")\napp.add_item(item_name=\"Cook\")\napp.show()\n# To Do App\n# \u251c\u2500\u2500 School\n# \u2502   \u2514\u2500\u2500 Homework 1\n# \u251c\u2500\u2500 Groceries\n# \u2502   \u251c\u2500\u2500 Milk [description=Urgent]\n# \u2502   \u2514\u2500\u2500 Bread [description=Urgent]\n# \u2514\u2500\u2500 General\n#     \u2514\u2500\u2500 Cook\n\napp.save(\"list.json\")\napp2 = AppToDo.load(\"list.json\")\n</code></pre>"},{"location":"demo/workflow/#calendar-application","title":"Calendar Application","text":"<p>There are functions to:</p> <ul> <li>Add or remove event from Calendar</li> <li>Find event by name, or name and date</li> <li>Display calendar, which prints events to console</li> <li>Export calendar to pandas DataFrame</li> </ul> <pre><code>import datetime as dt\nfrom bigtree import Calendar\n\ncalendar = Calendar(\"My Calendar\")\ncalendar.add_event(\"Gym\", \"2023-01-01 18:00\")\ncalendar.add_event(\"Dinner\", \"2023-01-01\", date_format=\"%Y-%m-%d\", budget=20)\ncalendar.add_event(\"Gym\", \"2023-01-02 18:00\")\ncalendar.show()\n# My Calendar\n# 2023-01-01 00:00:00 - Dinner (budget: 20)\n# 2023-01-01 18:00:00 - Gym\n# 2023-01-02 18:00:00 - Gym\n\ncalendar.find_event(\"Gym\")\n# 2023-01-01 18:00:00 - Gym\n# 2023-01-02 18:00:00 - Gym\n\ncalendar.delete_event(\"Gym\", dt.date(2023, 1, 1))\ncalendar.show()\n# My Calendar\n# 2023-01-01 00:00:00 - Dinner (budget: 20)\n# 2023-01-02 18:00:00 - Gym\n\ndata_calendar = calendar.to_dataframe()\ndata_calendar\n#                              path    name        date      time  budget\n# 0  /My Calendar/2023/01/01/Dinner  Dinner  2023-01-01  00:00:00    20.0\n# 1     /My Calendar/2023/01/02/Gym     Gym  2023-01-02  18:00:00     NaN\n</code></pre>"},{"location":"others/","title":"\ud83d\udca1 Tips and Tricks","text":""},{"location":"others/list_dir/","title":"List Directory","text":"<p>To list directories recursively using bigtree, we can use the <code>glob</code> built-in Python package to extract a list of paths.</p> <pre><code>import glob\nfrom bigtree import list_to_tree, print_tree\n\n# Get all directories recursively\npath_list = []\nfor f in glob.glob(\"./**/*.py\", recursive=True):\n    path_list.append(f)\n\n# Construct tree\nroot = list_to_tree(path_list)\n\n# View tree\nprint_tree(root, max_depth=3)\n</code></pre>"},{"location":"others/merging_trees/","title":"Merging Trees","text":"<p>To merge two separate trees into one, we can use the tree modify module.</p> <p>In this example, we are merging two trees that have similar node <code>Pictures</code>. Children of node <code>Pictures</code> from both trees are retained as long as <code>merge_children=True</code> is set. If only children of the other tree are desired, set <code>overriding=True</code> instead.</p> <pre><code>from bigtree import Node, copy_nodes_from_tree_to_tree\n\n# Construct trees\ndownloads_folder = Node(\"Downloads\")\npictures_folder = Node(\"Pictures\", parent=downloads_folder)\nphoto1 = Node(\"photo1.jpg\", parent=pictures_folder)\nfile1 = Node(\"file1.doc\", parent=downloads_folder)\n\ndocuments_folder = Node(\"Documents\")\npictures_folder = Node(\"Pictures\", parent=documents_folder)\nphoto2 = Node(\"photo2.jpg\", parent=pictures_folder)\n\n# Validate tree structure\ndownloads_folder.show()\n# Downloads\n# \u251c\u2500\u2500 Pictures\n# \u2502   \u2514\u2500\u2500 photo1.jpg\n# \u2514\u2500\u2500 file1.doc\n\ndocuments_folder.show()\n# Documents\n# \u2514\u2500\u2500 Pictures\n#     \u2514\u2500\u2500 photo2.jpg\n\n# Merge trees\ncopy_nodes_from_tree_to_tree(\n    from_tree=documents_folder,\n    to_tree=downloads_folder,\n    from_paths=[\"Documents/Pictures\"],\n    to_paths=[\"Downloads/Pictures\"],\n    merge_children=True,  # set overriding=True to override existing children\n)\n\n# Validate tree structure\ndownloads_folder.show()\n# Downloads\n# \u251c\u2500\u2500 Pictures\n# \u2502   \u251c\u2500\u2500 photo1.jpg\n# \u2502   \u2514\u2500\u2500 photo2.jpg\n# \u2514\u2500\u2500 file1.doc\n</code></pre>"},{"location":"others/nodes/","title":"Extending Nodes","text":"<p>Nodes can be extended from <code>BaseNode</code> or <code>Node</code> class to have extended functionalities or add pre-/post-assign checks.  - For example, <code>Node</code> class extends <code>BaseNode</code> and added the <code>name</code> functionality with pre-assign checks to ensure no duplicate path names.</p>"},{"location":"others/nodes/#population-node-add-functionalitymethodproperty","title":"Population Node (add functionality/method/property)","text":"<pre><code>from bigtree import Node, print_tree\n\n\nclass PopulationNode(Node):\n\n    def __init__(self, name: str, population: int = 0, **kwargs):\n        super().__init__(name, **kwargs)\n        self._population = population\n\n    @property\n    def population(self):\n        if self.is_leaf:\n            return self._population\n        return sum([child.population for child in self.children])\n\n    @property\n    def percentage(self):\n        if self.is_root:\n            return 1\n        return round(self.population / self.root.population, 2)\n\n\nroot = PopulationNode(\"World\")\nb1 = PopulationNode(\"Country A\", parent=root)\nc1 = PopulationNode(\"State A1\", 100, parent=b1)\nc2 = PopulationNode(\"State A2\", 50, parent=b1)\nb2 = PopulationNode(\"Country B\", 200, parent=root)\nb3 = PopulationNode(\"Country C\", 100, parent=root)\n\nprint_tree(root, attr_list=[\"population\", \"percentage\"])\n# World [population=450, percentage=1]\n# \u251c\u2500\u2500 Country A [population=150, percentage=0.33]\n# \u2502   \u251c\u2500\u2500 State A1 [population=100, percentage=0.22]\n# \u2502   \u2514\u2500\u2500 State A2 [population=50, percentage=0.11]\n# \u251c\u2500\u2500 Country B [population=200, percentage=0.44]\n# \u2514\u2500\u2500 Country C [population=100, percentage=0.22]\n</code></pre>"},{"location":"others/nodes/#read-only-node-add-pre-post-assign-checks","title":"Read-Only Node (add pre-/post-assign checks)","text":"<pre><code>import pytest\n\nfrom bigtree import Node\nfrom typing import List\n\n\nclass ReadOnlyNode(Node):\n\n    def __init__(self, *args, **kwargs):\n        self.__readonly = False\n        super().__init__(*args, **kwargs)\n        self.__readonly = True\n\n    def _Node__pre_assign_parent(self, new_parent: Node):\n        if self.__readonly:\n            raise RuntimeError(\"Nodes cannot be reassigned for ReadOnlyNode\")\n\n    def _Node__pre_assign_children(self, new_children: List[Node]):\n        if self.__readonly:\n            raise RuntimeError(\"Nodes cannot be reassigned for ReadOnlyNode\")\n\n\na = ReadOnlyNode(\"a\")\nb = ReadOnlyNode(\"b\", parent=a)\nc = ReadOnlyNode(\"c\", parent=a)\n\nwith pytest.raises(RuntimeError):\n    c.parent = b\n\nwith pytest.raises(RuntimeError):\n    a.children = [b, c]\n</code></pre>"},{"location":"others/remove_checks/","title":"Remove Tree Checks","text":"<p>Note</p> <p>Available from version 0.16.2 onwards</p> <p>When constructing trees, there are a few checks done that slow down performance. This slowness will be more apparent with very large trees. The checks are to</p> <ul> <li>Check parent/children data type</li> <li>Check for loops (expensive for trees that are deep as it checks the ancestors of node)</li> </ul> <p>These checks are enabled by default. To turn off these checks, you can set environment variable before importing <code>bigtree</code>.</p> <pre><code>import os\nos.environ[\"BIGTREE_CONF_ASSERTIONS\"] = \"\"\n\nimport bigtree\n</code></pre>"},{"location":"others/weighted_trees/","title":"Trees with Weighted Edges","text":"<p>Edge weights should be defined in the child node for the parent-child edge since each node can only have one parent.</p> <p>We can simply add <code>weight</code> attribute to the <code>Node</code> class. However, if we want to visualize the weighted tree, we can create a <code>WeightedNode</code> class to generate the edge attribute dictionary.</p> <pre><code>from bigtree import Node, tree_to_dot\n\nclass WeightedNode(Node):\n    def __init__(self, name, weight=0, **kwargs):\n        super().__init__(name, **kwargs)\n        self.weight = weight\n\n    @property\n    def edge_attr(self):\n        \"\"\"Edge attribute for pydot diagram\n        Label for edge label, penwidth for edge width\n        \"\"\"\n        return {\"label\": self.weight, \"penwidth\": self.weight}\n\n# Construct weighted tree\nroot = WeightedNode(\"a\")\nb = WeightedNode(\"b\", parent=root, weight=1)\nc = WeightedNode(\"c\", parent=root, weight=2)\nd = WeightedNode(\"d\", parent=b, weight=3)\n\ngraph = tree_to_dot(root, node_colour=\"gold\", edge_attr=\"edge_attr\")\ngraph.write_png(\"assets/docs/weighted_tree.png\")\n</code></pre> <p></p>"},{"location":"resources/","title":"\ud83d\udcf0 Resources","text":""},{"location":"resources/articles/","title":"\ud83d\udcf0 Articles","text":"<ul> <li> Python Tree Implementation with BigTree <p>Integrating trees with Python lists, dictionaries, and pandas DataFrames</p> <p> Read article</p> </li> </ul> <ul> <li> The Reingold Tilford Algorithm Explained, with Walkthrough <p>Algorithm to Plot Tree Nodes with Numerical Examples and Python Code</p> <p> Read article</p> </li> </ul>"}]}
\ No newline at end of file
+{"config":{"lang":["en"],"separator":"[\\s\\-]+","pipeline":["stopWordFilter"]},"docs":[{"location":"","title":"\ud83c\udf33 Documentation","text":"<p>Tree Implementation and Methods for Python, integrated with Python list, dictionary, and pandas DataFrame.</p> <p>It is pythonic, making it easy to learn and extendable to many types of workflows.</p> <ul> <li> Set up in 2 minutes <p>Install <code>bigtree</code> with <code>pip</code> or <code>conda</code> and get up   and running in minutes</p> <p> Getting started</p> </li> </ul> <ul> <li> Getting started <p>View demonstration on how to use <code>bigtree</code></p> <p> Reference</p> </li> </ul> <ul> <li> Resources <p>Articles relating to trees and <code>bigtree</code></p> <p> View articles</p> </li> </ul> <ul> <li> Support bigtree <p>Do support if you like this project!</p> <p> Support me</p> </li> </ul> <p>Related Links:</p> <ul> <li>Community: Issues / Discussions</li> <li>Package: PyPI / Conda</li> </ul>"},{"location":"benchmarks/","title":"\u23f0 Benchmarks","text":""},{"location":"binarytree/","title":"\ud83c\udf35 Binary Tree","text":"<p>For Binary Tree implementation, there are 3 main components. Binary Node inherits from Node, so the components in Tree implementation are also available in Binary Tree.</p>"},{"location":"binarytree/#node","title":"\ud83c\udf3f Node","text":"<ul> <li><code>BinaryNode</code>, Node with binary tree rules</li> </ul>"},{"location":"binarytree/#constructing-binary-tree","title":"\u2728 Constructing Binary Tree","text":"<ul> <li>From list, using flattened list structure</li> </ul>"},{"location":"binarytree/#traversing-binary-tree","title":"\u27b0 Traversing Binary Tree","text":"<ul> <li>In-Order Traversal</li> </ul>"},{"location":"changelog/","title":"\ud83c\udf42 Changelog","text":"<p>All notable changes to this project will be documented in this file.</p> <p>The format is based on Keep a Changelog, and this project adheres to Semantic Versioning.</p>"},{"location":"changelog/#unreleased","title":"Unreleased","text":""},{"location":"changelog/#0180-2024-05-28","title":"0.18.0 - 2024-05-28","text":""},{"location":"changelog/#added","title":"Added:","text":"<ul> <li>Tree Constructor: Polars method <code>polars_to_tree</code>, <code>polars_to_tree_by_relation</code>, <code>add_polars_to_tree_by_path</code>, and <code>add_polars_to_tree_by_name</code>.</li> <li>Tree Exporter: Polars method <code>tree_to_polars</code>.</li> </ul>"},{"location":"changelog/#fixed","title":"Fixed:","text":"<ul> <li>Misc: Documentation to update mkdocs-material version for social plugin.</li> <li>Misc: Update links in README.</li> <li>Misc: Fix mypy typing.</li> </ul>"},{"location":"changelog/#0172-2024-04-24","title":"0.17.2 - 2024-04-24","text":""},{"location":"changelog/#changed","title":"Changed:","text":"<ul> <li>DAG Constructor: <code>list_to_dag</code> and <code>dict_to_dag</code> does not rely on <code>dataframe_to_dag</code> as pandas dataframe operation is phased out.</li> </ul>"},{"location":"changelog/#fixed_1","title":"Fixed:","text":"<ul> <li>DAG Constructor: Handle cases where reserved keywords are part of attribute upon creation and throw error accordingly.</li> <li>[#224] Tree/DAG Constructor: Null checks to not interpret 0 as null, this affects <code>dataframe_to_tree_by_relation</code>, <code>add_dataframe_to_tree_by_path</code>, <code>add_dataframe_to_tree_by_name</code>, <code>dataframe_to_tree</code>, and <code>dataframe_to_dag</code>. This will also affect showing/printing of trees when <code>attr_omit_null</code> is set to True.</li> </ul>"},{"location":"changelog/#0171-2024-04-23","title":"0.17.1 - 2024-04-23","text":""},{"location":"changelog/#fixed_2","title":"Fixed","text":"<ul> <li>[#222] Tree Constructor: <code>dataframe_to_tree_by_relation</code> duplicate root node name error message to handle different data types.</li> <li>Misc: Update links in README.</li> </ul>"},{"location":"changelog/#0170-2024-04-04","title":"0.17.0 - 2024-04-04","text":""},{"location":"changelog/#added_1","title":"Added","text":"<ul> <li>Misc: Group tests for benchmark timings to compare the timings by multiplier more effectively.</li> </ul>"},{"location":"changelog/#changed_1","title":"Changed","text":"<ul> <li>Tree Constructor: <code>add_dict_to_tree_by_name</code> and <code>add_dataframe_to_tree_by_name</code> modifies tree in-place instead of returning new tree, and does not accept <code>join_type</code> as argument as pandas dataframe operation is phased out. If there are clashing attributes, only those that have values will be replaced. This might not be backwards-compatible!</li> <li>Tree Constructor: <code>dataframe_to_tree</code> no longer relies on <code>add_dataframe_to_tree_by_path</code> as it performs assertion checks twice. This leads to 5% improvement in timings for a tree with 10000 nodes, averaged across 10 runs.</li> <li>Misc: Abstract out assertion checks for empty dataframe and duplicate attribute.</li> <li>Misc: Abstract out logic for checking null and filtering attributes.</li> <li>Misc: Optimization in dictionary and dataframe operations.</li> </ul>"},{"location":"changelog/#fixed_3","title":"Fixed","text":"<ul> <li>Tree Constructor: <code>dict_to_tree</code> no longer uses dataframe operations, leading to 33% improvement in timings for a tree with 10000 nodes, averaged across 10 runs. The resulting data type of node follows the dictionary exactly, compared to the previous dataframe operations that may change the dtypes for certain columns. This might not be backwards-compatible!</li> <li>Tree Constructor: <code>dataframe_to_tree_by_relation</code> fix root node detection logic, ignore existing name column, ignore non-attribute columns, ignore null attribute columns.</li> <li>Tree Constructor: <code>add_dataframe_to_tree_by_path</code> ignore existing name column, ignore non-attribute columns, ignore null attribute columns.</li> <li>Tree Constructor: <code>add_dataframe_to_tree_by_name</code> ignore existing name column, ignore non-attribute columns, ignore null attribute columns.</li> <li>Tree Constructor: <code>dataframe_to_tree</code> ignore existing name column, ignore non-attribute columns, ignore null attribute columns.</li> <li>DAG Constructor: <code>dataframe_to_dag</code> ignore existing name column, ignore non-attribute columns, ignore null attribute columns.</li> </ul>"},{"location":"changelog/#0164-2024-03-14","title":"0.16.4 - 2024-03-14","text":""},{"location":"changelog/#fixed_4","title":"Fixed","text":"<ul> <li>[#216] Tree Exporter: Fix nan checker when printing trees.</li> </ul>"},{"location":"changelog/#0163-2024-03-14","title":"0.16.3 - 2024-03-14","text":""},{"location":"changelog/#added_2","title":"Added","text":"<ul> <li>BaseNode: Add diameter property.</li> <li>Misc: Testing to include benchmark timings for tree creation, compare benchmark tests across commits, reject pull request if benchmark tests fails.</li> <li>Misc: Documentation to include benchmark results.</li> </ul>"},{"location":"changelog/#changed_2","title":"Changed","text":"<ul> <li>Misc: Documentation to enable zooming in of images, add navigation section headers, remove some meta tags.</li> <li>Misc: Split up testing into multiple conftest files.</li> </ul>"},{"location":"changelog/#fixed_5","title":"Fixed","text":"<ul> <li>Tree Constructor: Tree creation from dictionary adds None for empty attributes instead of np.nan.</li> <li>[#216] Tree Exporter: <code>attr_omit_null</code> to handle nan/null values in addition to checking for None.</li> </ul>"},{"location":"changelog/#0162-2024-02-06","title":"0.16.2 - 2024-02-06","text":""},{"location":"changelog/#added_3","title":"Added","text":"<ul> <li>Misc: Documentation plugin Termynal for code animation.</li> <li>Misc: Usage of <code>docstr-coverage</code>.</li> <li>Misc: Docstrings for nested functions to pass <code>docstr-coverage</code>.</li> </ul>"},{"location":"changelog/#changed_3","title":"Changed","text":"<ul> <li>[#185] BaseNode: Make assertion checks optional.</li> <li>Misc: Documentation CSS for h1 display for windows compatibility, modify the related links on main page.</li> </ul>"},{"location":"changelog/#0161-2024-01-29","title":"0.16.1 - 2024-01-29","text":""},{"location":"changelog/#fixed_6","title":"Fixed","text":"<ul> <li>Misc: Compatibility of mkdocs with readthedocs.</li> </ul>"},{"location":"changelog/#0160-2024-01-28","title":"0.16.0 - 2024-01-28","text":""},{"location":"changelog/#added_4","title":"Added","text":"<ul> <li>Misc: Documentation using mkdocs.</li> </ul>"},{"location":"changelog/#changed_4","title":"Changed","text":"<ul> <li>Misc: Markdown edit for README, CHANGELOG.</li> <li>Misc: Docstring to indicate Examples, to indicate exceptions for BaseNode and DAGNode, simplify code for tree modification.</li> </ul>"},{"location":"changelog/#fixed_7","title":"Fixed","text":"<ul> <li>Misc: Docstring bullet point alignment, images compatibility with markdown.</li> </ul>"},{"location":"changelog/#0157-2024-01-26","title":"0.15.7 - 2024-01-26","text":""},{"location":"changelog/#added_5","title":"Added","text":"<ul> <li>Misc: Sphinx documentation to support mermaid markdown images, reflect CHANGELOG section, add more emojis.</li> </ul>"},{"location":"changelog/#changed_5","title":"Changed","text":"<ul> <li>Misc: Update SEO image.</li> <li>Misc: Fix Sphinx documentation font size difference between web and mobile, include last updated date.</li> <li>Misc: Upgrade package versions in pre-commit hook.</li> </ul>"},{"location":"changelog/#fixed_8","title":"Fixed","text":"<ul> <li>Tree Exporter: <code>hprint_tree</code> and <code>hyield_tree</code> to be compatible with <code>BinaryNode</code> where child nodes can be None type.</li> </ul>"},{"location":"changelog/#0156-2024-01-20","title":"0.15.6 - 2024-01-20","text":""},{"location":"changelog/#added_6","title":"Added","text":"<ul> <li>DAGNode: Able to access and delete node children via name with square bracket accessor with <code>__getitem__</code> and <code>__delitem__</code> magic methods.</li> <li>DAGNode: Able to delete all children for a node.</li> <li>DAGNode: Able to check if node contains child node with <code>__contains__</code> magic method.</li> <li>DAGNode: Able to iterate the node to access children with <code>__iter__</code> magic method.</li> </ul>"},{"location":"changelog/#changed_6","title":"Changed","text":"<ul> <li>Tree Search: Modify type hints to include DAGNode for <code>find_children</code>, <code>find_child</code>, and <code>find_child_by_name</code>.</li> <li>Misc: Neater handling of strings for tests.</li> <li>Misc: Documentation enhancement to split README into multiple files.</li> <li>Misc: New Sphinx documentation theme.</li> </ul>"},{"location":"changelog/#0155-2024-01-17","title":"0.15.5 - 2024-01-17","text":""},{"location":"changelog/#changed_7","title":"Changed","text":"<ul> <li>Misc: Neater handling of strings for tests.</li> <li>Misc: Better examples for merging trees and weighted trees in Sphinx documentation.</li> <li>Misc: Fix links and introduce unreleased segment in CHANGELOG.</li> </ul>"},{"location":"changelog/#0154-2024-01-11","title":"0.15.4 - 2024-01-11","text":""},{"location":"changelog/#changed_8","title":"Changed","text":"<ul> <li>Tree Exporter: <code>hprint_tree</code> and <code>hyield_tree</code> to allow hiding names of intermediate node.</li> </ul>"},{"location":"changelog/#fixed_9","title":"Fixed","text":"<ul> <li>Tree Constructor: <code>newick_to_tree</code> to handle invalid closing and use of apostrophe.</li> <li>Tree Exporter: <code>tree_to_newick</code> to handle special characters by wrapping them in apostrophe.</li> </ul>"},{"location":"changelog/#0153-2024-01-08","title":"0.15.3 - 2024-01-08","text":""},{"location":"changelog/#added_7","title":"Added","text":"<ul> <li>Tree Helper: <code>get_subtree</code> method to retrieve subtree.</li> </ul>"},{"location":"changelog/#0152-2024-01-08","title":"0.15.2 - 2024-01-08","text":""},{"location":"changelog/#added_8","title":"Added","text":"<ul> <li>Tree Exporter: <code>hprint_tree</code> and <code>hyield_tree</code> to print and retrieve results for tree in horizontal orientation.</li> <li>Node: Added <code>hshow</code> method to print tree in horizontal orientation to console.</li> </ul>"},{"location":"changelog/#0151-2024-01-05","title":"0.15.1 - 2024-01-05","text":""},{"location":"changelog/#added_9","title":"Added","text":"<ul> <li>Tree Constructor: <code>newick_to_tree</code> to convert Newick notation to tree.</li> </ul>"},{"location":"changelog/#changed_9","title":"Changed","text":"<ul> <li>Tree Exporter: <code>tree_to_newick</code> to accept more parameters to parse length and attributes.</li> </ul>"},{"location":"changelog/#fixed_10","title":"Fixed","text":"<ul> <li>Misc: Automated doctest setup to use os operations instead of string operations.</li> </ul>"},{"location":"changelog/#0150-2024-01-02","title":"0.15.0 - 2024-01-02","text":""},{"location":"changelog/#added_10","title":"Added","text":"<ul> <li>Tree Exporter: Export to Newick notation with <code>tree_to_newick</code>.</li> </ul>"},{"location":"changelog/#changed_10","title":"Changed","text":"<ul> <li>Tree Helper: Pruning tree to support pruning of multiple paths (accepts list of string).</li> <li>Tree Helper: Pruning tree to support pruning of an exact path (i.e., remove descendants) with <code>exact</code> parameter, default is prune and keep descendants.</li> </ul>"},{"location":"changelog/#0148-2023-12-25","title":"0.14.8 - 2023-12-25","text":""},{"location":"changelog/#changed_11","title":"Changed","text":"<ul> <li>Tree Modifier: Enhance documentation examples.</li> <li>Workflow To Do App: Change import and export logic.</li> <li>Misc: Organize assets folder based on whether it originated from README, docstrings, or sphinx documentation.</li> <li>Misc: Rename functions in <code>plot.py</code> utils file for coverage report.</li> </ul>"},{"location":"changelog/#fixed_11","title":"Fixed","text":"<ul> <li>Misc: Fixed doctests and automate doctest checks.</li> </ul>"},{"location":"changelog/#0147-2023-12-22","title":"0.14.7 - 2023-12-22","text":""},{"location":"changelog/#changed_12","title":"Changed","text":"<ul> <li>Tree Helper: <code>get_tree_diff</code> enhanced to compare tree attributes by taking in <code>attr_list</code> parameter, and indicates difference with <code>(~)</code>.</li> </ul>"},{"location":"changelog/#fixed_12","title":"Fixed","text":"<ul> <li>Tree Helper: <code>get_tree_diff</code> compare tree structure by considering all nodes (previously only consider leaf nodes).</li> </ul>"},{"location":"changelog/#0146-2023-12-14","title":"0.14.6 - 2023-12-14","text":""},{"location":"changelog/#added_11","title":"Added","text":"<ul> <li>Node: Able to access and delete node children via name with square bracket accessor with <code>__getitem__</code> and <code>__delitem__</code> magic methods.</li> <li>BaseNode/Node/BinaryNode: Able to add one or more children with <code>append</code> and <code>extend</code> methods.</li> <li>BaseNode/Node/BinaryNode: Able to check if node contains child node with <code>__contains__</code> magic method.</li> <li>BaseNode/Node/BinaryNode: Able to iterate the node to access children with <code>__iter__</code> magic method. Results in children setter to only accept list/tuple/set instead of iterable types.</li> </ul>"},{"location":"changelog/#changed_13","title":"Changed","text":"<ul> <li>Tree Exporter: <code>tree_to_dot</code> accepts callable to set node and edge attrs for custom node (backward-compatible).</li> <li>Tree Exporter: <code>tree_to_mermaid</code> accepts callable to set node shape attr, edge arrow attr and node attr for custom node (backward-compatible).</li> <li>Tree Exporter: Change delimiter for <code>tree_to_mermaid</code> to prevent possible path confusion (backward-compatible).</li> <li>Misc: Code abstraction for assertion checks and constants.</li> <li>Misc: Documentation for exporting tree/dag to dot.</li> </ul>"},{"location":"changelog/#0145-2023-11-24","title":"0.14.5 - 2023-11-24","text":""},{"location":"changelog/#changed_14","title":"Changed","text":"<ul> <li>Misc: Update SECURITY file.</li> <li>Misc: Documentation enhancement to add more emoji, and highlight code blocks.</li> </ul>"},{"location":"changelog/#0144-2023-11-04","title":"0.14.4 - 2023-11-04","text":""},{"location":"changelog/#changed_15","title":"Changed","text":"<ul> <li>Misc: Clean up github actions.</li> </ul>"},{"location":"changelog/#0143-2023-10-31","title":"0.14.3 - 2023-10-31","text":""},{"location":"changelog/#added_12","title":"Added","text":"<ul> <li>Misc: Publish to conda, enable automated publishing to conda-forge in addition to existing PyPI.</li> <li>Misc: Tree demonstration code for <code>shift_and_replace_nodes</code> and <code>copy_and_replace_nodes_from_tree_to_tree</code> in README.</li> </ul>"},{"location":"changelog/#0142-2023-10-21","title":"0.14.2 - 2023-10-21","text":""},{"location":"changelog/#added_13","title":"Added","text":"<ul> <li>Misc: RTD integration.</li> <li>Misc: Enable manual publishing of python package.</li> </ul>"},{"location":"changelog/#0141-2023-10-18","title":"0.14.1 - 2023-10-18","text":""},{"location":"changelog/#added_14","title":"Added","text":"<ul> <li>Misc: Changes to main branch checks if the latest version exists (using git tag) before publishing package and building documentation.</li> </ul>"},{"location":"changelog/#0140-2023-10-18","title":"0.14.0 - 2023-10-18","text":""},{"location":"changelog/#added_15","title":"Added","text":"<ul> <li>Tree Modifier: Shift nodes with replacement of to-node with <code>shift_and_replace_nodes</code>.</li> <li>Tree Modifier: Copy nodes from tree to tree with replacement of to-node with <code>copy_and_replace_nodes_from_tree_to_tree</code>.</li> <li>Tree Modifier: Any permutation of configuration with replacement of to-node with <code>replace_logic</code>.</li> <li>Tree Modifier: Add relevant test cases and documentations accordingly.</li> </ul>"},{"location":"changelog/#0133-2023-10-17","title":"0.13.3 - 2023-10-17","text":""},{"location":"changelog/#added_16","title":"Added","text":"<ul> <li>Misc: Add automatic release notes with content into GitHub workflow.</li> </ul>"},{"location":"changelog/#0132-2023-10-17","title":"0.13.2 - 2023-10-17","text":""},{"location":"changelog/#added_17","title":"Added","text":"<ul> <li>Misc: Add automatic release notes into GitHub workflow.</li> </ul>"},{"location":"changelog/#0131-2023-10-15","title":"0.13.1 - 2023-10-15","text":""},{"location":"changelog/#added_18","title":"Added","text":"<ul> <li>Misc: Add automatic comment on code coverage to pull requests into GitHub workflow.</li> <li>Misc: Add more checks into pre-commit.</li> </ul>"},{"location":"changelog/#0130-2023-09-29","title":"0.13.0 - 2023-09-29","text":""},{"location":"changelog/#added_19","title":"Added","text":"<ul> <li>Tree Exporter: Export tree to flowchart diagram in mermaid markdown format using <code>tree_to_mermaid</code>.</li> </ul>"},{"location":"changelog/#changed_16","title":"Changed","text":"<ul> <li>Tree Exporter: Relax type hinting using TypeVar for <code>clone_tree</code>.</li> <li>Tree Helper: Accept Iterable instead of List for custom_style attribute of <code>yield_tree</code> and <code>print_tree</code>.</li> <li>Misc: Fix docstring for better presentation of code vs variable vs normal text.</li> </ul>"},{"location":"changelog/#0125-2023-09-26","title":"0.12.5 - 2023-09-26","text":""},{"location":"changelog/#added_20","title":"Added","text":"<ul> <li>Utility Groot: Add test cases.</li> </ul>"},{"location":"changelog/#fixed_13","title":"Fixed","text":"<ul> <li>Tree Exporter: <code>tree_to_pillow</code> function to reference online font file instead of relative path.</li> </ul>"},{"location":"changelog/#0124-2023-09-25","title":"0.12.4 - 2023-09-25","text":""},{"location":"changelog/#added_21","title":"Added","text":"<ul> <li>Utility Groot: Add groot utility functions.</li> </ul>"},{"location":"changelog/#0123-2023-09-17","title":"0.12.3 - 2023-09-17","text":""},{"location":"changelog/#changed_17","title":"Changed","text":"<ul> <li>Clearer documentation, fixed docstring phrasing and spelling.</li> <li>Clearer error messages, standardized error messages.</li> </ul>"},{"location":"changelog/#0122-2023-09-12","title":"0.12.2 - 2023-09-12","text":""},{"location":"changelog/#changed_18","title":"Changed","text":"<ul> <li>Tree Plot: Reingold Tilford Algorithm code for succinctness and docstring.</li> </ul>"},{"location":"changelog/#0121-2023-09-11","title":"0.12.1 - 2023-09-11","text":""},{"location":"changelog/#fixed_14","title":"Fixed","text":"<ul> <li>Tree Plot: Reingold Tilford Algorithm to handle cases of negative x-coordinates with adjustment parameter.</li> </ul>"},{"location":"changelog/#0120-2023-09-09","title":"0.12.0 - 2023-09-09","text":""},{"location":"changelog/#changed_19","title":"Changed","text":"<ul> <li>Tree/DAG Constructor, Tree/DAG Exporter: Make <code>pandas</code> optional dependency.</li> </ul>"},{"location":"changelog/#fixed_15","title":"Fixed","text":"<ul> <li>Misc: Fixed Calendar workflow to throw error when <code>to_dataframe</code> method is called on empty calendar.</li> <li>Tree/DAGNode Exporter, Tree Helper, Tree Search: Relax type hinting using TypeVar.</li> </ul>"},{"location":"changelog/#0110-2023-09-08","title":"0.11.0 - 2023-09-08","text":""},{"location":"changelog/#added_22","title":"Added","text":"<ul> <li>Tree Helper: Pruning tree to allow pruning by <code>prune_path</code> and <code>max_depth</code>.</li> <li>Tree Plot: Implement Enhanced Reingold Tilford Algorithm to retrieve (x, y) coordinates for a tree structure.</li> </ul>"},{"location":"changelog/#changed_20","title":"Changed","text":"<ul> <li>BaseNode/DAGNode: <code>get_attr</code> method to allow default return value.</li> </ul>"},{"location":"changelog/#fixed_16","title":"Fixed","text":"<ul> <li>Utility Iterator: Relax type hinting using TypeVar.</li> </ul>"},{"location":"changelog/#0103-2023-08-12","title":"0.10.3 - 2023-08-12","text":""},{"location":"changelog/#added_23","title":"Added","text":"<ul> <li>Tree Constructor: <code>add_path_to_tree</code>, <code>dataframe_to_tree</code>, <code>dataframe_to_tree_by_relation</code> to allow custom node types that takes in constructor arguments.</li> </ul>"},{"location":"changelog/#changed_21","title":"Changed","text":"<ul> <li>Binary Tree: Able to accept node val of <code>str</code> type besides <code>int</code> type.</li> </ul>"},{"location":"changelog/#0102-2023-08-11","title":"0.10.2 - 2023-08-11","text":""},{"location":"changelog/#fixed_17","title":"Fixed","text":"<ul> <li>Tree Constructor: <code>nested_dict_to_tree</code> to throw TypeError if child_key is not list type.</li> </ul>"},{"location":"changelog/#0101-2023-07-27","title":"0.10.1 - 2023-07-27","text":""},{"location":"changelog/#added_24","title":"Added","text":"<ul> <li>[#71] Node: <code>path_name</code> to allow different node name of different dtypes; map everything to string type.</li> </ul>"},{"location":"changelog/#0100-2023-07-15","title":"0.10.0 - 2023-07-15","text":""},{"location":"changelog/#added_25","title":"Added","text":"<ul> <li>[#65] Tree Search: Implement <code>find_relative_path</code> to find relative path from node.</li> <li>[#65] Utility Iterator: Implement <code>zigzag_iter</code> and <code>zigzaggroup_iter</code> Tree traversal methods.</li> </ul>"},{"location":"changelog/#095-2023-07-13","title":"0.9.5 - 2023-07-13","text":""},{"location":"changelog/#added_26","title":"Added","text":"<ul> <li>Misc: Added init files, add link to discussions to README and pyproject, add sphinx coverage shortcuts.</li> </ul>"},{"location":"changelog/#fixed_18","title":"Fixed","text":"<ul> <li>[#66] DAGNode/Node: Children constructor to allow Iterable types, fixed issue of lists being mutable.</li> <li>[#67] Node: <code>path_name</code> to reduce number of recursive calls to root node for <code>sep</code>.</li> </ul>"},{"location":"changelog/#094-2023-06-18","title":"0.9.4 - 2023-06-18","text":""},{"location":"changelog/#added_27","title":"Added","text":"<ul> <li>Tree Constructor: <code>list_to_tree_by_relation</code> and <code>dataframe_to_tree_by_relation</code> method to allow duplicate intermediate nodes (default is false).</li> <li>DAG Exporter: Added <code>node_shape</code> parameter in <code>dag_to_dot</code> export function for easier way to customize node shape.</li> <li>Misc: More test cases.</li> <li>Misc: Added security instructions on how to raise vulnerabilities.</li> <li>Misc: Added Calendar workflow to documentation.</li> </ul>"},{"location":"changelog/#changed_22","title":"Changed","text":"<ul> <li>Tree Constructor: <code>add_dict_to_tree_by_name</code> method rename argument from <code>path_attrs</code> to <code>name_attrs</code>.</li> <li>Misc: Modified contributing instructions.</li> </ul>"},{"location":"changelog/#fixed_19","title":"Fixed","text":"<ul> <li>Tree Exporter: <code>tree_to_dot</code> to handle cases when not all nodes have <code>edge_attr</code>.</li> <li>DAG Exporter: <code>dag_to_dot</code> to perform dictionary copy to prevent style from being overridden for child nodes.</li> <li>Tree Constructor: <code>dataframe_to_tree</code> to handle case when path column is not the first column.</li> </ul>"},{"location":"changelog/#093-2023-05-28","title":"0.9.3 - 2023-05-28","text":""},{"location":"changelog/#changed_23","title":"Changed","text":"<ul> <li>Tree Constructor: Relax type hint to <code>Iterable</code> instead of <code>List</code> for <code>list_to_tree</code> and <code>list_to_tree_by_relation</code> methods.</li> </ul>"},{"location":"changelog/#fixed_20","title":"Fixed","text":"<ul> <li>Node: Fix error message when trees have different <code>sep</code>.</li> </ul>"},{"location":"changelog/#092-2023-04-09","title":"0.9.2 - 2023-04-09","text":""},{"location":"changelog/#added_28","title":"Added","text":"<ul> <li>Node: Added <code>show</code> method to print tree to console.</li> <li>Workflow Calendar: Tree use case with calendar implementation.</li> </ul>"},{"location":"changelog/#091-2023-03-30","title":"0.9.1 - 2023-03-30","text":""},{"location":"changelog/#changed_24","title":"Changed","text":"<ul> <li>Node: Added <code>sep</code> parameter to constructor instead of using getter and setter methods to set <code>sep</code>.</li> </ul>"},{"location":"changelog/#090-2023-03-29","title":"0.9.0 - 2023-03-29","text":""},{"location":"changelog/#added_29","title":"Added","text":"<ul> <li>Tree Modifier: Ability to copy/shift nodes with full path in <code>from_paths</code> for faster search performance, added <code>with_full_path</code> parameter.</li> </ul>"},{"location":"changelog/#changed_25","title":"Changed","text":"<ul> <li>Tree Modifier: Enforced paths in <code>to_paths</code> to be full path for faster search performance.</li> <li>Tree Modifier: Faster creation of intermediate parent nodes in <code>to_paths</code>.</li> <li>Tree Modifier: Better handling of <code>sep</code> in paths by performing string replacement at the start.</li> <li>Tree Modifier: Check and throw error for invalid parameters, case when node is meant to be deleted but <code>copy=True</code>.</li> </ul>"},{"location":"changelog/#fixed_21","title":"Fixed","text":"<ul> <li>Tree Modifier: Fix issue trailing <code>sep</code> differing in <code>from_paths</code> and <code>to_paths</code> which should not throw error.</li> </ul>"},{"location":"changelog/#084-2023-03-24","title":"0.8.4 - 2023-03-24","text":""},{"location":"changelog/#added_30","title":"Added","text":"<ul> <li>Tree Search: Implement <code>find_child</code> and <code>find_children</code> to find single child or multiple children based on user-defined condition.</li> </ul>"},{"location":"changelog/#changed_26","title":"Changed","text":"<ul> <li>Tree and DAG Constructor: Reduce reliance on <code>numpy</code> package, only reject <code>None</code> attributes when creating tree from DataFrame (previously it rejects <code>[None]</code>).</li> <li>Tree Helper: Get difference between two trees reduce reliance on <code>numpy</code> package, enhance test cases.</li> <li>Tree Search: Renamed <code>find_children</code> to <code>find_child_by_name</code> for clarity.</li> <li>Misc: Fix README for Windows installation.</li> </ul>"},{"location":"changelog/#083-2023-03-16","title":"0.8.3 - 2023-03-16","text":""},{"location":"changelog/#changed_27","title":"Changed","text":"<ul> <li>Workflow: Misc refactor and update log statements.</li> <li>Misc: Fix coverage report.</li> </ul>"},{"location":"changelog/#082-2023-03-16","title":"0.8.2 - 2023-03-16","text":""},{"location":"changelog/#changed_28","title":"Changed","text":"<ul> <li>Misc: Type checking to remove optional requirement for <code>mypy</code>.</li> <li>Misc: Shift .flake8, .mypy.ini, and pytest.ini files to pyproject.toml.</li> </ul>"},{"location":"changelog/#081-2023-03-10","title":"0.8.1 - 2023-03-10","text":""},{"location":"changelog/#fixed_22","title":"Fixed","text":"<ul> <li>Tree Modifier: Fix issue of <code>sep</code> of tree differing from the <code>sep</code> in <code>from_paths</code> and <code>to_paths</code>.</li> </ul>"},{"location":"changelog/#080-2023-03-10","title":"0.8.0 - 2023-03-10","text":""},{"location":"changelog/#added_31","title":"Added","text":"<ul> <li>Misc: Type checking with <code>mypy</code>, added type checks to pre-commit hooks.</li> </ul>"},{"location":"changelog/#changed_29","title":"Changed","text":"<ul> <li>DAGNode: <code>go_to</code> method to be consistent with <code>List[List[DAGNode]]</code> type.</li> </ul>"},{"location":"changelog/#fixed_23","title":"Fixed","text":"<ul> <li>Tree Exporter: Exception handling in <code>yield_tree</code> if <code>node_name_or_path</code> is not found.</li> <li>Workflow: Exception handling in prioritizing item/list if item/list is not the correct tree depth.</li> <li>Workflow: Exception handling in removing item/list if item/list is not found.</li> </ul>"},{"location":"changelog/#074-2023-02-27","title":"0.7.4 - 2023-02-27","text":""},{"location":"changelog/#fixed_24","title":"Fixed","text":"<ul> <li>Tree Constructor: Fixed pandas SettingwithCopyWarning when performing dataframe operations.</li> </ul>"},{"location":"changelog/#073-2023-02-25","title":"0.7.3 - 2023-02-25","text":""},{"location":"changelog/#added_32","title":"Added","text":"<ul> <li>Tree Exporter: Fixed <code>print_tree</code> checking attributes with <code>hasattr</code> to handle cases of null or 0 value attributes, add more test cases.</li> <li>Misc: Added more description to Contributing.</li> </ul>"},{"location":"changelog/#072-2023-02-18","title":"0.7.2 - 2023-02-18","text":""},{"location":"changelog/#added_33","title":"Added","text":"<ul> <li>Tree Exporter: Added <code>node_shape</code> parameter in <code>tree_to_dot</code> export function for easier way to customize node shape.</li> </ul>"},{"location":"changelog/#071-2023-02-18","title":"0.7.1 - 2023-02-18","text":""},{"location":"changelog/#added_34","title":"Added","text":"<ul> <li>BaseNode/Node: Added <code>go_to</code> BaseNode method to travel from one node to another node from the same tree.</li> <li>DAGNode: Added <code>go_to</code> DAGNode method to travel from one node to another node from the same DAG.</li> </ul>"},{"location":"changelog/#070-2023-02-18","title":"0.7.0 - 2023-02-18","text":""},{"location":"changelog/#added_35","title":"Added","text":"<ul> <li>Tree Modifier: Accept <code>merge_leaves</code> type of modification, enhance documentation to provide more examples and illustrations.</li> </ul>"},{"location":"changelog/#0610-2023-01-23","title":"0.6.10 - 2023-01-23","text":""},{"location":"changelog/#fixed_25","title":"Fixed","text":"<ul> <li>Tree Constructor: <code>str_to_tree</code> accept prefixes to support unicode characters in node names.</li> </ul>"},{"location":"changelog/#069-2023-01-22","title":"0.6.9 - 2023-01-22","text":""},{"location":"changelog/#added_36","title":"Added","text":"<ul> <li>Tree Construct: <code>str_to_tree</code> to construct tree from tree string.</li> </ul>"},{"location":"changelog/#068-2023-01-14","title":"0.6.8 - 2023-01-14","text":""},{"location":"changelog/#fixed_26","title":"Fixed","text":"<ul> <li>Tree Exporter: <code>tree_to_dot</code> to perform dictionary copy to prevent style from being overridden for child nodes.</li> </ul>"},{"location":"changelog/#067-2023-01-09","title":"0.6.7 - 2023-01-09","text":""},{"location":"changelog/#changed_30","title":"Changed","text":"<ul> <li>Binary Tree: Changed <code>BNode</code> to <code>BinaryNode</code>, and construct method <code>list_to_btree</code> to <code>list_to_binarytree</code>.</li> </ul>"},{"location":"changelog/#066-2022-12-15","title":"0.6.6 - 2022-12-15","text":""},{"location":"changelog/#added_37","title":"Added","text":"<ul> <li>Tree Exporter: Export <code>print_tree</code> output to image using Pillow package.</li> </ul>"},{"location":"changelog/#065-2022-12-07","title":"0.6.5 - 2022-12-07","text":""},{"location":"changelog/#added_38","title":"Added","text":"<ul> <li>Tree Modifier: Shift/copy nodes able to shift node-only and delete the children (backwards-compatible).</li> </ul>"},{"location":"changelog/#064-2022-11-16","title":"0.6.4 - 2022-11-16","text":""},{"location":"changelog/#fixed_27","title":"Fixed","text":"<ul> <li>BNode: Minor fix on rollback functionality when original children includes None.</li> </ul>"},{"location":"changelog/#063-2022-11-15","title":"0.6.3 - 2022-11-15","text":""},{"location":"changelog/#added_39","title":"Added","text":"<ul> <li>DAGNode: Rollback functionality to original state when there is error setting parent and children (backwards-compatible).</li> </ul>"},{"location":"changelog/#changed_31","title":"Changed","text":"<ul> <li>BaseNode, BNode, DAGNode: Refactor by abstracting checks.</li> </ul>"},{"location":"changelog/#fixed_28","title":"Fixed","text":"<ul> <li>BaseNode: Fix rollback logic to handle failure in pre-assign checks and reassigning same child / parent.</li> <li>BNode: Fix issue of reassigning children shifting existing child from right to left.</li> </ul>"},{"location":"changelog/#062-2022-11-15","title":"0.6.2 - 2022-11-15","text":""},{"location":"changelog/#changed_32","title":"Changed","text":"<ul> <li>Tree Modifier: Shorter logging messages.</li> </ul>"},{"location":"changelog/#061-2022-11-14","title":"0.6.1 - 2022-11-14","text":""},{"location":"changelog/#changed_33","title":"Changed","text":"<ul> <li>Tree Modifier: Handle shifting/copying that removes intermediate layer (backwards-compatible).</li> </ul>"},{"location":"changelog/#060-2022-11-13","title":"0.6.0 - 2022-11-13","text":""},{"location":"changelog/#added_40","title":"Added","text":"<ul> <li>BaseNode: Rollback functionality to original state when there is error setting parent and children (backwards-compatible).</li> <li>BaseNode and DAGNode: Type hints.</li> <li>BNode: Node class for Binary Tree.</li> <li>BTree Constructor: From list.</li> <li>BNode Iterator: Level-Order Iterator.</li> <li>Misc: Add Tips and Tricks to documentation (List Directory).</li> </ul>"},{"location":"changelog/#fixed_29","title":"Fixed","text":"<ul> <li>DAGNode: Fix issue of duplicate parent constructor creating duplicate children.</li> </ul>"},{"location":"changelog/#055-2022-11-12","title":"0.5.5 - 2022-11-12","text":""},{"location":"changelog/#added_41","title":"Added","text":"<ul> <li>Misc: More docstring examples.</li> <li>Misc: More test cases.</li> </ul>"},{"location":"changelog/#fixed_30","title":"Fixed","text":"<ul> <li>Tree Modifier: Fix issue with <code>merge_children</code> argument not working as expected.</li> </ul>"},{"location":"changelog/#054-2022-11-12","title":"0.5.4 - 2022-11-12","text":""},{"location":"changelog/#added_42","title":"Added","text":"<ul> <li>BaseNode: Add sort() to sort children.</li> <li>Node: Made more extendable with pre-/post-assign checks.</li> <li>Misc: Add Tips and Tricks to documentation (Extending Nodes).</li> <li>Misc: More test cases.</li> </ul>"},{"location":"changelog/#fixed_31","title":"Fixed","text":"<ul> <li>Tree Search: Type hints.</li> </ul>"},{"location":"changelog/#053-2022-11-11","title":"0.5.3 - 2022-11-11","text":""},{"location":"changelog/#added_43","title":"Added","text":"<ul> <li>DAG and Tree Exporter: More customizations allowed on edges.</li> <li>Add Tips and Tricks to documentation (Weighted Trees, Merging Trees).</li> </ul>"},{"location":"changelog/#fixed_32","title":"Fixed","text":"<ul> <li>Tree Modifier: Fix issue with <code>merge_children</code> argument not working as expected.</li> </ul>"},{"location":"changelog/#052-2022-11-10","title":"0.5.2 - 2022-11-10","text":""},{"location":"changelog/#fixed_33","title":"Fixed","text":"<ul> <li>Tree Constructor: Fix issue <code>dataframe_to_tree_by_relation</code> unable to find parent node.</li> </ul>"},{"location":"changelog/#051-2022-11-09","title":"0.5.1 - 2022-11-09","text":""},{"location":"changelog/#added_44","title":"Added","text":"<ul> <li>Misc: Clean codes and documentation.</li> </ul>"},{"location":"changelog/#050-2022-11-09","title":"0.5.0 - 2022-11-09","text":""},{"location":"changelog/#added_45","title":"Added","text":"<ul> <li>Misc: Clean codes and documentation.</li> </ul>"},{"location":"changelog/#changed_34","title":"Changed","text":"<ul> <li>Tree Exporter: Printing tree to group multiple arguments together.</li> <li>DAG and Tree Exporter: Export to dot able to plot multiple disjointed trees/dags, rename <code>bgcolor</code> to <code>bg_colour</code>.</li> </ul>"},{"location":"changelog/#046-2022-11-09","title":"0.4.6 - 2022-11-09","text":""},{"location":"changelog/#added_46","title":"Added","text":"<ul> <li>Tree Constructor: From DataFrame of parent-child columns.</li> </ul>"},{"location":"changelog/#changed_35","title":"Changed","text":"<ul> <li>Tree Exporter: Printing tree to define node name or path, and default to const style.</li> <li>Tree Constructor: Rename <code>list_to_tree_tuples</code> to <code>list_to_tree_by_relation</code>.</li> <li>Tree Constructor: Remove parameter <code>sep</code> for <code>nested_dict_to_tree</code>.</li> </ul>"},{"location":"changelog/#045-2022-11-08","title":"0.4.5 - 2022-11-08","text":""},{"location":"changelog/#changed_36","title":"Changed","text":"<ul> <li>Tree Exporter: Printing tree with added ability to omit null attributes.</li> </ul>"},{"location":"changelog/#044-2022-11-08","title":"0.4.4 - 2022-11-08","text":""},{"location":"changelog/#fixed_34","title":"Fixed","text":"<ul> <li>Tree Constructor: Handle adding attributes that are array-like - add array even when one of the items is null.</li> </ul>"},{"location":"changelog/#043-2022-11-08","title":"0.4.3 - 2022-11-08","text":""},{"location":"changelog/#added_47","title":"Added","text":"<ul> <li>Node: Print format for BaseNode.</li> </ul>"},{"location":"changelog/#042-2022-11-08","title":"0.4.2 - 2022-11-08","text":""},{"location":"changelog/#fixed_35","title":"Fixed","text":"<ul> <li>Tree Constructor: For list of tuples, handle cases where parent name is None.</li> </ul>"},{"location":"changelog/#041-2022-11-07","title":"0.4.1 - 2022-11-07","text":""},{"location":"changelog/#fixed_36","title":"Fixed","text":"<ul> <li>Tree Constructor: Handle adding attributes that are array-like - error in drop_duplicate() and pd.isnull().</li> </ul>"},{"location":"changelog/#040-2022-11-07","title":"0.4.0 - 2022-11-07","text":""},{"location":"changelog/#added_48","title":"Added","text":"<ul> <li>Tree Constructor: From list of tuples of parent-child.</li> </ul>"},{"location":"changelog/#033-2022-11-07","title":"0.3.3 - 2022-11-07","text":""},{"location":"changelog/#added_49","title":"Added","text":"<ul> <li>DAG Exporter: To list, nested dictionary, pandas DataFrame.</li> </ul>"},{"location":"changelog/#changed_37","title":"Changed","text":"<ul> <li>BaseNode and DAGNode: Modify docstring.</li> <li>Tree Exporter: Support Nodes with same name.</li> <li>Tree Modifier: Modify docstring.</li> <li>Utility Iterator: Modify docstring.</li> </ul>"},{"location":"changelog/#032-2022-11-07","title":"0.3.2 - 2022-11-07","text":""},{"location":"changelog/#fixed_37","title":"Fixed","text":"<ul> <li>Tree Exporter: Fix edge direction error.</li> </ul>"},{"location":"changelog/#031-2022-11-07","title":"0.3.1 - 2022-11-07","text":""},{"location":"changelog/#added_50","title":"Added","text":"<ul> <li>Tree and DAG Exporter: More customizations for Node to dot and DAGNode to dot.</li> </ul>"},{"location":"changelog/#030-2022-11-05","title":"0.3.0 - 2022-11-05","text":""},{"location":"changelog/#added_51","title":"Added","text":"<ul> <li>DAG Constructor: From list, nested dictionary, pandas DataFrame.</li> <li>Utility Iterator: DAG traversal methods.</li> </ul>"},{"location":"changelog/#changed_38","title":"Changed","text":"<ul> <li>Tree Exporter and DAG Exporter: More customizations for Node to dot and DAGNode to dot.</li> </ul>"},{"location":"changelog/#020-2022-11-03","title":"0.2.0 - 2022-11-03","text":""},{"location":"changelog/#added_52","title":"Added","text":"<ul> <li>Node: DAGNode for creating DAG graph.</li> <li>Tree Exporter: Support Node to dot which can export to png, svg, jpeg, dot files.</li> <li>DAG Exporter: Support DAGNode to dot.</li> </ul>"},{"location":"changelog/#010-2022-11-01","title":"0.1.0 - 2022-11-01","text":""},{"location":"changelog/#added_53","title":"Added","text":"<ul> <li>Node: Node and BaseNode.</li> <li>Tree Constructor: From list, nested dictionary, pandas DataFrame.</li> <li>Tree Exporter: To list, nested dictionary, pandas DataFrame.</li> <li>Tree Helper: Cloning, pruning trees, get difference between two trees.</li> <li>Tree Modifier: Shift and copy nodes within tree and between trees.</li> <li>Tree Search: Find single or multiple nodes based on name, attribute, or custom criteria.</li> <li>Utility Iterator: Tree traversal methods.</li> <li>Workflow To Do App: Tree use case with to-do list implementation.</li> </ul>"},{"location":"contributing/","title":"\ud83c\udf6a Contributing","text":"<p>bigtree is a tree implementation package for Python. It integrates with Python lists, dictionaries, and pandas DataFrame.</p> <p>Thank you for taking the time to contribute. Contributing to this package is an excellent opportunity to dive into tree implementations.</p>"},{"location":"contributing/#set-up","title":"Set Up","text":"<p>First, fork the repository and clone the forked repository.</p> <pre><code>$ git clone git@github.com:&lt;your-username&gt;/bigtree.git\n</code></pre> <p>Next, create a virtual environment and activate it.</p> <pre><code>$ conda create -n bigtree_venv python=3.10\n$ conda activate bigtree_venv\n</code></pre> <p>To check if it worked,</p> <pre><code>$ which pip\n/&lt;some directory&gt;/envs/bigtree_venv/bin/pip\n</code></pre> <p>From the project folder, install the required python packages locally in editable mode and set up pre-commit checks.</p> <pre><code>$ python -m pip install -e \".[all]\"\n$ python -m pip install pre-commit\n$ pre-commit install\n</code></pre>"},{"location":"contributing/#developing","title":"Developing","text":"<p>After making your changes, create a new branch, add and commit your changed files. In this example, lets assume the changed file is <code>README.md</code>. If there are any pre-commit changes and/or comments, do modify, re-add and re-commit your files.</p> <pre><code>$ git checkout -b chore/update-readme\n$ git add README.md\n$ git commit -m \"chore: updated README\"\n</code></pre> <p>Push your changes to your created branch and create a pull request from your fork.</p> <pre><code>$ git push origin chore/update-readme\n</code></pre>"},{"location":"contributing/#testing-and-documentation","title":"Testing and Documentation","text":"<p>If there are changes related to code, please make sure that the unit tests pass and the code coverage is 100%.</p> <pre><code>$ python -m pip install pytest coverage\n$ pytest --cov-report=term-missing --cov-config=pyproject.toml --cov=bigtree\n</code></pre> <p>Make sure your add/update the tests and documentations accordingly.</p> <p>If there are changes to the docstrings and/or sample codes in the docstring, do run the following lines of code to generate the coverage report and test report for docstrings. Refer to the console log for information on the file location of the reports.</p> <pre><code>$ python -m pip install hatch\n$ hatch run docs:coverage\n$ hatch run docs:doctest\n</code></pre>"},{"location":"contributing/#convention-and-standards","title":"Convention and Standards","text":"<p>When creating branches, it is recommended to create them in the format <code>type/action</code>. For example,</p> <pre><code>$ git checkout -b feat/add-this\n</code></pre> <p>During pre-commit checks, this project enforces conventional commits when writing commit messages, and checks and formats code using <code>black</code>, <code>flake8</code>, <code>isort</code>, and <code>mypy</code>. - The regex for conventional commits is as such <code>(?s)(build|ci|docs|feat|fix|perf|refactor|style|test|chore|revert|bump)(\\(\\S+\\))?!?:( [^\\n\\r]+)((\\n\\n.*)|(\\s*))?$</code>.</p> <p>For testing, this project uses <code>pytest</code> and <code>coverage</code> package for testing of codes, and <code>docstr-coverage</code> and <code>doctest</code> package for testing of docstrings.</p>"},{"location":"contributing/#consequent-changes","title":"Consequent Changes","text":"<p>Please open an issue to discuss important changes before embarking on an implementation.</p>"},{"location":"dag/","title":"\ud83c\udf34 Directed Acyclic Graph (DAG)","text":"<p>For Directed Acyclic Graph (DAG) implementation, there are 4 main components.</p>"},{"location":"dag/#node","title":"\ud83c\udf3c Node","text":"<ul> <li><code>DAGNode</code>, extendable class for constructing Directed Acyclic Graph (DAG)</li> </ul>"},{"location":"dag/#constructing-dag","title":"\u2728 Constructing DAG","text":"<ul> <li>From list, containing parent-child tuples</li> <li>From nested dictionary</li> <li>From pandas DataFrame</li> </ul>"},{"location":"dag/#traversing-dag","title":"\u27b0 Traversing DAG","text":"<ul> <li>Generic traversal method</li> </ul>"},{"location":"dag/#exporting-dag","title":"\ud83d\udd28 Exporting DAG","text":"<ul> <li>Export to list, dictionary, or pandas DataFrame</li> <li>Export DAG to dot (can save to .dot, .png, .svg, .jpeg files)</li> </ul>"},{"location":"home/","title":"\ud83c\udf33 Documentation","text":"<p>Tree Implementation and Methods for Python, integrated with Python list, dictionary, and pandas DataFrame.</p> <p>It is pythonic, making it easy to learn and extendable to many types of workflows.</p> <ul> <li> Set up in 2 minutes <p>Install <code>bigtree</code> with <code>pip</code> or <code>conda</code> and get up   and running in minutes</p> <p> Getting started</p> </li> </ul> <ul> <li> Getting started <p>View demonstration on how to use <code>bigtree</code></p> <p> Reference</p> </li> </ul> <ul> <li> Resources <p>Articles relating to trees and <code>bigtree</code></p> <p> View articles</p> </li> </ul> <ul> <li> Support bigtree <p>Do support if you like this project!</p> <p> Support me</p> </li> </ul> <p>Related Links:</p> <ul> <li>Community: Issues / Discussions</li> <li>Package: PyPI / Conda</li> </ul>"},{"location":"install/","title":"\ud83d\udcbb Installation","text":"<p>There are two ways to install <code>bigtree</code>, with pip (recommended) or conda.</p>"},{"location":"install/#installation-with-pip","title":"Installation with pip","text":"<p>To install <code>bigtree</code>, run the following line in command prompt:</p> pip install bigtreeInstalled <p>If tree needs to use pandas or polars methods, it requires additional dependencies. Run the following lines in command prompt:</p> pip install 'bigtree[pandas]'pip install 'bigtree[polars]' <p>If tree needs to be exported to image, it requires additional dependencies. Run the following lines in command prompt:</p> pip install 'bigtree[image]'brew install gprof2dot  # for MacOSconda install graphviz  # for Windows <p>Alternatively, install all optional dependencies with the following line in command prompt:</p> pip install 'bigtree[all]'"},{"location":"install/#installation-with-conda","title":"Installation with conda","text":"<p>To install <code>bigtree</code> with conda, run the following line in command prompt:</p> conda install -c conda-forge bigtree"},{"location":"tree/","title":"\ud83c\udf32 Tree","text":"<p>For Tree implementation, there are 9 main components.</p>"},{"location":"tree/#node","title":"\ud83c\udf3a Node","text":"<ul> <li><code>BaseNode</code>, extendable class</li> <li><code>Node</code>, BaseNode with node name attribute</li> </ul>"},{"location":"tree/#constructing-tree","title":"\u2728 Constructing Tree","text":"<ul> <li>From <code>Node</code>, using parent and children constructors</li> <li>From str, using tree display or Newick string notation</li> <li>From list, using paths or parent-child tuples</li> <li>From nested dictionary, using path-attribute key-value pairs or recursive structure</li> <li>From pandas DataFrame, using paths or parent-child columns</li> <li>From polars DataFrame, using paths or parent-child columns</li> <li>Add nodes to existing tree using path string</li> <li>Add nodes and attributes to existing tree using dictionary, pandas DataFrame, or polars DataFrame, using path</li> <li>Add only attributes to existing tree using dictionary, pandas DataFrame, or polars DataFrame, using node name</li> </ul>"},{"location":"tree/#traversing-tree","title":"\u27b0 Traversing Tree","text":"<ul> <li>Pre-Order Traversal</li> <li>Post-Order Traversal</li> <li>Level-Order Traversal</li> <li>Level-Order-Group Traversal</li> <li>ZigZag Traversal</li> <li>ZigZag-Group Traversal</li> </ul>"},{"location":"tree/#modifying-tree","title":"\ud83d\udcdd Modifying Tree","text":"<ul> <li>Copy nodes from location to destination</li> <li>Shift nodes from location to destination</li> <li>Shift and replace nodes from location to destination</li> <li>Copy nodes from one tree to another</li> <li>Copy and replace nodes from one tree to another</li> </ul>"},{"location":"tree/#tree-search","title":"\ud83d\udd0d Tree Search","text":"<ul> <li>Find multiple nodes based on name, partial path, relative path, attribute value, user-defined condition</li> <li>Find single nodes based on name, partial path, relative path, full path, attribute value, user-defined condition</li> <li>Find multiple child nodes based on user-defined condition</li> <li>Find single child node based on name, user-defined condition</li> </ul>"},{"location":"tree/#helper-function","title":"\ud83d\udd27 Helper Function","text":"<ul> <li>Cloning tree to another <code>Node</code> type</li> <li>Get subtree (smaller tree with different root)</li> <li>Prune tree (smaller tree with same root)</li> <li>Get difference between two trees</li> </ul>"},{"location":"tree/#plotting-tree","title":"\ud83d\udcca Plotting Tree","text":"<ul> <li>Enhanced Reingold Tilford Algorithm to retrieve (x, y) coordinates for a tree structure</li> </ul>"},{"location":"tree/#exporting-tree","title":"\ud83d\udd28 Exporting Tree","text":"<ul> <li>Print to console, in vertical or horizontal orientation</li> <li>Export to Newick string notation, dictionary, nested dictionary, pandas DataFrame, or polars DataFrame</li> <li>Export tree to dot (can save to .dot, .png, .svg, .jpeg files)</li> <li>Export tree to Pillow (can save to .png, .jpg)</li> <li>Export tree to Mermaid Flowchart (can display on .md)</li> </ul>"},{"location":"tree/#workflows","title":"\u2714\ufe0f Workflows","text":"<ul> <li>Sample workflows for tree demonstration!</li> </ul>"},{"location":"bigtree/binarytree/","title":"\ud83c\udf35 Binary Tree","text":""},{"location":"bigtree/binarytree/construct/","title":"\u2728 Construct","text":"<p>Construct Binary Tree from a list.</p>"},{"location":"bigtree/binarytree/construct/#binary-tree-construct-methods","title":"Binary Tree Construct Methods","text":"Construct Binary Tree from Using heapq structure Add node attributes List <code>list_to_binarytree</code> No"},{"location":"bigtree/binarytree/construct/#bigtree.binarytree.construct","title":"bigtree.binarytree.construct","text":""},{"location":"bigtree/binarytree/construct/#bigtree.binarytree.construct.list_to_binarytree","title":"list_to_binarytree","text":"<pre><code>list_to_binarytree(heapq_list, node_type=BinaryNode)\n</code></pre> <p>Construct tree from a list of numbers (int or float) in heapq format.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import list_to_binarytree, tree_to_dot\n&gt;&gt;&gt; nums_list = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]\n&gt;&gt;&gt; root = list_to_binarytree(nums_list)\n&gt;&gt;&gt; root.show()\n1\n\u251c\u2500\u2500 2\n\u2502   \u251c\u2500\u2500 4\n\u2502   \u2502   \u251c\u2500\u2500 8\n\u2502   \u2502   \u2514\u2500\u2500 9\n\u2502   \u2514\u2500\u2500 5\n\u2502       \u2514\u2500\u2500 10\n\u2514\u2500\u2500 3\n    \u251c\u2500\u2500 6\n    \u2514\u2500\u2500 7\n&gt;&gt;&gt; graph = tree_to_dot(root, node_colour=\"gold\")\n&gt;&gt;&gt; graph.write_png(\"assets/construct_binarytree.png\")\n</code></pre> <p></p> <p>Parameters:</p> Name Type Description Default <code>heapq_list</code> <code>List[int]</code> <p>list containing integer node names, ordered in heapq fashion</p> required <code>node_type</code> <code>Type[BinaryNode]</code> <p>node type of tree to be created, defaults to <code>BinaryNode</code></p> <code>BinaryNode</code> <p>Returns:</p> Type Description <code>BinaryNode</code> <p>(BinaryNode)</p>"},{"location":"bigtree/dag/","title":"\ud83c\udf34 Directed Acyclic Graph (DAG)","text":""},{"location":"bigtree/dag/construct/","title":"\u2728 Construct","text":"<p>Construct Directed Acyclic Graph (DAG) from list, dictionary, and pandas DataFrame.</p>"},{"location":"bigtree/dag/construct/#dag-construct-methods","title":"DAG Construct Methods","text":"Construct DAG from Using parent-child relation Add node attributes List <code>list_to_dag</code> No Dictionary <code>dict_to_dag</code> Yes DataFrame <code>dataframe_to_dag</code> Yes <p>These functions are not standalone functions. Under the hood, they have the following dependency,</p> <p></p>"},{"location":"bigtree/dag/construct/#bigtree.dag.construct","title":"bigtree.dag.construct","text":""},{"location":"bigtree/dag/construct/#bigtree.dag.construct.list_to_dag","title":"list_to_dag","text":"<pre><code>list_to_dag(relations, node_type=DAGNode)\n</code></pre> <p>Construct DAG from list of tuples containing parent-child names. Note that node names must be unique.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import list_to_dag, dag_iterator\n&gt;&gt;&gt; relations_list = [(\"a\", \"c\"), (\"a\", \"d\"), (\"b\", \"c\"), (\"c\", \"d\"), (\"d\", \"e\")]\n&gt;&gt;&gt; dag = list_to_dag(relations_list)\n&gt;&gt;&gt; [(parent.node_name, child.node_name) for parent, child in dag_iterator(dag)]\n[('a', 'd'), ('c', 'd'), ('d', 'e'), ('a', 'c'), ('b', 'c')]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>relations</code> <code>List[Tuple[str, str]]</code> <p>list containing tuple of parent-child names</p> required <code>node_type</code> <code>Type[DAGNode]</code> <p>node type of DAG to be created, defaults to <code>DAGNode</code></p> <code>DAGNode</code> <p>Returns:</p> Type Description <code>DAGNode</code> <p>(DAGNode)</p>"},{"location":"bigtree/dag/construct/#bigtree.dag.construct.dict_to_dag","title":"dict_to_dag","text":"<pre><code>dict_to_dag(\n    relation_attrs, parent_key=\"parents\", node_type=DAGNode\n)\n</code></pre> <p>Construct DAG from nested dictionary, <code>key</code>: child name, <code>value</code>: dictionary of parent names, attribute name, and attribute value. Note that node names must be unique.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import dict_to_dag, dag_iterator\n&gt;&gt;&gt; relation_dict = {\n...     \"a\": {\"step\": 1},\n...     \"b\": {\"step\": 1},\n...     \"c\": {\"parents\": [\"a\", \"b\"], \"step\": 2},\n...     \"d\": {\"parents\": [\"a\", \"c\"], \"step\": 2},\n...     \"e\": {\"parents\": [\"d\"], \"step\": 3},\n... }\n&gt;&gt;&gt; dag = dict_to_dag(relation_dict, parent_key=\"parents\")\n&gt;&gt;&gt; [(parent.node_name, child.node_name) for parent, child in dag_iterator(dag)]\n[('a', 'd'), ('c', 'd'), ('d', 'e'), ('a', 'c'), ('b', 'c')]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>relation_attrs</code> <code>Dict[str, Any]</code> <p>dictionary containing node, node parents, and node attribute information, key: child name, value: dictionary of parent names, node attribute, and attribute value</p> required <code>parent_key</code> <code>str</code> <p>key of dictionary to retrieve list of parents name, defaults to 'parent'</p> <code>'parents'</code> <code>node_type</code> <code>Type[DAGNode]</code> <p>node type of DAG to be created, defaults to <code>DAGNode</code></p> <code>DAGNode</code> <p>Returns:</p> Type Description <code>DAGNode</code> <p>(DAGNode)</p>"},{"location":"bigtree/dag/construct/#bigtree.dag.construct.dataframe_to_dag","title":"dataframe_to_dag","text":"<pre><code>dataframe_to_dag(\n    data,\n    child_col=\"\",\n    parent_col=\"\",\n    attribute_cols=[],\n    node_type=DAGNode,\n)\n</code></pre> <p>Construct DAG from pandas DataFrame. Note that node names must be unique.</p> <ul> <li><code>child_col</code> and <code>parent_col</code> specify columns for child name and parent name to construct DAG.</li> <li><code>attribute_cols</code> specify columns for node attribute for child name.</li> <li>If columns are not specified, <code>child_col</code> takes first column, <code>parent_col</code> takes second column, and all other     columns are <code>attribute_cols</code>.</li> </ul> <p>Only attributes in <code>attribute_cols</code> with non-null values will be added to the tree.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; import pandas as pd\n&gt;&gt;&gt; from bigtree import dataframe_to_dag, dag_iterator\n&gt;&gt;&gt; relation_data = pd.DataFrame([\n...     [\"a\", None, 1],\n...     [\"b\", None, 1],\n...     [\"c\", \"a\", 2],\n...     [\"c\", \"b\", 2],\n...     [\"d\", \"a\", 2],\n...     [\"d\", \"c\", 2],\n...     [\"e\", \"d\", 3],\n... ],\n...     columns=[\"child\", \"parent\", \"step\"]\n... )\n&gt;&gt;&gt; dag = dataframe_to_dag(relation_data)\n&gt;&gt;&gt; [(parent.node_name, child.node_name) for parent, child in dag_iterator(dag)]\n[('a', 'd'), ('c', 'd'), ('d', 'e'), ('a', 'c'), ('b', 'c')]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>data</code> <code>DataFrame</code> <p>data containing path and node attribute information</p> required <code>child_col</code> <code>str</code> <p>column of data containing child name information, defaults to '' if not set, it will take the first column of data</p> <code>''</code> <code>parent_col</code> <code>str</code> <p>column of data containing parent name information, defaults to '' if not set, it will take the second column of data</p> <code>''</code> <code>attribute_cols</code> <code>List[str]</code> <p>columns of data containing child node attribute information, if not set, it will take all columns of data except <code>child_col</code> and <code>parent_col</code></p> <code>[]</code> <code>node_type</code> <code>Type[DAGNode]</code> <p>node type of DAG to be created, defaults to <code>DAGNode</code></p> <code>DAGNode</code> <p>Returns:</p> Type Description <code>DAGNode</code> <p>(DAGNode)</p>"},{"location":"bigtree/dag/export/","title":"\ud83d\udd28 Export","text":"<p>Export Directed Acyclic Graph (DAG) to list, dictionary, and pandas DataFrame.</p>"},{"location":"bigtree/dag/export/#dag-export-methods","title":"DAG Export Methods","text":"Export DAG to Method Extract node attributes List <code>dag_to_list</code> No Dictionary <code>dag_to_dict</code> Yes with <code>attr_dict</code> or <code>all_attrs</code> DataFrame <code>dag_to_dataframe</code> Yes with <code>attr_dict</code> or <code>all_attrs</code> Dot (for .dot, .png, .svg, .jpeg, etc.) <code>dag_to_dot</code> No"},{"location":"bigtree/dag/export/#bigtree.dag.export","title":"bigtree.dag.export","text":""},{"location":"bigtree/dag/export/#bigtree.dag.export.dag_to_list","title":"dag_to_list","text":"<pre><code>dag_to_list(dag)\n</code></pre> <p>Export DAG to list of tuples containing parent-child names</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode, dag_to_list\n&gt;&gt;&gt; a = DAGNode(\"a\", step=1)\n&gt;&gt;&gt; b = DAGNode(\"b\", step=1)\n&gt;&gt;&gt; c = DAGNode(\"c\", step=2, parents=[a, b])\n&gt;&gt;&gt; d = DAGNode(\"d\", step=2, parents=[a, c])\n&gt;&gt;&gt; e = DAGNode(\"e\", step=3, parents=[d])\n&gt;&gt;&gt; dag_to_list(a)\n[('a', 'c'), ('a', 'd'), ('b', 'c'), ('c', 'd'), ('d', 'e')]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>dag</code> <code>DAGNode</code> <p>DAG to be exported</p> required <p>Returns:</p> Type Description <code>List[Tuple[str, str]]</code> <p>(List[Tuple[str, str]])</p>"},{"location":"bigtree/dag/export/#bigtree.dag.export.dag_to_dict","title":"dag_to_dict","text":"<pre><code>dag_to_dict(\n    dag, parent_key=\"parents\", attr_dict={}, all_attrs=False\n)\n</code></pre> <p>Export DAG to dictionary.</p> <p>Exported dictionary will have key as child name, and parent names and node attributes as a nested dictionary.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode, dag_to_dict\n&gt;&gt;&gt; a = DAGNode(\"a\", step=1)\n&gt;&gt;&gt; b = DAGNode(\"b\", step=1)\n&gt;&gt;&gt; c = DAGNode(\"c\", step=2, parents=[a, b])\n&gt;&gt;&gt; d = DAGNode(\"d\", step=2, parents=[a, c])\n&gt;&gt;&gt; e = DAGNode(\"e\", step=3, parents=[d])\n&gt;&gt;&gt; dag_to_dict(a, parent_key=\"parent\", attr_dict={\"step\": \"step no.\"})\n{'a': {'step no.': 1}, 'c': {'parent': ['a', 'b'], 'step no.': 2}, 'd': {'parent': ['a', 'c'], 'step no.': 2}, 'b': {'step no.': 1}, 'e': {'parent': ['d'], 'step no.': 3}}\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>dag</code> <code>DAGNode</code> <p>DAG to be exported</p> required <code>parent_key</code> <code>str</code> <p>dictionary key for <code>node.parent.node_name</code>, defaults to <code>parents</code></p> <code>'parents'</code> <code>attr_dict</code> <code>Dict[str, str]</code> <p>dictionary mapping node attributes to dictionary key, key: node attributes, value: corresponding dictionary key, optional</p> <code>{}</code> <code>all_attrs</code> <code>bool</code> <p>indicator whether to retrieve all <code>Node</code> attributes, defaults to False</p> <code>False</code> <p>Returns:</p> Type Description <code>Dict[str, Any]</code> <p>(Dict[str, Any])</p>"},{"location":"bigtree/dag/export/#bigtree.dag.export.dag_to_dataframe","title":"dag_to_dataframe","text":"<pre><code>dag_to_dataframe(\n    dag,\n    name_col=\"name\",\n    parent_col=\"parent\",\n    attr_dict={},\n    all_attrs=False,\n)\n</code></pre> <p>Export DAG to pandas DataFrame.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode, dag_to_dataframe\n&gt;&gt;&gt; a = DAGNode(\"a\", step=1)\n&gt;&gt;&gt; b = DAGNode(\"b\", step=1)\n&gt;&gt;&gt; c = DAGNode(\"c\", step=2, parents=[a, b])\n&gt;&gt;&gt; d = DAGNode(\"d\", step=2, parents=[a, c])\n&gt;&gt;&gt; e = DAGNode(\"e\", step=3, parents=[d])\n&gt;&gt;&gt; dag_to_dataframe(a, name_col=\"name\", parent_col=\"parent\", attr_dict={\"step\": \"step no.\"})\n  name parent  step no.\n0    a   None         1\n1    c      a         2\n2    d      a         2\n3    b   None         1\n4    c      b         2\n5    d      c         2\n6    e      d         3\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>dag</code> <code>DAGNode</code> <p>DAG to be exported</p> required <code>name_col</code> <code>str</code> <p>column name for <code>node.node_name</code>, defaults to 'name'</p> <code>'name'</code> <code>parent_col</code> <code>str</code> <p>column name for <code>node.parent.node_name</code>, defaults to 'parent'</p> <code>'parent'</code> <code>attr_dict</code> <code>Dict[str, str]</code> <p>dictionary mapping node attributes to column name, key: node attributes, value: corresponding column in dataframe, optional</p> <code>{}</code> <code>all_attrs</code> <code>bool</code> <p>indicator whether to retrieve all <code>Node</code> attributes, defaults to False</p> <code>False</code> <p>Returns:</p> Type Description <code>DataFrame</code> <p>(pd.DataFrame)</p>"},{"location":"bigtree/dag/export/#bigtree.dag.export.dag_to_dot","title":"dag_to_dot","text":"<pre><code>dag_to_dot(\n    dag,\n    rankdir=\"TB\",\n    bg_colour=\"\",\n    node_colour=\"\",\n    node_shape=\"\",\n    edge_colour=\"\",\n    node_attr=\"\",\n    edge_attr=\"\",\n)\n</code></pre> <p>Export DAG or list of DAGs to image. Note that node names must be unique. Possible node attributes include style, fillcolor, shape.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode, dag_to_dot\n&gt;&gt;&gt; a = DAGNode(\"a\", step=1)\n&gt;&gt;&gt; b = DAGNode(\"b\", step=1)\n&gt;&gt;&gt; c = DAGNode(\"c\", step=2, parents=[a, b])\n&gt;&gt;&gt; d = DAGNode(\"d\", step=2, parents=[a, c])\n&gt;&gt;&gt; e = DAGNode(\"e\", step=3, parents=[d])\n&gt;&gt;&gt; dag_graph = dag_to_dot(a)\n</code></pre> <p>Display image directly without saving (requires IPython)</p> <pre><code>&gt;&gt;&gt; from IPython.display import Image, display\n&gt;&gt;&gt; plt = Image(dag_graph.create_png())\n&gt;&gt;&gt; display(plt)\n&lt;IPython.core.display.Image object&gt;\n</code></pre> <p>Export to image, dot file, etc.</p> <pre><code>&gt;&gt;&gt; dag_graph.write_png(\"assets/docstr/tree_dag.png\")\n&gt;&gt;&gt; dag_graph.write_dot(\"assets/docstr/tree_dag.dot\")\n</code></pre> <p>Export to string</p> <pre><code>&gt;&gt;&gt; dag_graph.to_string()\n'strict digraph G {\\nrankdir=TB;\\nc [label=c];\\na [label=a];\\na -&gt; c;\\nd [label=d];\\na [label=a];\\na -&gt; d;\\nc [label=c];\\nb [label=b];\\nb -&gt; c;\\nd [label=d];\\nc [label=c];\\nc -&gt; d;\\ne [label=e];\\nd [label=d];\\nd -&gt; e;\\n}\\n'\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>dag</code> <code>Union[DAGNode, List[DAGNode]]</code> <p>DAG or list of DAGs to be exported</p> required <code>rankdir</code> <code>str</code> <p>set direction of graph layout, defaults to 'TB', can be 'BT, 'LR', 'RL'</p> <code>'TB'</code> <code>bg_colour</code> <code>str</code> <p>background color of image, defaults to ''</p> <code>''</code> <code>node_colour</code> <code>str</code> <p>fill colour of nodes, defaults to ''</p> <code>''</code> <code>node_shape</code> <code>str</code> <p>shape of nodes, defaults to None Possible node_shape include \"circle\", \"square\", \"diamond\", \"triangle\"</p> <code>''</code> <code>edge_colour</code> <code>str</code> <p>colour of edges, defaults to ''</p> <code>''</code> <code>node_attr</code> <code>str</code> <p>node attribute for style, overrides node_colour, defaults to '' Possible node attributes include {\"style\": \"filled\", \"fillcolor\": \"gold\"}</p> <code>''</code> <code>edge_attr</code> <code>str</code> <p>edge attribute for style, overrides edge_colour, defaults to '' Possible edge attributes include {\"style\": \"bold\", \"label\": \"edge label\", \"color\": \"black\"}</p> <code>''</code> <p>Returns:</p> Type Description <code>Dot</code> <p>(pydot.Dot)</p>"},{"location":"bigtree/node/","title":"\ud83c\udf3f Node","text":""},{"location":"bigtree/node/basenode/","title":"\ud83c\udf31 BaseNode","text":""},{"location":"bigtree/node/basenode/#bigtree.node.basenode","title":"bigtree.node.basenode","text":""},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode","title":"BaseNode","text":"<pre><code>BaseNode(parent=None, children=None, **kwargs)\n</code></pre> <p>BaseNode extends any Python class to a tree node. Nodes can have attributes if they are initialized from <code>Node</code>, dictionary, or pandas DataFrame.</p> <p>Nodes can be linked to each other with <code>parent</code> and <code>children</code> setter methods, or using bitshift operator with the convention <code>parent_node &gt;&gt; child_node</code> or <code>child_node &lt;&lt; parent_node</code>.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, print_tree\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65)\n&gt;&gt;&gt; c = Node(\"c\", age=60)\n&gt;&gt;&gt; d = Node(\"d\", age=40)\n&gt;&gt;&gt; root.children = [b, c]\n&gt;&gt;&gt; d.parent = b\n&gt;&gt;&gt; print_tree(root, attr_list=[\"age\"])\na [age=90]\n\u251c\u2500\u2500 b [age=65]\n\u2502   \u2514\u2500\u2500 d [age=40]\n\u2514\u2500\u2500 c [age=60]\n</code></pre> <pre><code>&gt;&gt;&gt; from bigtree import Node\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65)\n&gt;&gt;&gt; c = Node(\"c\", age=60)\n&gt;&gt;&gt; d = Node(\"d\", age=40)\n&gt;&gt;&gt; root &gt;&gt; b\n&gt;&gt;&gt; root &gt;&gt; c\n&gt;&gt;&gt; d &lt;&lt; b\n&gt;&gt;&gt; print_tree(root, attr_list=[\"age\"])\na [age=90]\n\u251c\u2500\u2500 b [age=65]\n\u2502   \u2514\u2500\u2500 d [age=40]\n\u2514\u2500\u2500 c [age=60]\n</code></pre> <p>Directly passing <code>parent</code> argument.</p> <pre><code>&gt;&gt;&gt; from bigtree import Node\n&gt;&gt;&gt; root = Node(\"a\")\n&gt;&gt;&gt; b = Node(\"b\", parent=root)\n&gt;&gt;&gt; c = Node(\"c\", parent=root)\n&gt;&gt;&gt; d = Node(\"d\", parent=b)\n</code></pre> <p>Directly passing <code>children</code> argument.</p> <pre><code>&gt;&gt;&gt; from bigtree import Node\n&gt;&gt;&gt; d = Node(\"d\")\n&gt;&gt;&gt; c = Node(\"c\")\n&gt;&gt;&gt; b = Node(\"b\", children=[d])\n&gt;&gt;&gt; a = Node(\"a\", children=[b, c])\n</code></pre> <p>BaseNode Creation</p> <p>Node can be created by instantiating a <code>BaseNode</code> class or by using a dictionary. If node is created with dictionary, all keys of dictionary will be stored as class attributes.</p> <pre><code>&gt;&gt;&gt; from bigtree import Node\n&gt;&gt;&gt; root = Node.from_dict({\"name\": \"a\", \"age\": 90})\n</code></pre> <p>BaseNode Attributes</p> <p>These are node attributes that have getter and/or setter methods.</p> <p>Get and set other <code>BaseNode</code></p> <ol> <li><code>parent</code>: Get/set parent node</li> <li><code>children</code>: Get/set child nodes</li> </ol> <p>Get other <code>BaseNode</code></p> <ol> <li><code>ancestors</code>: Get ancestors of node excluding self, iterator</li> <li><code>descendants</code>: Get descendants of node excluding self, iterator</li> <li><code>leaves</code>: Get all leaf node(s) from self, iterator</li> <li><code>siblings</code>: Get siblings of self</li> <li><code>left_sibling</code>: Get sibling left of self</li> <li><code>right_sibling</code>: Get sibling right of self</li> </ol> <p>Get <code>BaseNode</code> configuration</p> <ol> <li><code>node_path</code>: Get tuple of nodes from root</li> <li><code>is_root</code>: Get indicator if self is root node</li> <li><code>is_leaf</code>: Get indicator if self is leaf node</li> <li><code>root</code>: Get root node of tree</li> <li><code>diameter</code>: Get diameter of self</li> <li><code>depth</code>: Get depth of self</li> <li><code>max_depth</code>: Get maximum depth from root to leaf node</li> </ol> <p>BaseNode Methods</p> <p>These are methods available to be performed on <code>BaseNode</code>.</p> <p>Constructor methods</p> <ol> <li><code>from_dict()</code>: Create BaseNode from dictionary</li> </ol> <p><code>BaseNode</code> methods</p> <ol> <li><code>describe()</code>: Get node information sorted by attributes, return list of tuples</li> <li><code>get_attr(attr_name: str)</code>: Get value of node attribute</li> <li><code>set_attrs(attrs: dict)</code>: Set node attribute name(s) and value(s)</li> <li><code>go_to(node: Self)</code>: Get a path from own node to another node from same tree</li> <li><code>append(node: Self)</code>: Add child to node</li> <li><code>extend(nodes: List[Self])</code>: Add multiple children to node</li> <li><code>copy()</code>: Deep copy self</li> <li><code>sort()</code>: Sort child nodes</li> </ol>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.parent","title":"parent  <code>property</code> <code>writable</code>","text":"<pre><code>parent\n</code></pre> <p>Get parent node</p> <p>Returns:</p> Type Description <code>Optional[T]</code> <p>(Optional[Self])</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.parents","title":"parents  <code>property</code> <code>writable</code>","text":"<pre><code>parents\n</code></pre> <p>Do not allow <code>parents</code> attribute to be accessed</p> <p>Raises:</p> Type Description <code>AttributeError</code> <p>No such attribute</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.children","title":"children  <code>deletable</code> <code>property</code> <code>writable</code>","text":"<pre><code>children\n</code></pre> <p>Get child nodes</p> <p>Returns:</p> Type Description <code>Tuple[T, ...]</code> <p>(Tuple[Self, ...])</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.ancestors","title":"ancestors  <code>property</code>","text":"<pre><code>ancestors\n</code></pre> <p>Get iterator to yield all ancestors of self, does not include self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.descendants","title":"descendants  <code>property</code>","text":"<pre><code>descendants\n</code></pre> <p>Get iterator to yield all descendants of self, does not include self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.leaves","title":"leaves  <code>property</code>","text":"<pre><code>leaves\n</code></pre> <p>Get iterator to yield all leaf nodes from self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.siblings","title":"siblings  <code>property</code>","text":"<pre><code>siblings\n</code></pre> <p>Get siblings of self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.left_sibling","title":"left_sibling  <code>property</code>","text":"<pre><code>left_sibling\n</code></pre> <p>Get sibling left of self</p> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.right_sibling","title":"right_sibling  <code>property</code>","text":"<pre><code>right_sibling\n</code></pre> <p>Get sibling right of self</p> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.node_path","title":"node_path  <code>property</code>","text":"<pre><code>node_path\n</code></pre> <p>Get tuple of nodes starting from root</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.is_root","title":"is_root  <code>property</code>","text":"<pre><code>is_root\n</code></pre> <p>Get indicator if self is root node</p> <p>Returns:</p> Type Description <code>bool</code> <p>(bool)</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.is_leaf","title":"is_leaf  <code>property</code>","text":"<pre><code>is_leaf\n</code></pre> <p>Get indicator if self is leaf node</p> <p>Returns:</p> Type Description <code>bool</code> <p>(bool)</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.root","title":"root  <code>property</code>","text":"<pre><code>root\n</code></pre> <p>Get root node of tree</p> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.diameter","title":"diameter  <code>property</code>","text":"<pre><code>diameter\n</code></pre> <p>Get diameter of tree or subtree, the length of longest path between any two nodes</p> <p>Returns:</p> Type Description <code>int</code> <p>(int)</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.depth","title":"depth  <code>property</code>","text":"<pre><code>depth\n</code></pre> <p>Get depth of self, indexing starts from 1</p> <p>Returns:</p> Type Description <code>int</code> <p>(int)</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.max_depth","title":"max_depth  <code>property</code>","text":"<pre><code>max_depth\n</code></pre> <p>Get maximum depth from root to leaf node</p> <p>Returns:</p> Type Description <code>int</code> <p>(int)</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.from_dict","title":"from_dict  <code>classmethod</code>","text":"<pre><code>from_dict(input_dict)\n</code></pre> <p>Construct node from dictionary, all keys of dictionary will be stored as class attributes Input dictionary must have key <code>name</code> if not <code>Node</code> will not have any name</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node\n&gt;&gt;&gt; a = Node.from_dict({\"name\": \"a\", \"age\": 90})\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>input_dict</code> <code>Dict[str, Any]</code> <p>dictionary with node information, key: attribute name, value: attribute value</p> required <p>Returns:</p> Type Description <code>BaseNode</code> <p>(BaseNode)</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.describe","title":"describe","text":"<pre><code>describe(exclude_attributes=[], exclude_prefix='')\n</code></pre> <p>Get node information sorted by attribute name, returns list of tuples</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a', age=90)\n&gt;&gt;&gt; a.describe()\n[('_BaseNode__children', []), ('_BaseNode__parent', None), ('_sep', '/'), ('age', 90), ('name', 'a')]\n&gt;&gt;&gt; a.describe(exclude_prefix=\"_\")\n[('age', 90), ('name', 'a')]\n&gt;&gt;&gt; a.describe(exclude_prefix=\"_\", exclude_attributes=[\"name\"])\n[('age', 90)]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>exclude_attributes</code> <code>List[str]</code> <p>list of attributes to exclude</p> <code>[]</code> <code>exclude_prefix</code> <code>str</code> <p>prefix of attributes to exclude</p> <code>''</code> <p>Returns:</p> Type Description <code>List[Tuple[str, Any]]</code> <p>(List[Tuple[str, Any]])</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.get_attr","title":"get_attr","text":"<pre><code>get_attr(attr_name, default_value=None)\n</code></pre> <p>Get value of node attribute Returns default value if attribute name does not exist</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a', age=90)\n&gt;&gt;&gt; a.get_attr(\"age\")\n90\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>attr_name</code> <code>str</code> <p>attribute name</p> required <code>default_value</code> <code>Any</code> <p>default value if attribute does not exist, defaults to None</p> <code>None</code> <p>Returns:</p> Type Description <code>Any</code> <p>(Any)</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.set_attrs","title":"set_attrs","text":"<pre><code>set_attrs(attrs)\n</code></pre> <p>Set node attributes</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a')\n&gt;&gt;&gt; a.set_attrs({\"age\": 90})\n&gt;&gt;&gt; a\nNode(/a, age=90)\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>attrs</code> <code>Dict[str, Any]</code> <p>attribute dictionary, key: attribute name, value: attribute value</p> required"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.go_to","title":"go_to","text":"<pre><code>go_to(node)\n</code></pre> <p>Get path from current node to specified node from same tree</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, print_tree\n&gt;&gt;&gt; a = Node(name=\"a\")\n&gt;&gt;&gt; b = Node(name=\"b\", parent=a)\n&gt;&gt;&gt; c = Node(name=\"c\", parent=a)\n&gt;&gt;&gt; d = Node(name=\"d\", parent=b)\n&gt;&gt;&gt; e = Node(name=\"e\", parent=b)\n&gt;&gt;&gt; f = Node(name=\"f\", parent=c)\n&gt;&gt;&gt; g = Node(name=\"g\", parent=e)\n&gt;&gt;&gt; h = Node(name=\"h\", parent=e)\n&gt;&gt;&gt; print_tree(a)\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n&gt;&gt;&gt; d.go_to(d)\n[Node(/a/b/d, )]\n&gt;&gt;&gt; d.go_to(g)\n[Node(/a/b/d, ), Node(/a/b, ), Node(/a/b/e, ), Node(/a/b/e/g, )]\n&gt;&gt;&gt; d.go_to(f)\n[Node(/a/b/d, ), Node(/a/b, ), Node(/a, ), Node(/a/c, ), Node(/a/c/f, )]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>node</code> <code>Self</code> <p>node to travel to from current node, inclusive of start and end node</p> required <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.append","title":"append","text":"<pre><code>append(other)\n</code></pre> <p>Add other as child of self</p> <p>Parameters:</p> Name Type Description Default <code>other</code> <code>Self</code> <p>other node, child to be added</p> required"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.extend","title":"extend","text":"<pre><code>extend(others)\n</code></pre> <p>Add others as children of self</p> <p>Parameters:</p> Name Type Description Default <code>others</code> <code>Self</code> <p>other nodes, children to be added</p> required"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.copy","title":"copy","text":"<pre><code>copy()\n</code></pre> <p>Deep copy self; clone self</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a')\n&gt;&gt;&gt; a_copy = a.copy()\n</code></pre> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/basenode/#bigtree.node.basenode.BaseNode.sort","title":"sort","text":"<pre><code>sort(**kwargs)\n</code></pre> <p>Sort children, possible keyword arguments include <code>key=lambda node: node.name</code>, <code>reverse=True</code></p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, print_tree\n&gt;&gt;&gt; a = Node('a')\n&gt;&gt;&gt; c = Node(\"c\", parent=a)\n&gt;&gt;&gt; b = Node(\"b\", parent=a)\n&gt;&gt;&gt; print_tree(a)\na\n\u251c\u2500\u2500 c\n\u2514\u2500\u2500 b\n&gt;&gt;&gt; a.sort(key=lambda node: node.name)\n&gt;&gt;&gt; print_tree(a)\na\n\u251c\u2500\u2500 b\n\u2514\u2500\u2500 c\n</code></pre>"},{"location":"bigtree/node/binarynode/","title":"\ud83c\udf38 BinaryNode","text":""},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode","title":"bigtree.node.binarynode","text":""},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode","title":"BinaryNode","text":"<pre><code>BinaryNode(\n    name=\"\",\n    left=None,\n    right=None,\n    parent=None,\n    children=None,\n    **kwargs\n)\n</code></pre> <p>             Bases: <code>Node</code></p> <p>BinaryNode is an extension of Node, and is able to extend to any Python class for Binary Tree implementation. Nodes can have attributes if they are initialized from <code>BinaryNode</code>, dictionary, or pandas DataFrame.</p> <p>BinaryNode can be linked to each other with <code>children</code>, <code>left</code>, or <code>right</code> setter methods. If initialized with <code>children</code>, it must be length 2, denoting left and right child.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import BinaryNode, print_tree\n&gt;&gt;&gt; a = BinaryNode(1)\n&gt;&gt;&gt; b = BinaryNode(2)\n&gt;&gt;&gt; c = BinaryNode(3)\n&gt;&gt;&gt; d = BinaryNode(4)\n&gt;&gt;&gt; a.children = [b, c]\n&gt;&gt;&gt; b.right = d\n&gt;&gt;&gt; print_tree(a)\n1\n\u251c\u2500\u2500 2\n\u2502   \u2514\u2500\u2500 4\n\u2514\u2500\u2500 3\n</code></pre> <p>Directly passing <code>left</code>, <code>right</code>, or <code>children</code> argument.</p> <pre><code>&gt;&gt;&gt; from bigtree import BinaryNode\n&gt;&gt;&gt; d = BinaryNode(4)\n&gt;&gt;&gt; c = BinaryNode(3)\n&gt;&gt;&gt; b = BinaryNode(2, right=d)\n&gt;&gt;&gt; a = BinaryNode(1, children=[b, c])\n</code></pre> <p>BinaryNode Creation</p> <p>Node can be created by instantiating a <code>BinaryNode</code> class or by using a dictionary. If node is created with dictionary, all keys of dictionary will be stored as class attributes.</p> <pre><code>&gt;&gt;&gt; from bigtree import BinaryNode\n&gt;&gt;&gt; a = BinaryNode.from_dict({\"name\": \"1\"})\n&gt;&gt;&gt; a\nBinaryNode(name=1, val=1)\n</code></pre> <p>BinaryNode Attributes</p> <p>These are node attributes that have getter and/or setter methods.</p> <p>Get <code>BinaryNode</code> configuration</p> <ol> <li><code>left</code>: Get left children</li> <li><code>right</code>: Get right children</li> </ol>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.parents","title":"parents  <code>property</code> <code>writable</code>","text":"<pre><code>parents\n</code></pre> <p>Do not allow <code>parents</code> attribute to be accessed</p> <p>Raises:</p> Type Description <code>AttributeError</code> <p>No such attribute</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.ancestors","title":"ancestors  <code>property</code>","text":"<pre><code>ancestors\n</code></pre> <p>Get iterator to yield all ancestors of self, does not include self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.descendants","title":"descendants  <code>property</code>","text":"<pre><code>descendants\n</code></pre> <p>Get iterator to yield all descendants of self, does not include self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.leaves","title":"leaves  <code>property</code>","text":"<pre><code>leaves\n</code></pre> <p>Get iterator to yield all leaf nodes from self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.siblings","title":"siblings  <code>property</code>","text":"<pre><code>siblings\n</code></pre> <p>Get siblings of self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.left_sibling","title":"left_sibling  <code>property</code>","text":"<pre><code>left_sibling\n</code></pre> <p>Get sibling left of self</p> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.right_sibling","title":"right_sibling  <code>property</code>","text":"<pre><code>right_sibling\n</code></pre> <p>Get sibling right of self</p> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.node_path","title":"node_path  <code>property</code>","text":"<pre><code>node_path\n</code></pre> <p>Get tuple of nodes starting from root</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.is_root","title":"is_root  <code>property</code>","text":"<pre><code>is_root\n</code></pre> <p>Get indicator if self is root node</p> <p>Returns:</p> Type Description <code>bool</code> <p>(bool)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.root","title":"root  <code>property</code>","text":"<pre><code>root\n</code></pre> <p>Get root node of tree</p> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.diameter","title":"diameter  <code>property</code>","text":"<pre><code>diameter\n</code></pre> <p>Get diameter of tree or subtree, the length of longest path between any two nodes</p> <p>Returns:</p> Type Description <code>int</code> <p>(int)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.depth","title":"depth  <code>property</code>","text":"<pre><code>depth\n</code></pre> <p>Get depth of self, indexing starts from 1</p> <p>Returns:</p> Type Description <code>int</code> <p>(int)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.max_depth","title":"max_depth  <code>property</code>","text":"<pre><code>max_depth\n</code></pre> <p>Get maximum depth from root to leaf node</p> <p>Returns:</p> Type Description <code>int</code> <p>(int)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.sep","title":"sep  <code>property</code> <code>writable</code>","text":"<pre><code>sep\n</code></pre> <p>Get separator, gets from root node</p> <p>Returns:</p> Type Description <code>str</code> <p>(str)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.node_name","title":"node_name  <code>property</code>","text":"<pre><code>node_name\n</code></pre> <p>Get node name</p> <p>Returns:</p> Type Description <code>str</code> <p>(str)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.path_name","title":"path_name  <code>property</code>","text":"<pre><code>path_name\n</code></pre> <p>Get path name, separated by self.sep</p> <p>Returns:</p> Type Description <code>str</code> <p>(str)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.left","title":"left  <code>property</code> <code>writable</code>","text":"<pre><code>left\n</code></pre> <p>Get left children</p> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.right","title":"right  <code>property</code> <code>writable</code>","text":"<pre><code>right\n</code></pre> <p>Get right children</p> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.parent","title":"parent  <code>property</code> <code>writable</code>","text":"<pre><code>parent\n</code></pre> <p>Get parent node</p> <p>Returns:</p> Type Description <code>Optional[T]</code> <p>(Optional[Self])</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.children","title":"children  <code>deletable</code> <code>property</code> <code>writable</code>","text":"<pre><code>children\n</code></pre> <p>Get child nodes</p> <p>Returns:</p> Type Description <code>Tuple[T, ...]</code> <p>(Tuple[Optional[Self]])</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.is_leaf","title":"is_leaf  <code>property</code>","text":"<pre><code>is_leaf\n</code></pre> <p>Get indicator if self is leaf node</p> <p>Returns:</p> Type Description <code>bool</code> <p>(bool)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.from_dict","title":"from_dict  <code>classmethod</code>","text":"<pre><code>from_dict(input_dict)\n</code></pre> <p>Construct node from dictionary, all keys of dictionary will be stored as class attributes Input dictionary must have key <code>name</code> if not <code>Node</code> will not have any name</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node\n&gt;&gt;&gt; a = Node.from_dict({\"name\": \"a\", \"age\": 90})\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>input_dict</code> <code>Dict[str, Any]</code> <p>dictionary with node information, key: attribute name, value: attribute value</p> required <p>Returns:</p> Type Description <code>BaseNode</code> <p>(BaseNode)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.describe","title":"describe","text":"<pre><code>describe(exclude_attributes=[], exclude_prefix='')\n</code></pre> <p>Get node information sorted by attribute name, returns list of tuples</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a', age=90)\n&gt;&gt;&gt; a.describe()\n[('_BaseNode__children', []), ('_BaseNode__parent', None), ('_sep', '/'), ('age', 90), ('name', 'a')]\n&gt;&gt;&gt; a.describe(exclude_prefix=\"_\")\n[('age', 90), ('name', 'a')]\n&gt;&gt;&gt; a.describe(exclude_prefix=\"_\", exclude_attributes=[\"name\"])\n[('age', 90)]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>exclude_attributes</code> <code>List[str]</code> <p>list of attributes to exclude</p> <code>[]</code> <code>exclude_prefix</code> <code>str</code> <p>prefix of attributes to exclude</p> <code>''</code> <p>Returns:</p> Type Description <code>List[Tuple[str, Any]]</code> <p>(List[Tuple[str, Any]])</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.get_attr","title":"get_attr","text":"<pre><code>get_attr(attr_name, default_value=None)\n</code></pre> <p>Get value of node attribute Returns default value if attribute name does not exist</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a', age=90)\n&gt;&gt;&gt; a.get_attr(\"age\")\n90\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>attr_name</code> <code>str</code> <p>attribute name</p> required <code>default_value</code> <code>Any</code> <p>default value if attribute does not exist, defaults to None</p> <code>None</code> <p>Returns:</p> Type Description <code>Any</code> <p>(Any)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.set_attrs","title":"set_attrs","text":"<pre><code>set_attrs(attrs)\n</code></pre> <p>Set node attributes</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a')\n&gt;&gt;&gt; a.set_attrs({\"age\": 90})\n&gt;&gt;&gt; a\nNode(/a, age=90)\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>attrs</code> <code>Dict[str, Any]</code> <p>attribute dictionary, key: attribute name, value: attribute value</p> required"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.go_to","title":"go_to","text":"<pre><code>go_to(node)\n</code></pre> <p>Get path from current node to specified node from same tree</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, print_tree\n&gt;&gt;&gt; a = Node(name=\"a\")\n&gt;&gt;&gt; b = Node(name=\"b\", parent=a)\n&gt;&gt;&gt; c = Node(name=\"c\", parent=a)\n&gt;&gt;&gt; d = Node(name=\"d\", parent=b)\n&gt;&gt;&gt; e = Node(name=\"e\", parent=b)\n&gt;&gt;&gt; f = Node(name=\"f\", parent=c)\n&gt;&gt;&gt; g = Node(name=\"g\", parent=e)\n&gt;&gt;&gt; h = Node(name=\"h\", parent=e)\n&gt;&gt;&gt; print_tree(a)\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n&gt;&gt;&gt; d.go_to(d)\n[Node(/a/b/d, )]\n&gt;&gt;&gt; d.go_to(g)\n[Node(/a/b/d, ), Node(/a/b, ), Node(/a/b/e, ), Node(/a/b/e/g, )]\n&gt;&gt;&gt; d.go_to(f)\n[Node(/a/b/d, ), Node(/a/b, ), Node(/a, ), Node(/a/c, ), Node(/a/c/f, )]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>node</code> <code>Self</code> <p>node to travel to from current node, inclusive of start and end node</p> required <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.append","title":"append","text":"<pre><code>append(other)\n</code></pre> <p>Add other as child of self</p> <p>Parameters:</p> Name Type Description Default <code>other</code> <code>Self</code> <p>other node, child to be added</p> required"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.extend","title":"extend","text":"<pre><code>extend(others)\n</code></pre> <p>Add others as children of self</p> <p>Parameters:</p> Name Type Description Default <code>others</code> <code>Self</code> <p>other nodes, children to be added</p> required"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.copy","title":"copy","text":"<pre><code>copy()\n</code></pre> <p>Deep copy self; clone self</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a')\n&gt;&gt;&gt; a_copy = a.copy()\n</code></pre> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.show","title":"show","text":"<pre><code>show(**kwargs)\n</code></pre> <p>Print tree to console, takes in same keyword arguments as <code>print_tree</code> function</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.hshow","title":"hshow","text":"<pre><code>hshow(**kwargs)\n</code></pre> <p>Print tree in horizontal orientation to console, takes in same keyword arguments as <code>hprint_tree</code> function</p>"},{"location":"bigtree/node/binarynode/#bigtree.node.binarynode.BinaryNode.sort","title":"sort","text":"<pre><code>sort(**kwargs)\n</code></pre> <p>Sort children, possible keyword arguments include <code>key=lambda node: node.val</code>, <code>reverse=True</code></p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import BinaryNode, print_tree\n&gt;&gt;&gt; a = BinaryNode(1)\n&gt;&gt;&gt; c = BinaryNode(3, parent=a)\n&gt;&gt;&gt; b = BinaryNode(2, parent=a)\n&gt;&gt;&gt; print_tree(a)\n1\n\u251c\u2500\u2500 3\n\u2514\u2500\u2500 2\n&gt;&gt;&gt; a.sort(key=lambda node: node.val)\n&gt;&gt;&gt; print_tree(a)\n1\n\u251c\u2500\u2500 2\n\u2514\u2500\u2500 3\n</code></pre>"},{"location":"bigtree/node/dagnode/","title":"\ud83c\udf3c DAGNode","text":""},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode","title":"bigtree.node.dagnode","text":""},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode","title":"DAGNode","text":"<pre><code>DAGNode(name='', parents=None, children=None, **kwargs)\n</code></pre> <p>Base DAGNode extends any Python class to a DAG node, for DAG implementation. In DAG implementation, a node can have multiple parents.</p> <p>Parents and children cannot be reassigned once assigned, as Nodes are allowed to have multiple parents and children. If each node only has one parent, use <code>Node</code> class. DAGNodes can have attributes if they are initialized from <code>DAGNode</code> or dictionary.</p> <p>DAGNode can be linked to each other with <code>parents</code> and <code>children</code> setter methods, or using bitshift operator with the convention <code>parent_node &gt;&gt; child_node</code> or <code>child_node &lt;&lt; parent_node</code>.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode\n&gt;&gt;&gt; a = DAGNode(\"a\")\n&gt;&gt;&gt; b = DAGNode(\"b\")\n&gt;&gt;&gt; c = DAGNode(\"c\")\n&gt;&gt;&gt; d = DAGNode(\"d\")\n&gt;&gt;&gt; c.parents = [a, b]\n&gt;&gt;&gt; c.children = [d]\n</code></pre> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode\n&gt;&gt;&gt; a = DAGNode(\"a\")\n&gt;&gt;&gt; b = DAGNode(\"b\")\n&gt;&gt;&gt; c = DAGNode(\"c\")\n&gt;&gt;&gt; d = DAGNode(\"d\")\n&gt;&gt;&gt; a &gt;&gt; c\n&gt;&gt;&gt; b &gt;&gt; c\n&gt;&gt;&gt; d &lt;&lt; c\n</code></pre> <p>Directly passing <code>parents</code> argument.</p> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode\n&gt;&gt;&gt; a = DAGNode(\"a\")\n&gt;&gt;&gt; b = DAGNode(\"b\")\n&gt;&gt;&gt; c = DAGNode(\"c\", parents=[a, b])\n&gt;&gt;&gt; d = DAGNode(\"d\", parents=[c])\n</code></pre> <p>Directly passing <code>children</code> argument.</p> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode\n&gt;&gt;&gt; d = DAGNode(\"d\")\n&gt;&gt;&gt; c = DAGNode(\"c\", children=[d])\n&gt;&gt;&gt; b = DAGNode(\"b\", children=[c])\n&gt;&gt;&gt; a = DAGNode(\"a\", children=[c])\n</code></pre> <p>DAGNode Creation</p> <p>Node can be created by instantiating a <code>DAGNode</code> class or by using a dictionary. If node is created with dictionary, all keys of dictionary will be stored as class attributes.</p> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode\n&gt;&gt;&gt; a = DAGNode.from_dict({\"name\": \"a\", \"age\": 90})\n</code></pre> <p>DAGNode Attributes</p> <p>These are node attributes that have getter and/or setter methods.</p> <p>Get and set other <code>DAGNode</code></p> <ol> <li><code>parents</code>: Get/set parent nodes</li> <li><code>children</code>: Get/set child nodes</li> </ol> <p>Get other <code>DAGNode</code></p> <ol> <li><code>ancestors</code>: Get ancestors of node excluding self, iterator</li> <li><code>descendants</code>: Get descendants of node excluding self, iterator</li> <li><code>siblings</code>: Get siblings of self</li> </ol> <p>Get <code>DAGNode</code> configuration</p> <ol> <li><code>node_name</code>: Get node name, without accessing <code>name</code> directly</li> <li><code>is_root</code>: Get indicator if self is root node</li> <li><code>is_leaf</code>: Get indicator if self is leaf node</li> </ol> <p>DAGNode Methods</p> <p>These are methods available to be performed on <code>DAGNode</code>.</p> <p>Constructor methods</p> <ol> <li><code>from_dict()</code>: Create DAGNode from dictionary</li> </ol> <p><code>DAGNode</code> methods</p> <ol> <li><code>describe()</code>: Get node information sorted by attributes, return list of tuples</li> <li><code>get_attr(attr_name: str)</code>: Get value of node attribute</li> <li><code>set_attrs(attrs: dict)</code>: Set node attribute name(s) and value(s)</li> <li><code>go_to(node: Self)</code>: Get a path from own node to another node from same DAG</li> <li><code>copy()</code>: Deep copy self</li> </ol>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.parent","title":"parent  <code>property</code> <code>writable</code>","text":"<pre><code>parent\n</code></pre> <p>Do not allow <code>parent</code> attribute to be accessed</p> <p>Raises:</p> Type Description <code>AttributeError</code> <p>No such attribute</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.parents","title":"parents  <code>property</code> <code>writable</code>","text":"<pre><code>parents\n</code></pre> <p>Get parent nodes</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.children","title":"children  <code>deletable</code> <code>property</code> <code>writable</code>","text":"<pre><code>children\n</code></pre> <p>Get child nodes</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.ancestors","title":"ancestors  <code>property</code>","text":"<pre><code>ancestors\n</code></pre> <p>Get iterator to yield all ancestors of self, does not include self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.descendants","title":"descendants  <code>property</code>","text":"<pre><code>descendants\n</code></pre> <p>Get iterator to yield all descendants of self, does not include self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.siblings","title":"siblings  <code>property</code>","text":"<pre><code>siblings\n</code></pre> <p>Get siblings of self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.node_name","title":"node_name  <code>property</code>","text":"<pre><code>node_name\n</code></pre> <p>Get node name</p> <p>Returns:</p> Type Description <code>str</code> <p>(str)</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.is_root","title":"is_root  <code>property</code>","text":"<pre><code>is_root\n</code></pre> <p>Get indicator if self is root node</p> <p>Returns:</p> Type Description <code>bool</code> <p>(bool)</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.is_leaf","title":"is_leaf  <code>property</code>","text":"<pre><code>is_leaf\n</code></pre> <p>Get indicator if self is leaf node</p> <p>Returns:</p> Type Description <code>bool</code> <p>(bool)</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.from_dict","title":"from_dict  <code>classmethod</code>","text":"<pre><code>from_dict(input_dict)\n</code></pre> <p>Construct node from dictionary, all keys of dictionary will be stored as class attributes Input dictionary must have key <code>name</code> if not <code>Node</code> will not have any name</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode\n&gt;&gt;&gt; a = DAGNode.from_dict({\"name\": \"a\", \"age\": 90})\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>input_dict</code> <code>Dict[str, Any]</code> <p>dictionary with node information, key: attribute name, value: attribute value</p> required <p>Returns:</p> Type Description <code>DAGNode</code> <p>(DAGNode)</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.describe","title":"describe","text":"<pre><code>describe(exclude_attributes=[], exclude_prefix='')\n</code></pre> <p>Get node information sorted by attribute name, returns list of tuples</p> <p>Parameters:</p> Name Type Description Default <code>exclude_attributes</code> <code>List[str]</code> <p>list of attributes to exclude</p> <code>[]</code> <code>exclude_prefix</code> <code>str</code> <p>prefix of attributes to exclude</p> <code>''</code> <p>Returns:</p> Type Description <code>List[Tuple[str, Any]]</code> <p>(List[Tuple[str, Any]])</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.get_attr","title":"get_attr","text":"<pre><code>get_attr(attr_name, default_value=None)\n</code></pre> <p>Get value of node attribute Returns default value if attribute name does not exist</p> <p>Parameters:</p> Name Type Description Default <code>attr_name</code> <code>str</code> <p>attribute name</p> required <code>default_value</code> <code>Any</code> <p>default value if attribute does not exist, defaults to None</p> <code>None</code> <p>Returns:</p> Type Description <code>Any</code> <p>(Any)</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.set_attrs","title":"set_attrs","text":"<pre><code>set_attrs(attrs)\n</code></pre> <p>Set node attributes</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.dagnode import DAGNode\n&gt;&gt;&gt; a = DAGNode('a')\n&gt;&gt;&gt; a.set_attrs({\"age\": 90})\n&gt;&gt;&gt; a\nDAGNode(a, age=90)\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>attrs</code> <code>Dict[str, Any]</code> <p>attribute dictionary, key: attribute name, value: attribute value</p> required"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.go_to","title":"go_to","text":"<pre><code>go_to(node)\n</code></pre> <p>Get list of possible paths from current node to specified node from same tree</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode\n&gt;&gt;&gt; a = DAGNode(\"a\")\n&gt;&gt;&gt; b = DAGNode(\"b\")\n&gt;&gt;&gt; c = DAGNode(\"c\")\n&gt;&gt;&gt; d = DAGNode(\"d\")\n&gt;&gt;&gt; a &gt;&gt; c\n&gt;&gt;&gt; b &gt;&gt; c\n&gt;&gt;&gt; c &gt;&gt; d\n&gt;&gt;&gt; a &gt;&gt; d\n&gt;&gt;&gt; a.go_to(c)\n[[DAGNode(a, ), DAGNode(c, )]]\n&gt;&gt;&gt; a.go_to(d)\n[[DAGNode(a, ), DAGNode(c, ), DAGNode(d, )], [DAGNode(a, ), DAGNode(d, )]]\n&gt;&gt;&gt; a.go_to(b)\nTraceback (most recent call last):\n    ...\nbigtree.utils.exceptions.TreeError: It is not possible to go to DAGNode(b, )\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>node</code> <code>Self</code> <p>node to travel to from current node, inclusive of start and end node</p> required <p>Returns:</p> Type Description <code>List[List[T]]</code> <p>(List[List[Self]])</p>"},{"location":"bigtree/node/dagnode/#bigtree.node.dagnode.DAGNode.copy","title":"copy","text":"<pre><code>copy()\n</code></pre> <p>Deep copy self; clone DAGNode</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.dagnode import DAGNode\n&gt;&gt;&gt; a = DAGNode('a')\n&gt;&gt;&gt; a_copy = a.copy()\n</code></pre> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/node/","title":"\ud83c\udf3a Node","text":""},{"location":"bigtree/node/node/#bigtree.node.node","title":"bigtree.node.node","text":""},{"location":"bigtree/node/node/#bigtree.node.node.Node","title":"Node","text":"<pre><code>Node(name='', sep='/', **kwargs)\n</code></pre> <p>             Bases: <code>BaseNode</code></p> <p>Node is an extension of BaseNode, and is able to extend to any Python class. Nodes can have attributes if they are initialized from <code>Node</code>, dictionary, or pandas DataFrame.</p> <p>Nodes can be linked to each other with <code>parent</code> and <code>children</code> setter methods.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node\n&gt;&gt;&gt; a = Node(\"a\")\n&gt;&gt;&gt; b = Node(\"b\")\n&gt;&gt;&gt; c = Node(\"c\")\n&gt;&gt;&gt; d = Node(\"d\")\n&gt;&gt;&gt; b.parent = a\n&gt;&gt;&gt; b.children = [c, d]\n</code></pre> <p>Directly passing <code>parent</code> argument.</p> <pre><code>&gt;&gt;&gt; from bigtree import Node\n&gt;&gt;&gt; a = Node(\"a\")\n&gt;&gt;&gt; b = Node(\"b\", parent=a)\n&gt;&gt;&gt; c = Node(\"c\", parent=b)\n&gt;&gt;&gt; d = Node(\"d\", parent=b)\n</code></pre> <p>Directly passing <code>children</code> argument.</p> <pre><code>&gt;&gt;&gt; from bigtree import Node\n&gt;&gt;&gt; d = Node(\"d\")\n&gt;&gt;&gt; c = Node(\"c\")\n&gt;&gt;&gt; b = Node(\"b\", children=[c, d])\n&gt;&gt;&gt; a = Node(\"a\", children=[b])\n</code></pre> <p>Node Creation</p> <p>Node can be created by instantiating a <code>Node</code> class or by using a dictionary. If node is created with dictionary, all keys of dictionary will be stored as class attributes.</p> <pre><code>&gt;&gt;&gt; from bigtree import Node\n&gt;&gt;&gt; a = Node.from_dict({\"name\": \"a\", \"age\": 90})\n</code></pre> <p>Node Attributes</p> <p>These are node attributes that have getter and/or setter methods.</p> <p>Get and set <code>Node</code> configuration</p> <ol> <li><code>sep</code>: Get/set separator for path name</li> </ol> <p>Get <code>Node</code> configuration</p> <ol> <li><code>node_name</code>: Get node name, without accessing <code>name</code> directly</li> <li><code>path_name</code>: Get path name from root, separated by <code>sep</code></li> </ol> <p>Node Methods</p> <p>These are methods available to be performed on <code>Node</code>.</p> <p><code>Node</code> methods</p> <ol> <li><code>show()</code>: Print tree to console</li> <li><code>hshow()</code>: Print tree in horizontal orientation to console</li> </ol>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.parent","title":"parent  <code>property</code> <code>writable</code>","text":"<pre><code>parent\n</code></pre> <p>Get parent node</p> <p>Returns:</p> Type Description <code>Optional[T]</code> <p>(Optional[Self])</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.children","title":"children  <code>deletable</code> <code>property</code> <code>writable</code>","text":"<pre><code>children\n</code></pre> <p>Get child nodes</p> <p>Returns:</p> Type Description <code>Tuple[T, ...]</code> <p>(Tuple[Self, ...])</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.parents","title":"parents  <code>property</code> <code>writable</code>","text":"<pre><code>parents\n</code></pre> <p>Do not allow <code>parents</code> attribute to be accessed</p> <p>Raises:</p> Type Description <code>AttributeError</code> <p>No such attribute</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.ancestors","title":"ancestors  <code>property</code>","text":"<pre><code>ancestors\n</code></pre> <p>Get iterator to yield all ancestors of self, does not include self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.descendants","title":"descendants  <code>property</code>","text":"<pre><code>descendants\n</code></pre> <p>Get iterator to yield all descendants of self, does not include self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.leaves","title":"leaves  <code>property</code>","text":"<pre><code>leaves\n</code></pre> <p>Get iterator to yield all leaf nodes from self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.siblings","title":"siblings  <code>property</code>","text":"<pre><code>siblings\n</code></pre> <p>Get siblings of self</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.left_sibling","title":"left_sibling  <code>property</code>","text":"<pre><code>left_sibling\n</code></pre> <p>Get sibling left of self</p> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.right_sibling","title":"right_sibling  <code>property</code>","text":"<pre><code>right_sibling\n</code></pre> <p>Get sibling right of self</p> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.node_path","title":"node_path  <code>property</code>","text":"<pre><code>node_path\n</code></pre> <p>Get tuple of nodes starting from root</p> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.is_root","title":"is_root  <code>property</code>","text":"<pre><code>is_root\n</code></pre> <p>Get indicator if self is root node</p> <p>Returns:</p> Type Description <code>bool</code> <p>(bool)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.is_leaf","title":"is_leaf  <code>property</code>","text":"<pre><code>is_leaf\n</code></pre> <p>Get indicator if self is leaf node</p> <p>Returns:</p> Type Description <code>bool</code> <p>(bool)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.root","title":"root  <code>property</code>","text":"<pre><code>root\n</code></pre> <p>Get root node of tree</p> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.diameter","title":"diameter  <code>property</code>","text":"<pre><code>diameter\n</code></pre> <p>Get diameter of tree or subtree, the length of longest path between any two nodes</p> <p>Returns:</p> Type Description <code>int</code> <p>(int)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.depth","title":"depth  <code>property</code>","text":"<pre><code>depth\n</code></pre> <p>Get depth of self, indexing starts from 1</p> <p>Returns:</p> Type Description <code>int</code> <p>(int)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.max_depth","title":"max_depth  <code>property</code>","text":"<pre><code>max_depth\n</code></pre> <p>Get maximum depth from root to leaf node</p> <p>Returns:</p> Type Description <code>int</code> <p>(int)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.sep","title":"sep  <code>property</code> <code>writable</code>","text":"<pre><code>sep\n</code></pre> <p>Get separator, gets from root node</p> <p>Returns:</p> Type Description <code>str</code> <p>(str)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.node_name","title":"node_name  <code>property</code>","text":"<pre><code>node_name\n</code></pre> <p>Get node name</p> <p>Returns:</p> Type Description <code>str</code> <p>(str)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.path_name","title":"path_name  <code>property</code>","text":"<pre><code>path_name\n</code></pre> <p>Get path name, separated by self.sep</p> <p>Returns:</p> Type Description <code>str</code> <p>(str)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.from_dict","title":"from_dict  <code>classmethod</code>","text":"<pre><code>from_dict(input_dict)\n</code></pre> <p>Construct node from dictionary, all keys of dictionary will be stored as class attributes Input dictionary must have key <code>name</code> if not <code>Node</code> will not have any name</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node\n&gt;&gt;&gt; a = Node.from_dict({\"name\": \"a\", \"age\": 90})\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>input_dict</code> <code>Dict[str, Any]</code> <p>dictionary with node information, key: attribute name, value: attribute value</p> required <p>Returns:</p> Type Description <code>BaseNode</code> <p>(BaseNode)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.describe","title":"describe","text":"<pre><code>describe(exclude_attributes=[], exclude_prefix='')\n</code></pre> <p>Get node information sorted by attribute name, returns list of tuples</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a', age=90)\n&gt;&gt;&gt; a.describe()\n[('_BaseNode__children', []), ('_BaseNode__parent', None), ('_sep', '/'), ('age', 90), ('name', 'a')]\n&gt;&gt;&gt; a.describe(exclude_prefix=\"_\")\n[('age', 90), ('name', 'a')]\n&gt;&gt;&gt; a.describe(exclude_prefix=\"_\", exclude_attributes=[\"name\"])\n[('age', 90)]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>exclude_attributes</code> <code>List[str]</code> <p>list of attributes to exclude</p> <code>[]</code> <code>exclude_prefix</code> <code>str</code> <p>prefix of attributes to exclude</p> <code>''</code> <p>Returns:</p> Type Description <code>List[Tuple[str, Any]]</code> <p>(List[Tuple[str, Any]])</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.get_attr","title":"get_attr","text":"<pre><code>get_attr(attr_name, default_value=None)\n</code></pre> <p>Get value of node attribute Returns default value if attribute name does not exist</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a', age=90)\n&gt;&gt;&gt; a.get_attr(\"age\")\n90\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>attr_name</code> <code>str</code> <p>attribute name</p> required <code>default_value</code> <code>Any</code> <p>default value if attribute does not exist, defaults to None</p> <code>None</code> <p>Returns:</p> Type Description <code>Any</code> <p>(Any)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.set_attrs","title":"set_attrs","text":"<pre><code>set_attrs(attrs)\n</code></pre> <p>Set node attributes</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a')\n&gt;&gt;&gt; a.set_attrs({\"age\": 90})\n&gt;&gt;&gt; a\nNode(/a, age=90)\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>attrs</code> <code>Dict[str, Any]</code> <p>attribute dictionary, key: attribute name, value: attribute value</p> required"},{"location":"bigtree/node/node/#bigtree.node.node.Node.go_to","title":"go_to","text":"<pre><code>go_to(node)\n</code></pre> <p>Get path from current node to specified node from same tree</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, print_tree\n&gt;&gt;&gt; a = Node(name=\"a\")\n&gt;&gt;&gt; b = Node(name=\"b\", parent=a)\n&gt;&gt;&gt; c = Node(name=\"c\", parent=a)\n&gt;&gt;&gt; d = Node(name=\"d\", parent=b)\n&gt;&gt;&gt; e = Node(name=\"e\", parent=b)\n&gt;&gt;&gt; f = Node(name=\"f\", parent=c)\n&gt;&gt;&gt; g = Node(name=\"g\", parent=e)\n&gt;&gt;&gt; h = Node(name=\"h\", parent=e)\n&gt;&gt;&gt; print_tree(a)\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n&gt;&gt;&gt; d.go_to(d)\n[Node(/a/b/d, )]\n&gt;&gt;&gt; d.go_to(g)\n[Node(/a/b/d, ), Node(/a/b, ), Node(/a/b/e, ), Node(/a/b/e/g, )]\n&gt;&gt;&gt; d.go_to(f)\n[Node(/a/b/d, ), Node(/a/b, ), Node(/a, ), Node(/a/c, ), Node(/a/c/f, )]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>node</code> <code>Self</code> <p>node to travel to from current node, inclusive of start and end node</p> required <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Iterable[Self])</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.append","title":"append","text":"<pre><code>append(other)\n</code></pre> <p>Add other as child of self</p> <p>Parameters:</p> Name Type Description Default <code>other</code> <code>Self</code> <p>other node, child to be added</p> required"},{"location":"bigtree/node/node/#bigtree.node.node.Node.extend","title":"extend","text":"<pre><code>extend(others)\n</code></pre> <p>Add others as children of self</p> <p>Parameters:</p> Name Type Description Default <code>others</code> <code>Self</code> <p>other nodes, children to be added</p> required"},{"location":"bigtree/node/node/#bigtree.node.node.Node.copy","title":"copy","text":"<pre><code>copy()\n</code></pre> <p>Deep copy self; clone self</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree.node.node import Node\n&gt;&gt;&gt; a = Node('a')\n&gt;&gt;&gt; a_copy = a.copy()\n</code></pre> <p>Returns:</p> Type Description <code>T</code> <p>(Self)</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.sort","title":"sort","text":"<pre><code>sort(**kwargs)\n</code></pre> <p>Sort children, possible keyword arguments include <code>key=lambda node: node.name</code>, <code>reverse=True</code></p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, print_tree\n&gt;&gt;&gt; a = Node('a')\n&gt;&gt;&gt; c = Node(\"c\", parent=a)\n&gt;&gt;&gt; b = Node(\"b\", parent=a)\n&gt;&gt;&gt; print_tree(a)\na\n\u251c\u2500\u2500 c\n\u2514\u2500\u2500 b\n&gt;&gt;&gt; a.sort(key=lambda node: node.name)\n&gt;&gt;&gt; print_tree(a)\na\n\u251c\u2500\u2500 b\n\u2514\u2500\u2500 c\n</code></pre>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.show","title":"show","text":"<pre><code>show(**kwargs)\n</code></pre> <p>Print tree to console, takes in same keyword arguments as <code>print_tree</code> function</p>"},{"location":"bigtree/node/node/#bigtree.node.node.Node.hshow","title":"hshow","text":"<pre><code>hshow(**kwargs)\n</code></pre> <p>Print tree in horizontal orientation to console, takes in same keyword arguments as <code>hprint_tree</code> function</p>"},{"location":"bigtree/tree/","title":"\ud83c\udf32 Tree","text":""},{"location":"bigtree/tree/construct/","title":"\u2728 Construct","text":""},{"location":"bigtree/tree/construct/#tree-construct-methods","title":"Tree Construct Methods","text":"<p>Construct Tree from list, dictionary, and pandas DataFrame.</p> <p>To decide which method to use, consider your data type and data values.</p> Construct tree from Using full path Using parent-child relation Using notation Add node attributes String <code>str_to_tree</code> NA <code>newick_to_tree</code> No (for <code>str_to_tree</code>)Yes (for  <code>newick_to_tree</code>) List <code>list_to_tree</code> <code>list_to_tree_by_relation</code> NA No Dictionary <code>dict_to_tree</code> <code>nested_dict_to_tree</code> NA Yes pandas DataFrame <code>dataframe_to_tree</code> <code>dataframe_to_tree_by_relation</code> NA Yes polars DataFrame <code>polars_to_tree</code> <code>polars_to_tree_by_relation</code> NA Yes"},{"location":"bigtree/tree/construct/#tree-add-attributes-methods","title":"Tree Add Attributes Methods","text":"<p>To add attributes to an existing tree,</p> Add attributes from Using full path Using node name String <code>add_path_to_tree</code> NA Dictionary <code>add_dict_to_tree_by_path</code> <code>add_dict_to_tree_by_name</code> pandas DataFrame <code>add_dataframe_to_tree_by_path</code> <code>add_dataframe_to_tree_by_name</code> polars DataFrame <code>add_polars_to_tree_by_path</code> <code>add_polars_to_tree_by_name</code> <p>Note</p> <p>If attributes are added to existing tree using full path, paths that previously did not exist will be added. If attributes are added to existing tree using node name, names that previously did not exist will not be created.</p> <p>These functions are not standalone functions. Under the hood, they have the following dependency,</p> <p></p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct","title":"bigtree.tree.construct","text":""},{"location":"bigtree/tree/construct/#bigtree.tree.construct.add_path_to_tree","title":"add_path_to_tree","text":"<pre><code>add_path_to_tree(\n    tree,\n    path,\n    sep=\"/\",\n    duplicate_name_allowed=True,\n    node_attrs={},\n)\n</code></pre> <p>Add nodes and attributes to existing tree in-place, return node of path added. Adds to existing tree from list of path strings.</p> <p>Path should contain <code>Node</code> name, separated by <code>sep</code>.</p> <ul> <li>For example: Path string \"a/b\" refers to Node(\"b\") with parent Node(\"a\").</li> <li>Path separator <code>sep</code> is for the input <code>path</code> and can differ from existing tree.</li> </ul> <p>Path can start from root node <code>name</code>, or start with <code>sep</code>.</p> <ul> <li>For example: Path string can be \"/a/b\" or \"a/b\", if sep is \"/\".</li> </ul> <p>All paths should start from the same root node.</p> <ul> <li>For example: Path strings should be \"a/b\", \"a/c\", \"a/b/d\" etc., and should not start with another root node.</li> </ul> <p>All attributes in <code>node_attrs</code> will be added to the tree, including attributes with null values.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import add_path_to_tree, Node\n&gt;&gt;&gt; root = Node(\"a\")\n&gt;&gt;&gt; add_path_to_tree(root, \"a/b/c\")\nNode(/a/b/c, )\n&gt;&gt;&gt; root.show()\na\n\u2514\u2500\u2500 b\n    \u2514\u2500\u2500 c\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>existing tree</p> required <code>path</code> <code>str</code> <p>path to be added to tree</p> required <code>sep</code> <code>str</code> <p>path separator for input <code>path</code></p> <code>'/'</code> <code>duplicate_name_allowed</code> <code>bool</code> <p>indicator if nodes with duplicate <code>Node</code> name is allowed, defaults to True</p> <code>True</code> <code>node_attrs</code> <code>Dict[str, Any]</code> <p>attributes to add to node, key: attribute name, value: attribute value, optional</p> <code>{}</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.add_dict_to_tree_by_path","title":"add_dict_to_tree_by_path","text":"<pre><code>add_dict_to_tree_by_path(\n    tree, path_attrs, sep=\"/\", duplicate_name_allowed=True\n)\n</code></pre> <p>Add nodes and attributes to tree in-place, return root of tree. Adds to existing tree from nested dictionary, <code>key</code>: path, <code>value</code>: dict of attribute name and attribute value.</p> <p>All attributes in <code>path_attrs</code> will be added to the tree, including attributes with null values.</p> <p>Path should contain <code>Node</code> name, separated by <code>sep</code>.</p> <ul> <li>For example: Path string \"a/b\" refers to Node(\"b\") with parent Node(\"a\").</li> <li>Path separator <code>sep</code> is for the input <code>path</code> and can differ from existing tree.</li> </ul> <p>Path can start from root node <code>name</code>, or start with <code>sep</code>.</p> <ul> <li>For example: Path string can be \"/a/b\" or \"a/b\", if sep is \"/\".</li> </ul> <p>All paths should start from the same root node.</p> <ul> <li>For example: Path strings should be \"a/b\", \"a/c\", \"a/b/d\" etc. and should not start with another root node.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, add_dict_to_tree_by_path\n&gt;&gt;&gt; root = Node(\"a\")\n&gt;&gt;&gt; path_dict = {\n...     \"a\": {\"age\": 90},\n...     \"a/b\": {\"age\": 65},\n...     \"a/c\": {\"age\": 60},\n...     \"a/b/d\": {\"age\": 40},\n...     \"a/b/e\": {\"age\": 35},\n...     \"a/c/f\": {\"age\": 38},\n...     \"a/b/e/g\": {\"age\": 10},\n...     \"a/b/e/h\": {\"age\": 6},\n... }\n&gt;&gt;&gt; root = add_dict_to_tree_by_path(root, path_dict)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>existing tree</p> required <code>path_attrs</code> <code>Dict[str, Dict[str, Any]]</code> <p>dictionary containing node path and attribute information, key: node path, value: dict of node attribute name and attribute value</p> required <code>sep</code> <code>str</code> <p>path separator for input <code>path_attrs</code></p> <code>'/'</code> <code>duplicate_name_allowed</code> <code>bool</code> <p>indicator if nodes with duplicate <code>Node</code> name is allowed, defaults to True</p> <code>True</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.add_dict_to_tree_by_name","title":"add_dict_to_tree_by_name","text":"<pre><code>add_dict_to_tree_by_name(tree, name_attrs)\n</code></pre> <p>Add attributes to existing tree in-place. Adds to existing tree from nested dictionary, <code>key</code>: name, <code>value</code>: dict of attribute name and attribute value.</p> <p>All attributes in <code>name_attrs</code> will be added to the tree, including attributes with null values.</p> <p>Input dictionary keys that are not existing node names will be ignored. Note that if multiple nodes have the same name, attributes will be added to all nodes sharing the same name.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, add_dict_to_tree_by_name\n&gt;&gt;&gt; root = Node(\"a\")\n&gt;&gt;&gt; b = Node(\"b\", parent=root)\n&gt;&gt;&gt; name_dict = {\n...     \"a\": {\"age\": 90},\n...     \"b\": {\"age\": 65},\n... }\n&gt;&gt;&gt; root = add_dict_to_tree_by_name(root, name_dict)\n&gt;&gt;&gt; root.show(attr_list=[\"age\"])\na [age=90]\n\u2514\u2500\u2500 b [age=65]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>existing tree</p> required <code>name_attrs</code> <code>Dict[str, Dict[str, Any]]</code> <p>dictionary containing node name and attribute information, key: node name, value: dict of node attribute name and attribute value</p> required <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.add_dataframe_to_tree_by_path","title":"add_dataframe_to_tree_by_path","text":"<pre><code>add_dataframe_to_tree_by_path(\n    tree,\n    data,\n    path_col=\"\",\n    attribute_cols=[],\n    sep=\"/\",\n    duplicate_name_allowed=True,\n)\n</code></pre> <p>Add nodes and attributes to tree in-place, return root of tree. Adds to existing tree from pandas DataFrame.</p> <p>Only attributes in <code>attribute_cols</code> with non-null values will be added to the tree.</p> <p><code>path_col</code> and <code>attribute_cols</code> specify columns for node path and attributes to add to existing tree. If columns are not specified, <code>path_col</code> takes first column and all other columns are <code>attribute_cols</code></p> <p>Path in path column should contain <code>Node</code> name, separated by <code>sep</code>.</p> <ul> <li>For example: Path string \"a/b\" refers to Node(\"b\") with parent Node(\"a\").</li> <li>Path separator <code>sep</code> is for the input <code>path</code> and can differ from existing tree.</li> </ul> <p>Path in path column can start from root node <code>name</code>, or start with <code>sep</code>.</p> <ul> <li>For example: Path string can be \"/a/b\" or \"a/b\", if sep is \"/\".</li> </ul> <p>All paths should start from the same root node.</p> <ul> <li>For example: Path strings should be \"a/b\", \"a/c\", \"a/b/d\" etc. and should not start with another root node.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; import pandas as pd\n&gt;&gt;&gt; from bigtree import add_dataframe_to_tree_by_path, Node\n&gt;&gt;&gt; root = Node(\"a\")\n&gt;&gt;&gt; path_data = pd.DataFrame([\n...     [\"a\", 90],\n...     [\"a/b\", 65],\n...     [\"a/c\", 60],\n...     [\"a/b/d\", 40],\n...     [\"a/b/e\", 35],\n...     [\"a/c/f\", 38],\n...     [\"a/b/e/g\", 10],\n...     [\"a/b/e/h\", 6],\n... ],\n...     columns=[\"PATH\", \"age\"]\n... )\n&gt;&gt;&gt; root = add_dataframe_to_tree_by_path(root, path_data)\n&gt;&gt;&gt; root.show(attr_list=[\"age\"])\na [age=90]\n\u251c\u2500\u2500 b [age=65]\n\u2502   \u251c\u2500\u2500 d [age=40]\n\u2502   \u2514\u2500\u2500 e [age=35]\n\u2502       \u251c\u2500\u2500 g [age=10]\n\u2502       \u2514\u2500\u2500 h [age=6]\n\u2514\u2500\u2500 c [age=60]\n    \u2514\u2500\u2500 f [age=38]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>existing tree</p> required <code>data</code> <code>DataFrame</code> <p>data containing node path and attribute information</p> required <code>path_col</code> <code>str</code> <p>column of data containing <code>path_name</code> information, if not set, it will take the first column of data</p> <code>''</code> <code>attribute_cols</code> <code>List[str]</code> <p>columns of data containing node attribute information, if not set, it will take all columns of data except <code>path_col</code></p> <code>[]</code> <code>sep</code> <code>str</code> <p>path separator for input <code>path_col</code></p> <code>'/'</code> <code>duplicate_name_allowed</code> <code>bool</code> <p>indicator if nodes with duplicate <code>Node</code> name is allowed, defaults to True</p> <code>True</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.add_dataframe_to_tree_by_name","title":"add_dataframe_to_tree_by_name","text":"<pre><code>add_dataframe_to_tree_by_name(\n    tree, data, name_col=\"\", attribute_cols=[]\n)\n</code></pre> <p>Add attributes to existing tree in-place. Adds to existing tree from pandas DataFrame.</p> <p>Only attributes in <code>attribute_cols</code> with non-null values will be added to the tree.</p> <p><code>name_col</code> and <code>attribute_cols</code> specify columns for node name and attributes to add to existing tree. If columns are not specified, the first column will be taken as name column and all other columns as attributes.</p> <p>Input data node names that are not existing node names will be ignored. Note that if multiple nodes have the same name, attributes will be added to all nodes sharing same name.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; import pandas as pd\n&gt;&gt;&gt; from bigtree import add_dataframe_to_tree_by_name, Node\n&gt;&gt;&gt; root = Node(\"a\")\n&gt;&gt;&gt; b = Node(\"b\", parent=root)\n&gt;&gt;&gt; name_data = pd.DataFrame([\n...     [\"a\", 90],\n...     [\"b\", 65],\n... ],\n...     columns=[\"NAME\", \"age\"]\n... )\n&gt;&gt;&gt; root = add_dataframe_to_tree_by_name(root, name_data)\n&gt;&gt;&gt; root.show(attr_list=[\"age\"])\na [age=90]\n\u2514\u2500\u2500 b [age=65]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>existing tree</p> required <code>data</code> <code>DataFrame</code> <p>data containing node name and attribute information</p> required <code>name_col</code> <code>str</code> <p>column of data containing <code>name</code> information, if not set, it will take the first column of data</p> <code>''</code> <code>attribute_cols</code> <code>List[str]</code> <p>column(s) of data containing node attribute information, if not set, it will take all columns of data except <code>path_col</code></p> <code>[]</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.add_polars_to_tree_by_path","title":"add_polars_to_tree_by_path","text":"<pre><code>add_polars_to_tree_by_path(\n    tree,\n    data,\n    path_col=\"\",\n    attribute_cols=[],\n    sep=\"/\",\n    duplicate_name_allowed=True,\n)\n</code></pre> <p>Add nodes and attributes to tree in-place, return root of tree. Adds to existing tree from polars DataFrame.</p> <p>Only attributes in <code>attribute_cols</code> with non-null values will be added to the tree.</p> <p><code>path_col</code> and <code>attribute_cols</code> specify columns for node path and attributes to add to existing tree. If columns are not specified, <code>path_col</code> takes first column and all other columns are <code>attribute_cols</code></p> <p>Path in path column should contain <code>Node</code> name, separated by <code>sep</code>.</p> <ul> <li>For example: Path string \"a/b\" refers to Node(\"b\") with parent Node(\"a\").</li> <li>Path separator <code>sep</code> is for the input <code>path</code> and can differ from existing tree.</li> </ul> <p>Path in path column can start from root node <code>name</code>, or start with <code>sep</code>.</p> <ul> <li>For example: Path string can be \"/a/b\" or \"a/b\", if sep is \"/\".</li> </ul> <p>All paths should start from the same root node.</p> <ul> <li>For example: Path strings should be \"a/b\", \"a/c\", \"a/b/d\" etc. and should not start with another root node.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; import polars as pl\n&gt;&gt;&gt; from bigtree import add_polars_to_tree_by_path, Node\n&gt;&gt;&gt; root = Node(\"a\")\n&gt;&gt;&gt; path_data = pl.DataFrame([\n...     [\"a\", 90],\n...     [\"a/b\", 65],\n...     [\"a/c\", 60],\n...     [\"a/b/d\", 40],\n...     [\"a/b/e\", 35],\n...     [\"a/c/f\", 38],\n...     [\"a/b/e/g\", 10],\n...     [\"a/b/e/h\", 6],\n... ],\n...     schema=[\"PATH\", \"age\"]\n... )\n&gt;&gt;&gt; root = add_polars_to_tree_by_path(root, path_data)\n&gt;&gt;&gt; root.show(attr_list=[\"age\"])\na [age=90]\n\u251c\u2500\u2500 b [age=65]\n\u2502   \u251c\u2500\u2500 d [age=40]\n\u2502   \u2514\u2500\u2500 e [age=35]\n\u2502       \u251c\u2500\u2500 g [age=10]\n\u2502       \u2514\u2500\u2500 h [age=6]\n\u2514\u2500\u2500 c [age=60]\n    \u2514\u2500\u2500 f [age=38]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>existing tree</p> required <code>data</code> <code>DataFrame</code> <p>data containing node path and attribute information</p> required <code>path_col</code> <code>str</code> <p>column of data containing <code>path_name</code> information, if not set, it will take the first column of data</p> <code>''</code> <code>attribute_cols</code> <code>List[str]</code> <p>columns of data containing node attribute information, if not set, it will take all columns of data except <code>path_col</code></p> <code>[]</code> <code>sep</code> <code>str</code> <p>path separator for input <code>path_col</code></p> <code>'/'</code> <code>duplicate_name_allowed</code> <code>bool</code> <p>indicator if nodes with duplicate <code>Node</code> name is allowed, defaults to True</p> <code>True</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.add_polars_to_tree_by_name","title":"add_polars_to_tree_by_name","text":"<pre><code>add_polars_to_tree_by_name(\n    tree, data, name_col=\"\", attribute_cols=[]\n)\n</code></pre> <p>Add attributes to existing tree in-place. Adds to existing tree from polars DataFrame.</p> <p>Only attributes in <code>attribute_cols</code> with non-null values will be added to the tree.</p> <p><code>name_col</code> and <code>attribute_cols</code> specify columns for node name and attributes to add to existing tree. If columns are not specified, the first column will be taken as name column and all other columns as attributes.</p> <p>Input data node names that are not existing node names will be ignored. Note that if multiple nodes have the same name, attributes will be added to all nodes sharing same name.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; import polars as pl\n&gt;&gt;&gt; from bigtree import add_polars_to_tree_by_name, Node\n&gt;&gt;&gt; root = Node(\"a\")\n&gt;&gt;&gt; b = Node(\"b\", parent=root)\n&gt;&gt;&gt; name_data = pl.DataFrame([\n...     [\"a\", 90],\n...     [\"b\", 65],\n... ],\n...     schema=[\"NAME\", \"age\"]\n... )\n&gt;&gt;&gt; root = add_polars_to_tree_by_name(root, name_data)\n&gt;&gt;&gt; root.show(attr_list=[\"age\"])\na [age=90]\n\u2514\u2500\u2500 b [age=65]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>existing tree</p> required <code>data</code> <code>DataFrame</code> <p>data containing node name and attribute information</p> required <code>name_col</code> <code>str</code> <p>column of data containing <code>name</code> information, if not set, it will take the first column of data</p> <code>''</code> <code>attribute_cols</code> <code>List[str]</code> <p>column(s) of data containing node attribute information, if not set, it will take all columns of data except <code>path_col</code></p> <code>[]</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.str_to_tree","title":"str_to_tree","text":"<pre><code>str_to_tree(\n    tree_string, tree_prefix_list=[], node_type=Node\n)\n</code></pre> <p>Construct tree from tree string</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import str_to_tree\n&gt;&gt;&gt; tree_str = 'a\\n\u251c\u2500\u2500 b\\n\u2502   \u251c\u2500\u2500 d\\n\u2502   \u2514\u2500\u2500 e\\n\u2502       \u251c\u2500\u2500 g\\n\u2502       \u2514\u2500\u2500 h\\n\u2514\u2500\u2500 c\\n    \u2514\u2500\u2500 f'\n&gt;&gt;&gt; root = str_to_tree(tree_str, tree_prefix_list=[\"\u251c\u2500\u2500\", \"\u2514\u2500\u2500\"])\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree_string</code> <code>str</code> <p>String to construct tree</p> required <code>tree_prefix_list</code> <code>List[str]</code> <p>List of prefix to mark the end of tree branch/stem and start of node name, optional. If not specified, it will infer unicode characters and whitespace as prefix.</p> <code>[]</code> <code>node_type</code> <code>Type[Node]</code> <p>node type of tree to be created, defaults to <code>Node</code></p> <code>Node</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.list_to_tree","title":"list_to_tree","text":"<pre><code>list_to_tree(\n    paths,\n    sep=\"/\",\n    duplicate_name_allowed=True,\n    node_type=Node,\n)\n</code></pre> <p>Construct tree from list of path strings.</p> <p>Path should contain <code>Node</code> name, separated by <code>sep</code>.</p> <ul> <li>For example: Path string \"a/b\" refers to Node(\"b\") with parent Node(\"a\").</li> </ul> <p>Path can start from root node <code>name</code>, or start with <code>sep</code>.</p> <ul> <li>For example: Path string can be \"/a/b\" or \"a/b\", if sep is \"/\".</li> </ul> <p>All paths should start from the same root node.</p> <ul> <li>For example: Path strings should be \"a/b\", \"a/c\", \"a/b/d\" etc. and should not start with another root node.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import list_to_tree\n&gt;&gt;&gt; path_list = [\"a/b\", \"a/c\", \"a/b/d\", \"a/b/e\", \"a/c/f\", \"a/b/e/g\", \"a/b/e/h\"]\n&gt;&gt;&gt; root = list_to_tree(path_list)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>paths</code> <code>List[str]</code> <p>list containing path strings</p> required <code>sep</code> <code>str</code> <p>path separator for input <code>paths</code> and created tree, defaults to <code>/</code></p> <code>'/'</code> <code>duplicate_name_allowed</code> <code>bool</code> <p>indicator if nodes with duplicate <code>Node</code> name is allowed, defaults to True</p> <code>True</code> <code>node_type</code> <code>Type[Node]</code> <p>node type of tree to be created, defaults to <code>Node</code></p> <code>Node</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.list_to_tree_by_relation","title":"list_to_tree_by_relation","text":"<pre><code>list_to_tree_by_relation(\n    relations, allow_duplicates=False, node_type=Node\n)\n</code></pre> <p>Construct tree from list of tuple containing parent-child names.</p> <p>Root node is inferred when parent is empty, or when name appears as parent but not as child.</p> <p>Since tree is created from parent-child names, only names of leaf nodes may be repeated. Error will be thrown if names of intermediate nodes are repeated as there will be confusion. This error can be ignored by setting <code>allow_duplicates</code> to be True.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import list_to_tree_by_relation\n&gt;&gt;&gt; relations_list = [(\"a\", \"b\"), (\"a\", \"c\"), (\"b\", \"d\"), (\"b\", \"e\"), (\"c\", \"f\"), (\"e\", \"g\"), (\"e\", \"h\")]\n&gt;&gt;&gt; root = list_to_tree_by_relation(relations_list)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>relations</code> <code>List[Tuple[str, str]]</code> <p>list containing tuple containing parent-child names</p> required <code>allow_duplicates</code> <code>bool</code> <p>allow duplicate intermediate nodes such that child node will be tagged to multiple parent nodes, defaults to False</p> <code>False</code> <code>node_type</code> <code>Type[Node]</code> <p>node type of tree to be created, defaults to <code>Node</code></p> <code>Node</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.dict_to_tree","title":"dict_to_tree","text":"<pre><code>dict_to_tree(\n    path_attrs,\n    sep=\"/\",\n    duplicate_name_allowed=True,\n    node_type=Node,\n)\n</code></pre> <p>Construct tree from nested dictionary using path, <code>key</code>: path, <code>value</code>: dict of attribute name and attribute value.</p> <p>Path should contain <code>Node</code> name, separated by <code>sep</code>.</p> <ul> <li>For example: Path string \"a/b\" refers to Node(\"b\") with parent Node(\"a\").</li> </ul> <p>Path can start from root node <code>name</code>, or start with <code>sep</code>.</p> <ul> <li>For example: Path string can be \"/a/b\" or \"a/b\", if sep is \"/\".</li> </ul> <p>All paths should start from the same root node.</p> <ul> <li>For example: Path strings should be \"a/b\", \"a/c\", \"a/b/d\" etc. and should not start with another root node.</li> </ul> <p>All attributes in <code>path_attrs</code> will be added to the tree, including attributes with null values.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import dict_to_tree\n&gt;&gt;&gt; path_dict = {\n...     \"a\": {\"age\": 90},\n...     \"a/b\": {\"age\": 65},\n...     \"a/c\": {\"age\": 60},\n...     \"a/b/d\": {\"age\": 40},\n...     \"a/b/e\": {\"age\": 35},\n...     \"a/c/f\": {\"age\": 38},\n...     \"a/b/e/g\": {\"age\": 10},\n...     \"a/b/e/h\": {\"age\": 6},\n... }\n&gt;&gt;&gt; root = dict_to_tree(path_dict)\n&gt;&gt;&gt; root.show(attr_list=[\"age\"])\na [age=90]\n\u251c\u2500\u2500 b [age=65]\n\u2502   \u251c\u2500\u2500 d [age=40]\n\u2502   \u2514\u2500\u2500 e [age=35]\n\u2502       \u251c\u2500\u2500 g [age=10]\n\u2502       \u2514\u2500\u2500 h [age=6]\n\u2514\u2500\u2500 c [age=60]\n    \u2514\u2500\u2500 f [age=38]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>path_attrs</code> <code>Dict[str, Any]</code> <p>dictionary containing path and node attribute information, key: path, value: dict of tree attribute and attribute value</p> required <code>sep</code> <code>str</code> <p>path separator of input <code>path_attrs</code> and created tree, defaults to <code>/</code></p> <code>'/'</code> <code>duplicate_name_allowed</code> <code>bool</code> <p>indicator if nodes with duplicate <code>Node</code> name is allowed, defaults to True</p> <code>True</code> <code>node_type</code> <code>Type[Node]</code> <p>node type of tree to be created, defaults to <code>Node</code></p> <code>Node</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.nested_dict_to_tree","title":"nested_dict_to_tree","text":"<pre><code>nested_dict_to_tree(\n    node_attrs,\n    name_key=\"name\",\n    child_key=\"children\",\n    node_type=Node,\n)\n</code></pre> <p>Construct tree from nested recursive dictionary.</p> <ul> <li><code>key</code>: <code>name_key</code>, <code>child_key</code>, or any attributes key.</li> <li><code>value</code> of <code>name_key</code> (str): node name.</li> <li><code>value</code> of <code>child_key</code> (List[Dict[str, Any]]): list of dict containing <code>name_key</code> and <code>child_key</code> (recursive).</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import nested_dict_to_tree\n&gt;&gt;&gt; path_dict = {\n...     \"name\": \"a\",\n...     \"age\": 90,\n...     \"children\": [\n...         {\"name\": \"b\",\n...          \"age\": 65,\n...          \"children\": [\n...              {\"name\": \"d\", \"age\": 40},\n...              {\"name\": \"e\", \"age\": 35, \"children\": [\n...                  {\"name\": \"g\", \"age\": 10},\n...              ]},\n...          ]},\n...     ],\n... }\n&gt;&gt;&gt; root = nested_dict_to_tree(path_dict)\n&gt;&gt;&gt; root.show(attr_list=[\"age\"])\na [age=90]\n\u2514\u2500\u2500 b [age=65]\n    \u251c\u2500\u2500 d [age=40]\n    \u2514\u2500\u2500 e [age=35]\n        \u2514\u2500\u2500 g [age=10]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>node_attrs</code> <code>Dict[str, Any]</code> <p>dictionary containing node, children, and node attribute information, key: <code>name_key</code> and <code>child_key</code> value of <code>name_key</code> (str): node name value of <code>child_key</code> (List[Dict[str, Any]]): list of dict containing <code>name_key</code> and <code>child_key</code> (recursive)</p> required <code>name_key</code> <code>str</code> <p>key of node name, value is type str</p> <code>'name'</code> <code>child_key</code> <code>str</code> <p>key of child list, value is type list</p> <code>'children'</code> <code>node_type</code> <code>Type[Node]</code> <p>node type of tree to be created, defaults to <code>Node</code></p> <code>Node</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.dataframe_to_tree","title":"dataframe_to_tree","text":"<pre><code>dataframe_to_tree(\n    data,\n    path_col=\"\",\n    attribute_cols=[],\n    sep=\"/\",\n    duplicate_name_allowed=True,\n    node_type=Node,\n)\n</code></pre> <p>Construct tree from pandas DataFrame using path, return root of tree.</p> <p><code>path_col</code> and <code>attribute_cols</code> specify columns for node path and attributes to construct tree. If columns are not specified, <code>path_col</code> takes first column and all other columns are <code>attribute_cols</code>.</p> <p>Only attributes in <code>attribute_cols</code> with non-null values will be added to the tree.</p> <p>Path in path column can start from root node <code>name</code>, or start with <code>sep</code>.</p> <ul> <li>For example: Path string can be \"/a/b\" or \"a/b\", if sep is \"/\".</li> </ul> <p>Path in path column should contain <code>Node</code> name, separated by <code>sep</code>.</p> <ul> <li>For example: Path string \"a/b\" refers to Node(\"b\") with parent Node(\"a\").</li> </ul> <p>All paths should start from the same root node.</p> <ul> <li>For example: Path strings should be \"a/b\", \"a/c\", \"a/b/d\" etc. and should not start with another root node.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; import pandas as pd\n&gt;&gt;&gt; from bigtree import dataframe_to_tree\n&gt;&gt;&gt; path_data = pd.DataFrame([\n...     [\"a\", 90],\n...     [\"a/b\", 65],\n...     [\"a/c\", 60],\n...     [\"a/b/d\", 40],\n...     [\"a/b/e\", 35],\n...     [\"a/c/f\", 38],\n...     [\"a/b/e/g\", 10],\n...     [\"a/b/e/h\", 6],\n... ],\n...     columns=[\"PATH\", \"age\"]\n... )\n&gt;&gt;&gt; root = dataframe_to_tree(path_data)\n&gt;&gt;&gt; root.show(attr_list=[\"age\"])\na [age=90]\n\u251c\u2500\u2500 b [age=65]\n\u2502   \u251c\u2500\u2500 d [age=40]\n\u2502   \u2514\u2500\u2500 e [age=35]\n\u2502       \u251c\u2500\u2500 g [age=10]\n\u2502       \u2514\u2500\u2500 h [age=6]\n\u2514\u2500\u2500 c [age=60]\n    \u2514\u2500\u2500 f [age=38]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>data</code> <code>DataFrame</code> <p>data containing path and node attribute information</p> required <code>path_col</code> <code>str</code> <p>column of data containing <code>path_name</code> information, if not set, it will take the first column of data</p> <code>''</code> <code>attribute_cols</code> <code>List[str]</code> <p>columns of data containing node attribute information, if not set, it will take all columns of data except <code>path_col</code></p> <code>[]</code> <code>sep</code> <code>str</code> <p>path separator of input <code>path_col</code> and created tree, defaults to <code>/</code></p> <code>'/'</code> <code>duplicate_name_allowed</code> <code>bool</code> <p>indicator if nodes with duplicate <code>Node</code> name is allowed, defaults to True</p> <code>True</code> <code>node_type</code> <code>Type[Node]</code> <p>node type of tree to be created, defaults to <code>Node</code></p> <code>Node</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.dataframe_to_tree_by_relation","title":"dataframe_to_tree_by_relation","text":"<pre><code>dataframe_to_tree_by_relation(\n    data,\n    child_col=\"\",\n    parent_col=\"\",\n    attribute_cols=[],\n    allow_duplicates=False,\n    node_type=Node,\n)\n</code></pre> <p>Construct tree from pandas DataFrame using parent and child names, return root of tree.</p> <p>Root node is inferred when parent name is empty, or when name appears in parent column but not in child column.</p> <p>Since tree is created from parent-child names, only names of leaf nodes may be repeated. Error will be thrown if names of intermediate nodes are repeated as there will be confusion. This error can be ignored by setting <code>allow_duplicates</code> to be True.</p> <p><code>child_col</code> and <code>parent_col</code> specify columns for child name and parent name to construct tree. <code>attribute_cols</code> specify columns for node attribute for child name. If columns are not specified, <code>child_col</code> takes first column, <code>parent_col</code> takes second column, and all other columns are <code>attribute_cols</code>.</p> <p>Only attributes in <code>attribute_cols</code> with non-null values will be added to the tree.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; import pandas as pd\n&gt;&gt;&gt; from bigtree import dataframe_to_tree_by_relation\n&gt;&gt;&gt; relation_data = pd.DataFrame([\n...     [\"a\", None, 90],\n...     [\"b\", \"a\", 65],\n...     [\"c\", \"a\", 60],\n...     [\"d\", \"b\", 40],\n...     [\"e\", \"b\", 35],\n...     [\"f\", \"c\", 38],\n...     [\"g\", \"e\", 10],\n...     [\"h\", \"e\", 6],\n... ],\n...     columns=[\"child\", \"parent\", \"age\"]\n... )\n&gt;&gt;&gt; root = dataframe_to_tree_by_relation(relation_data)\n&gt;&gt;&gt; root.show(attr_list=[\"age\"])\na [age=90]\n\u251c\u2500\u2500 b [age=65]\n\u2502   \u251c\u2500\u2500 d [age=40]\n\u2502   \u2514\u2500\u2500 e [age=35]\n\u2502       \u251c\u2500\u2500 g [age=10]\n\u2502       \u2514\u2500\u2500 h [age=6]\n\u2514\u2500\u2500 c [age=60]\n    \u2514\u2500\u2500 f [age=38]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>data</code> <code>DataFrame</code> <p>data containing path and node attribute information</p> required <code>child_col</code> <code>str</code> <p>column of data containing child name information, defaults to None if not set, it will take the first column of data</p> <code>''</code> <code>parent_col</code> <code>str</code> <p>column of data containing parent name information, defaults to None if not set, it will take the second column of data</p> <code>''</code> <code>attribute_cols</code> <code>List[str]</code> <p>columns of data containing node attribute information, if not set, it will take all columns of data except <code>child_col</code> and <code>parent_col</code></p> <code>[]</code> <code>allow_duplicates</code> <code>bool</code> <p>allow duplicate intermediate nodes such that child node will be tagged to multiple parent nodes, defaults to False</p> <code>False</code> <code>node_type</code> <code>Type[Node]</code> <p>node type of tree to be created, defaults to <code>Node</code></p> <code>Node</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.polars_to_tree","title":"polars_to_tree","text":"<pre><code>polars_to_tree(\n    data,\n    path_col=\"\",\n    attribute_cols=[],\n    sep=\"/\",\n    duplicate_name_allowed=True,\n    node_type=Node,\n)\n</code></pre> <p>Construct tree from polars DataFrame using path, return root of tree.</p> <p><code>path_col</code> and <code>attribute_cols</code> specify columns for node path and attributes to construct tree. If columns are not specified, <code>path_col</code> takes first column and all other columns are <code>attribute_cols</code>.</p> <p>Only attributes in <code>attribute_cols</code> with non-null values will be added to the tree.</p> <p>Path in path column can start from root node <code>name</code>, or start with <code>sep</code>.</p> <ul> <li>For example: Path string can be \"/a/b\" or \"a/b\", if sep is \"/\".</li> </ul> <p>Path in path column should contain <code>Node</code> name, separated by <code>sep</code>.</p> <ul> <li>For example: Path string \"a/b\" refers to Node(\"b\") with parent Node(\"a\").</li> </ul> <p>All paths should start from the same root node.</p> <ul> <li>For example: Path strings should be \"a/b\", \"a/c\", \"a/b/d\" etc. and should not start with another root node.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; import polars as pl\n&gt;&gt;&gt; from bigtree import polars_to_tree\n&gt;&gt;&gt; path_data = pl.DataFrame([\n...     [\"a\", 90],\n...     [\"a/b\", 65],\n...     [\"a/c\", 60],\n...     [\"a/b/d\", 40],\n...     [\"a/b/e\", 35],\n...     [\"a/c/f\", 38],\n...     [\"a/b/e/g\", 10],\n...     [\"a/b/e/h\", 6],\n... ],\n...     schema=[\"PATH\", \"age\"]\n... )\n&gt;&gt;&gt; root = polars_to_tree(path_data)\n&gt;&gt;&gt; root.show(attr_list=[\"age\"])\na [age=90]\n\u251c\u2500\u2500 b [age=65]\n\u2502   \u251c\u2500\u2500 d [age=40]\n\u2502   \u2514\u2500\u2500 e [age=35]\n\u2502       \u251c\u2500\u2500 g [age=10]\n\u2502       \u2514\u2500\u2500 h [age=6]\n\u2514\u2500\u2500 c [age=60]\n    \u2514\u2500\u2500 f [age=38]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>data</code> <code>DataFrame</code> <p>data containing path and node attribute information</p> required <code>path_col</code> <code>str</code> <p>column of data containing <code>path_name</code> information, if not set, it will take the first column of data</p> <code>''</code> <code>attribute_cols</code> <code>List[str]</code> <p>columns of data containing node attribute information, if not set, it will take all columns of data except <code>path_col</code></p> <code>[]</code> <code>sep</code> <code>str</code> <p>path separator of input <code>path_col</code> and created tree, defaults to <code>/</code></p> <code>'/'</code> <code>duplicate_name_allowed</code> <code>bool</code> <p>indicator if nodes with duplicate <code>Node</code> name is allowed, defaults to True</p> <code>True</code> <code>node_type</code> <code>Type[Node]</code> <p>node type of tree to be created, defaults to <code>Node</code></p> <code>Node</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.polars_to_tree_by_relation","title":"polars_to_tree_by_relation","text":"<pre><code>polars_to_tree_by_relation(\n    data,\n    child_col=\"\",\n    parent_col=\"\",\n    attribute_cols=[],\n    allow_duplicates=False,\n    node_type=Node,\n)\n</code></pre> <p>Construct tree from polars DataFrame using parent and child names, return root of tree.</p> <p>Root node is inferred when parent name is empty, or when name appears in parent column but not in child column.</p> <p>Since tree is created from parent-child names, only names of leaf nodes may be repeated. Error will be thrown if names of intermediate nodes are repeated as there will be confusion. This error can be ignored by setting <code>allow_duplicates</code> to be True.</p> <p><code>child_col</code> and <code>parent_col</code> specify columns for child name and parent name to construct tree. <code>attribute_cols</code> specify columns for node attribute for child name. If columns are not specified, <code>child_col</code> takes first column, <code>parent_col</code> takes second column, and all other columns are <code>attribute_cols</code>.</p> <p>Only attributes in <code>attribute_cols</code> with non-null values will be added to the tree.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; import polars as pl\n&gt;&gt;&gt; from bigtree import polars_to_tree_by_relation\n&gt;&gt;&gt; relation_data = pl.DataFrame([\n...     [\"a\", None, 90],\n...     [\"b\", \"a\", 65],\n...     [\"c\", \"a\", 60],\n...     [\"d\", \"b\", 40],\n...     [\"e\", \"b\", 35],\n...     [\"f\", \"c\", 38],\n...     [\"g\", \"e\", 10],\n...     [\"h\", \"e\", 6],\n... ],\n...     schema=[\"child\", \"parent\", \"age\"]\n... )\n&gt;&gt;&gt; root = polars_to_tree_by_relation(relation_data)\n&gt;&gt;&gt; root.show(attr_list=[\"age\"])\na [age=90]\n\u251c\u2500\u2500 b [age=65]\n\u2502   \u251c\u2500\u2500 d [age=40]\n\u2502   \u2514\u2500\u2500 e [age=35]\n\u2502       \u251c\u2500\u2500 g [age=10]\n\u2502       \u2514\u2500\u2500 h [age=6]\n\u2514\u2500\u2500 c [age=60]\n    \u2514\u2500\u2500 f [age=38]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>data</code> <code>DataFrame</code> <p>data containing path and node attribute information</p> required <code>child_col</code> <code>str</code> <p>column of data containing child name information, defaults to None if not set, it will take the first column of data</p> <code>''</code> <code>parent_col</code> <code>str</code> <p>column of data containing parent name information, defaults to None if not set, it will take the second column of data</p> <code>''</code> <code>attribute_cols</code> <code>List[str]</code> <p>columns of data containing node attribute information, if not set, it will take all columns of data except <code>child_col</code> and <code>parent_col</code></p> <code>[]</code> <code>allow_duplicates</code> <code>bool</code> <p>allow duplicate intermediate nodes such that child node will be tagged to multiple parent nodes, defaults to False</p> <code>False</code> <code>node_type</code> <code>Type[Node]</code> <p>node type of tree to be created, defaults to <code>Node</code></p> <code>Node</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/construct/#bigtree.tree.construct.newick_to_tree","title":"newick_to_tree","text":"<pre><code>newick_to_tree(\n    tree_string,\n    length_attr=\"length\",\n    attr_prefix=\"&amp;&amp;NHX:\",\n    node_type=Node,\n)\n</code></pre> <p>Construct tree from Newick notation, return root of tree.</p> <p>In the Newick Notation (or New Hampshire Notation)</p> <ul> <li>Tree is represented in round brackets i.e., <code>(child1,child2,child3)parent</code>.</li> <li>If there are nested tree, they will be in nested round brackets i.e., <code>((grandchild1)child1,(grandchild2,grandchild3)child2)parent</code>.</li> <li>If there is length attribute, they will be beside the name i.e., <code>(child1:0.5,child2:0.1)parent</code>.</li> <li>If there are other attributes, attributes are represented in square brackets i.e., <code>(child1:0.5[S:human],child2:0.1[S:human])parent[S:parent]</code>.</li> </ul> <p>Variations supported</p> <ul> <li>Support special characters (<code>[</code>, <code>]</code>, <code>(</code>, <code>)</code>, <code>:</code>, <code>,</code>) in node name, attribute name, and attribute values if     they are enclosed in single quotes i.e., '(name:!)'.</li> <li>If there are no node names, it will be auto-filled with convention <code>nodeN</code> with N representing a number.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import newick_to_tree\n&gt;&gt;&gt; root = newick_to_tree(\"((d,e)b,c)a\")\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2514\u2500\u2500 c\n</code></pre> <pre><code>&gt;&gt;&gt; root = newick_to_tree(\"((d:40,e:35)b:65,c:60)a\", length_attr=\"age\")\n&gt;&gt;&gt; root.show(attr_list=[\"age\"])\na\n\u251c\u2500\u2500 b [age=65]\n\u2502   \u251c\u2500\u2500 d [age=40]\n\u2502   \u2514\u2500\u2500 e [age=35]\n\u2514\u2500\u2500 c [age=60]\n</code></pre> <pre><code>&gt;&gt;&gt; root = newick_to_tree(\n...     \"((d:40[&amp;&amp;NHX:species=human],e:35[&amp;&amp;NHX:species=human])b:65[&amp;&amp;NHX:species=human],c:60[&amp;&amp;NHX:species=human])a[&amp;&amp;NHX:species=human]\",\n...     length_attr=\"age\",\n... )\n&gt;&gt;&gt; root.show(all_attrs=True)\na [species=human]\n\u251c\u2500\u2500 b [age=65, species=human]\n\u2502   \u251c\u2500\u2500 d [age=40, species=human]\n\u2502   \u2514\u2500\u2500 e [age=35, species=human]\n\u2514\u2500\u2500 c [age=60, species=human]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree_string</code> <code>str</code> <p>Newick notation to construct tree</p> required <code>length_attr</code> <code>str</code> <p>attribute name to store node length, optional, defaults to 'length'</p> <code>'length'</code> <code>attr_prefix</code> <code>str</code> <p>prefix before all attributes, within square bracket, used to detect attributes, defaults to \"&amp;&amp;NHX:\"</p> <code>'&amp;&amp;NHX:'</code> <code>node_type</code> <code>Type[Node]</code> <p>node type of tree to be created, defaults to <code>Node</code></p> <code>Node</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/export/","title":"\ud83d\udd28 Export","text":""},{"location":"bigtree/tree/export/#tree-export-methods","title":"Tree Export Methods","text":"<p>Export Tree to list, dictionary, and pandas DataFrame.</p> Export Tree to Method Command Line / Others <code>print_tree</code>, <code>yield_tree</code>, <code>hprint_tree</code>, <code>hyield_tree</code> String <code>tree_to_newick</code> Dictionary <code>tree_to_dict</code>, <code>tree_to_nested_dict</code> DataFrame (pandas, polars) <code>tree_to_dataframe</code>, <code>tree_to_polars</code> Dot (for .dot, .png, .svg, .jpeg, etc.) <code>tree_to_dot</code> Pillow (for .png, .jpg, .jpeg, etc.) <code>tree_to_mermaid</code> Mermaid Markdown (for .md) <code>tree_to_mermaid</code>"},{"location":"bigtree/tree/export/#tree-export-customizations","title":"Tree Export Customizations","text":"<p>While exporting to another data type, methods can take in arguments to determine what information to extract.</p> Method Extract node attributes Specify maximum depth Skip depth Extract leaves only Others <code>print_tree</code> Yes with <code>attr_list</code> or <code>all_attrs</code> Yes with <code>max_depth</code> No, but can specify subtree No Tree style <code>yield_tree</code> No, returns node Yes with <code>max_depth</code> No, but can specify subtree No Tree style <code>tree_to_newick</code> Yes with <code>attr_list</code> No No No Length separator and attribute prefix and separator <code>tree_to_dict</code> Yes with <code>attr_dict</code> or <code>all_attrs</code> Yes with <code>max_depth</code> Yes with <code>skip_depth</code> Yes with <code>leaf_only</code> Dict key for parent <code>tree_to_nested_dict</code> Yes with <code>attr_dict</code> or <code>all_attrs</code> Yes with <code>max_depth</code> No No Dict key for node name and node children <code>tree_to_dataframe</code> Yes with <code>attr_dict</code> or <code>all_attrs</code> Yes with <code>max_depth</code> Yes with <code>skip_depth</code> Yes with <code>leaf_only</code> Column name for path, node name, node parent <code>tree_to_polars</code> Yes with <code>attr_dict</code> or <code>all_attrs</code> Yes with <code>max_depth</code> Yes with <code>skip_depth</code> Yes with <code>leaf_only</code> Column name for path, node name, node parent <code>tree_to_dot</code> No No No No Graph attributes, background, node, edge colour, etc. <code>tree_to_pillow</code> No Yes, using keyword arguments similar to <code>yield_tree</code> No No Font (family, size, colour), background colour, etc. <code>tree_to_mermaid</code> No Yes, using keyword arguments similar to <code>yield_tree</code> No No Node shape, node fill, edge arrow, edge label etc."},{"location":"bigtree/tree/export/#bigtree.tree.export","title":"bigtree.tree.export","text":""},{"location":"bigtree/tree/export/#bigtree.tree.export.print_tree","title":"print_tree","text":"<pre><code>print_tree(\n    tree,\n    node_name_or_path=\"\",\n    max_depth=0,\n    all_attrs=False,\n    attr_list=[],\n    attr_omit_null=False,\n    attr_bracket=[\"[\", \"]\"],\n    style=\"const\",\n    custom_style=[],\n)\n</code></pre> <p>Print tree to console, starting from <code>tree</code>.</p> <ul> <li>Able to select which node to print from, resulting in a subtree, using <code>node_name_or_path</code></li> <li>Able to customize for maximum depth to print, using <code>max_depth</code></li> <li>Able to choose which attributes to show or show all attributes, using <code>attr_name_filter</code> and <code>all_attrs</code></li> <li>Able to omit showing of attributes if it is null, using <code>attr_omit_null</code></li> <li>Able to customize open and close brackets if attributes are shown, using <code>attr_bracket</code></li> <li>Able to customize style, to choose from <code>ansi</code>, <code>ascii</code>, <code>const</code>, <code>const_bold</code>, <code>rounded</code>, <code>double</code>, and <code>custom</code> style     - Default style is <code>const</code> style     - If style is set to custom, user can choose their own style for stem, branch and final stem icons     - Stem, branch, and final stem symbol should have the same number of characters</li> </ul> <p>Examples:</p> <p>Printing tree</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, print_tree\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=b)\n&gt;&gt;&gt; e = Node(\"e\", age=35, parent=b)\n&gt;&gt;&gt; print_tree(root)\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2514\u2500\u2500 c\n</code></pre> <p>Printing Sub-tree</p> <pre><code>&gt;&gt;&gt; print_tree(root, node_name_or_path=\"b\")\nb\n\u251c\u2500\u2500 d\n\u2514\u2500\u2500 e\n</code></pre> <pre><code>&gt;&gt;&gt; print_tree(root, max_depth=2)\na\n\u251c\u2500\u2500 b\n\u2514\u2500\u2500 c\n</code></pre> <p>Printing Attributes</p> <pre><code>&gt;&gt;&gt; print_tree(root, attr_list=[\"age\"])\na [age=90]\n\u251c\u2500\u2500 b [age=65]\n\u2502   \u251c\u2500\u2500 d [age=40]\n\u2502   \u2514\u2500\u2500 e [age=35]\n\u2514\u2500\u2500 c [age=60]\n</code></pre> <pre><code>&gt;&gt;&gt; print_tree(root, attr_list=[\"age\"], attr_bracket=[\"*(\", \")\"])\na *(age=90)\n\u251c\u2500\u2500 b *(age=65)\n\u2502   \u251c\u2500\u2500 d *(age=40)\n\u2502   \u2514\u2500\u2500 e *(age=35)\n\u2514\u2500\u2500 c *(age=60)\n</code></pre> <p>Available Styles</p> <pre><code>&gt;&gt;&gt; print_tree(root, style=\"ansi\")\na\n|-- b\n|   |-- d\n|   `-- e\n`-- c\n</code></pre> <pre><code>&gt;&gt;&gt; print_tree(root, style=\"ascii\")\na\n|-- b\n|   |-- d\n|   +-- e\n+-- c\n</code></pre> <pre><code>&gt;&gt;&gt; print_tree(root, style=\"const\")\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2514\u2500\u2500 c\n</code></pre> <pre><code>&gt;&gt;&gt; print_tree(root, style=\"const_bold\")\na\n\u2523\u2501\u2501 b\n\u2503   \u2523\u2501\u2501 d\n\u2503   \u2517\u2501\u2501 e\n\u2517\u2501\u2501 c\n</code></pre> <pre><code>&gt;&gt;&gt; print_tree(root, style=\"rounded\")\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2570\u2500\u2500 e\n\u2570\u2500\u2500 c\n</code></pre> <pre><code>&gt;&gt;&gt; print_tree(root, style=\"double\")\na\n\u2560\u2550\u2550 b\n\u2551   \u2560\u2550\u2550 d\n\u2551   \u255a\u2550\u2550 e\n\u255a\u2550\u2550 c\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to print</p> required <code>node_name_or_path</code> <code>str</code> <p>node to print from, becomes the root node of printing</p> <code>''</code> <code>max_depth</code> <code>int</code> <p>maximum depth of tree to print, based on <code>depth</code> attribute, optional</p> <code>0</code> <code>all_attrs</code> <code>bool</code> <p>indicator to show all attributes, defaults to False, overrides <code>attr_list</code> and <code>attr_omit_null</code></p> <code>False</code> <code>attr_list</code> <code>Iterable[str]</code> <p>list of node attributes to print, optional</p> <code>[]</code> <code>attr_omit_null</code> <code>bool</code> <p>indicator whether to omit showing of null attributes, defaults to False</p> <code>False</code> <code>attr_bracket</code> <code>List[str]</code> <p>open and close bracket for <code>all_attrs</code> or <code>attr_list</code></p> <code>['[', ']']</code> <code>style</code> <code>str</code> <p>style of print, defaults to const style</p> <code>'const'</code> <code>custom_style</code> <code>Iterable[str]</code> <p>style of stem, branch and final stem, used when <code>style</code> is set to 'custom'</p> <code>[]</code>"},{"location":"bigtree/tree/export/#bigtree.tree.export.yield_tree","title":"yield_tree","text":"<pre><code>yield_tree(\n    tree,\n    node_name_or_path=\"\",\n    max_depth=0,\n    style=\"const\",\n    custom_style=[],\n)\n</code></pre> <p>Generator method for customizing printing of tree, starting from <code>tree</code>.</p> <ul> <li>Able to select which node to print from, resulting in a subtree, using <code>node_name_or_path</code></li> <li>Able to customize for maximum depth to print, using <code>max_depth</code></li> <li>Able to customize style, to choose from <code>ansi</code>, <code>ascii</code>, <code>const</code>, <code>const_bold</code>, <code>rounded</code>, <code>double</code>, and <code>custom</code> style     - Default style is <code>const</code> style     - If style is set to custom, user can choose their own style for stem, branch and final stem icons     - Stem, branch, and final stem symbol should have the same number of characters</li> </ul> <p>Examples:</p> <p>Yield tree</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, yield_tree\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=b)\n&gt;&gt;&gt; e = Node(\"e\", age=35, parent=b)\n&gt;&gt;&gt; for branch, stem, node in yield_tree(root):\n...     print(f\"{branch}{stem}{node.node_name}\")\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2514\u2500\u2500 c\n</code></pre> <p>Yield Sub-tree</p> <pre><code>&gt;&gt;&gt; for branch, stem, node in yield_tree(root, node_name_or_path=\"b\"):\n...     print(f\"{branch}{stem}{node.node_name}\")\nb\n\u251c\u2500\u2500 d\n\u2514\u2500\u2500 e\n</code></pre> <pre><code>&gt;&gt;&gt; for branch, stem, node in yield_tree(root, max_depth=2):\n...     print(f\"{branch}{stem}{node.node_name}\")\na\n\u251c\u2500\u2500 b\n\u2514\u2500\u2500 c\n</code></pre> <p>Available Styles</p> <pre><code>&gt;&gt;&gt; for branch, stem, node in yield_tree(root, style=\"ansi\"):\n...     print(f\"{branch}{stem}{node.node_name}\")\na\n|-- b\n|   |-- d\n|   `-- e\n`-- c\n</code></pre> <pre><code>&gt;&gt;&gt; for branch, stem, node in yield_tree(root, style=\"ascii\"):\n...     print(f\"{branch}{stem}{node.node_name}\")\na\n|-- b\n|   |-- d\n|   +-- e\n+-- c\n</code></pre> <pre><code>&gt;&gt;&gt; for branch, stem, node in yield_tree(root, style=\"const\"):\n...     print(f\"{branch}{stem}{node.node_name}\")\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2514\u2500\u2500 c\n</code></pre> <pre><code>&gt;&gt;&gt; for branch, stem, node in yield_tree(root, style=\"const_bold\"):\n...     print(f\"{branch}{stem}{node.node_name}\")\na\n\u2523\u2501\u2501 b\n\u2503   \u2523\u2501\u2501 d\n\u2503   \u2517\u2501\u2501 e\n\u2517\u2501\u2501 c\n</code></pre> <pre><code>&gt;&gt;&gt; for branch, stem, node in yield_tree(root, style=\"rounded\"):\n...     print(f\"{branch}{stem}{node.node_name}\")\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2570\u2500\u2500 e\n\u2570\u2500\u2500 c\n</code></pre> <pre><code>&gt;&gt;&gt; for branch, stem, node in yield_tree(root, style=\"double\"):\n...     print(f\"{branch}{stem}{node.node_name}\")\na\n\u2560\u2550\u2550 b\n\u2551   \u2560\u2550\u2550 d\n\u2551   \u255a\u2550\u2550 e\n\u255a\u2550\u2550 c\n</code></pre> <p>Printing Attributes</p> <pre><code>&gt;&gt;&gt; for branch, stem, node in yield_tree(root, style=\"const\"):\n...     print(f\"{branch}{stem}{node.node_name} [age={node.age}]\")\na [age=90]\n\u251c\u2500\u2500 b [age=65]\n\u2502   \u251c\u2500\u2500 d [age=40]\n\u2502   \u2514\u2500\u2500 e [age=35]\n\u2514\u2500\u2500 c [age=60]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to print</p> required <code>node_name_or_path</code> <code>str</code> <p>node to print from, becomes the root node of printing, optional</p> <code>''</code> <code>max_depth</code> <code>int</code> <p>maximum depth of tree to print, based on <code>depth</code> attribute, optional</p> <code>0</code> <code>style</code> <code>str</code> <p>style of print, defaults to const</p> <code>'const'</code> <code>custom_style</code> <code>Iterable[str]</code> <p>style of stem, branch and final stem, used when <code>style</code> is set to 'custom'</p> <code>[]</code>"},{"location":"bigtree/tree/export/#bigtree.tree.export.hprint_tree","title":"hprint_tree","text":"<pre><code>hprint_tree(\n    tree,\n    node_name_or_path=\"\",\n    max_depth=0,\n    intermediate_node_name=True,\n    style=\"const\",\n    custom_style=[],\n)\n</code></pre> <p>Print tree in horizontal orientation to console, starting from <code>tree</code>.</p> <ul> <li>Able to select which node to print from, resulting in a subtree, using <code>node_name_or_path</code></li> <li>Able to customize for maximum depth to print, using <code>max_depth</code></li> <li>Able to customize style, to choose from <code>ansi</code>, <code>ascii</code>, <code>const</code>, <code>const_bold</code>, <code>rounded</code>, <code>double</code>, and <code>custom</code> style     - Default style is <code>const</code> style     - If style is set to custom, user can choose their own style icons     - Style icons should have the same number of characters</li> </ul> <p>Examples:</p> <p>Printing tree</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, hprint_tree\n&gt;&gt;&gt; root = Node(\"a\")\n&gt;&gt;&gt; b = Node(\"b\", parent=root)\n&gt;&gt;&gt; c = Node(\"c\", parent=root)\n&gt;&gt;&gt; d = Node(\"d\", parent=b)\n&gt;&gt;&gt; e = Node(\"e\", parent=b)\n&gt;&gt;&gt; hprint_tree(root)\n           \u250c\u2500 d\n     \u250c\u2500 b \u2500\u2524\n\u2500 a \u2500\u2524     \u2514\u2500 e\n     \u2514\u2500 c\n</code></pre> <p>Printing Sub-tree</p> <pre><code>&gt;&gt;&gt; hprint_tree(root, node_name_or_path=\"b\")\n     \u250c\u2500 d\n\u2500 b \u2500\u2524\n     \u2514\u2500 e\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, max_depth=2)\n     \u250c\u2500 b\n\u2500 a \u2500\u2524\n     \u2514\u2500 c\n</code></pre> <p>Available Styles</p> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"ansi\")\n           /- d\n     /- b -+\n- a -+     \\- e\n     \\- c\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"ascii\")\n           +- d\n     +- b -+\n- a -+     +- e\n     +- c\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"const\")\n           \u250c\u2500 d\n     \u250c\u2500 b \u2500\u2524\n\u2500 a \u2500\u2524     \u2514\u2500 e\n     \u2514\u2500 c\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"const_bold\")\n           \u250f\u2501 d\n     \u250f\u2501 b \u2501\u252b\n\u2501 a \u2501\u252b     \u2517\u2501 e\n     \u2517\u2501 c\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"rounded\")\n           \u256d\u2500 d\n     \u256d\u2500 b \u2500\u2524\n\u2500 a \u2500\u2524     \u2570\u2500 e\n     \u2570\u2500 c\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"double\")\n           \u2554\u2550 d\n     \u2554\u2550 b \u2550\u2563\n\u2550 a \u2550\u2563     \u255a\u2550 e\n     \u255a\u2550 c\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to print</p> required <code>node_name_or_path</code> <code>str</code> <p>node to print from, becomes the root node of printing</p> <code>''</code> <code>max_depth</code> <code>int</code> <p>maximum depth of tree to print, based on <code>depth</code> attribute, optional</p> <code>0</code> <code>intermediate_node_name</code> <code>bool</code> <p>indicator if intermediate nodes have node names, defaults to True</p> <code>True</code> <code>style</code> <code>str</code> <p>style of print, defaults to const style</p> <code>'const'</code> <code>custom_style</code> <code>Iterable[str]</code> <p>style of icons, used when <code>style</code> is set to 'custom'</p> <code>[]</code>"},{"location":"bigtree/tree/export/#bigtree.tree.export.hyield_tree","title":"hyield_tree","text":"<pre><code>hyield_tree(\n    tree,\n    node_name_or_path=\"\",\n    max_depth=0,\n    intermediate_node_name=True,\n    style=\"const\",\n    custom_style=[],\n)\n</code></pre> <p>Yield tree in horizontal orientation to console, starting from <code>tree</code>.</p> <ul> <li>Able to select which node to print from, resulting in a subtree, using <code>node_name_or_path</code></li> <li>Able to customize for maximum depth to print, using <code>max_depth</code></li> <li>Able to customize style, to choose from <code>ansi</code>, <code>ascii</code>, <code>const</code>, <code>const_bold</code>, <code>rounded</code>, <code>double</code>, and <code>custom</code> style     - Default style is <code>const</code> style     - If style is set to custom, user can choose their own style icons     - Style icons should have the same number of characters</li> </ul> <p>Examples:</p> <p>Printing tree</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, hyield_tree\n&gt;&gt;&gt; root = Node(\"a\")\n&gt;&gt;&gt; b = Node(\"b\", parent=root)\n&gt;&gt;&gt; c = Node(\"c\", parent=root)\n&gt;&gt;&gt; d = Node(\"d\", parent=b)\n&gt;&gt;&gt; e = Node(\"e\", parent=b)\n&gt;&gt;&gt; result = hyield_tree(root)\n&gt;&gt;&gt; print(\"\\n\".join(result))\n           \u250c\u2500 d\n     \u250c\u2500 b \u2500\u2524\n\u2500 a \u2500\u2524     \u2514\u2500 e\n     \u2514\u2500 c\n</code></pre> <p>Printing Sub-tree</p> <pre><code>&gt;&gt;&gt; hprint_tree(root, node_name_or_path=\"b\")\n     \u250c\u2500 d\n\u2500 b \u2500\u2524\n     \u2514\u2500 e\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, max_depth=2)\n     \u250c\u2500 b\n\u2500 a \u2500\u2524\n     \u2514\u2500 c\n</code></pre> <p>Available Styles</p> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"ansi\")\n           /- d\n     /- b -+\n- a -+     \\- e\n     \\- c\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"ascii\")\n           +- d\n     +- b -+\n- a -+     +- e\n     +- c\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"const\")\n           \u250c\u2500 d\n     \u250c\u2500 b \u2500\u2524\n\u2500 a \u2500\u2524     \u2514\u2500 e\n     \u2514\u2500 c\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"const_bold\")\n           \u250f\u2501 d\n     \u250f\u2501 b \u2501\u252b\n\u2501 a \u2501\u252b     \u2517\u2501 e\n     \u2517\u2501 c\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"rounded\")\n           \u256d\u2500 d\n     \u256d\u2500 b \u2500\u2524\n\u2500 a \u2500\u2524     \u2570\u2500 e\n     \u2570\u2500 c\n</code></pre> <pre><code>&gt;&gt;&gt; hprint_tree(root, style=\"double\")\n           \u2554\u2550 d\n     \u2554\u2550 b \u2550\u2563\n\u2550 a \u2550\u2563     \u255a\u2550 e\n     \u255a\u2550 c\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to print</p> required <code>node_name_or_path</code> <code>str</code> <p>node to print from, becomes the root node of printing</p> <code>''</code> <code>max_depth</code> <code>int</code> <p>maximum depth of tree to print, based on <code>depth</code> attribute, optional</p> <code>0</code> <code>intermediate_node_name</code> <code>bool</code> <p>indicator if intermediate nodes have node names, defaults to True</p> <code>True</code> <code>style</code> <code>str</code> <p>style of print, defaults to const style</p> <code>'const'</code> <code>custom_style</code> <code>Iterable[str]</code> <p>style of icons, used when <code>style</code> is set to 'custom'</p> <code>[]</code> <p>Returns:</p> Type Description <code>List[str]</code> <p>(List[str])</p>"},{"location":"bigtree/tree/export/#bigtree.tree.export.tree_to_dataframe","title":"tree_to_dataframe","text":"<pre><code>tree_to_dataframe(\n    tree,\n    path_col=\"path\",\n    name_col=\"name\",\n    parent_col=\"\",\n    attr_dict={},\n    all_attrs=False,\n    max_depth=0,\n    skip_depth=0,\n    leaf_only=False,\n)\n</code></pre> <p>Export tree to pandas DataFrame.</p> <p>All descendants from <code>tree</code> will be exported, <code>tree</code> can be the root node or child node of tree.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, tree_to_dataframe\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=b)\n&gt;&gt;&gt; e = Node(\"e\", age=35, parent=b)\n&gt;&gt;&gt; tree_to_dataframe(root, name_col=\"name\", parent_col=\"parent\", path_col=\"path\", attr_dict={\"age\": \"person age\"})\n     path name parent  person age\n0      /a    a   None          90\n1    /a/b    b      a          65\n2  /a/b/d    d      b          40\n3  /a/b/e    e      b          35\n4    /a/c    c      a          60\n</code></pre> <p>For a subset of a tree.</p> <pre><code>&gt;&gt;&gt; tree_to_dataframe(b, name_col=\"name\", parent_col=\"parent\", path_col=\"path\", attr_dict={\"age\": \"person age\"})\n     path name parent  person age\n0    /a/b    b      a          65\n1  /a/b/d    d      b          40\n2  /a/b/e    e      b          35\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to be exported</p> required <code>path_col</code> <code>str</code> <p>column name for <code>node.path_name</code>, defaults to 'path'</p> <code>'path'</code> <code>name_col</code> <code>str</code> <p>column name for <code>node.node_name</code>, defaults to 'name'</p> <code>'name'</code> <code>parent_col</code> <code>str</code> <p>column name for <code>node.parent.node_name</code>, optional</p> <code>''</code> <code>attr_dict</code> <code>Dict[str, str]</code> <p>dictionary mapping node attributes to column name, key: node attributes, value: corresponding column in dataframe, optional</p> <code>{}</code> <code>all_attrs</code> <code>bool</code> <p>indicator whether to retrieve all <code>Node</code> attributes, overrides <code>attr_dict</code>, defaults to False</p> <code>False</code> <code>max_depth</code> <code>int</code> <p>maximum depth to export tree, optional</p> <code>0</code> <code>skip_depth</code> <code>int</code> <p>number of initial depths to skip, optional</p> <code>0</code> <code>leaf_only</code> <code>bool</code> <p>indicator to retrieve only information from leaf nodes</p> <code>False</code> <p>Returns:</p> Type Description <code>DataFrame</code> <p>(pd.DataFrame)</p>"},{"location":"bigtree/tree/export/#bigtree.tree.export.tree_to_polars","title":"tree_to_polars","text":"<pre><code>tree_to_polars(\n    tree,\n    path_col=\"path\",\n    name_col=\"name\",\n    parent_col=\"\",\n    attr_dict={},\n    all_attrs=False,\n    max_depth=0,\n    skip_depth=0,\n    leaf_only=False,\n)\n</code></pre> <p>Export tree to polars DataFrame.</p> <p>All descendants from <code>tree</code> will be exported, <code>tree</code> can be the root node or child node of tree.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, tree_to_polars\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=b)\n&gt;&gt;&gt; e = Node(\"e\", age=35, parent=b)\n&gt;&gt;&gt; tree_to_polars(root, name_col=\"name\", parent_col=\"parent\", path_col=\"path\", attr_dict={\"age\": \"person age\"})\nshape: (5, 4)\n\u250c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2510\n\u2502 path   \u2506 name \u2506 parent \u2506 person age \u2502\n\u2502 ---    \u2506 ---  \u2506 ---    \u2506 ---        \u2502\n\u2502 str    \u2506 str  \u2506 str    \u2506 i64        \u2502\n\u255e\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u256a\u2550\u2550\u2550\u2550\u2550\u2550\u256a\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u256a\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2561\n\u2502 /a     \u2506 a    \u2506 null   \u2506 90         \u2502\n\u2502 /a/b   \u2506 b    \u2506 a      \u2506 65         \u2502\n\u2502 /a/b/d \u2506 d    \u2506 b      \u2506 40         \u2502\n\u2502 /a/b/e \u2506 e    \u2506 b      \u2506 35         \u2502\n\u2502 /a/c   \u2506 c    \u2506 a      \u2506 60         \u2502\n\u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2518\n</code></pre> <p>For a subset of a tree.</p> <pre><code>&gt;&gt;&gt; tree_to_polars(b, name_col=\"name\", parent_col=\"parent\", path_col=\"path\", attr_dict={\"age\": \"person age\"})\nshape: (3, 4)\n\u250c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2510\n\u2502 path   \u2506 name \u2506 parent \u2506 person age \u2502\n\u2502 ---    \u2506 ---  \u2506 ---    \u2506 ---        \u2502\n\u2502 str    \u2506 str  \u2506 str    \u2506 i64        \u2502\n\u255e\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u256a\u2550\u2550\u2550\u2550\u2550\u2550\u256a\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u256a\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2561\n\u2502 /a/b   \u2506 b    \u2506 a      \u2506 65         \u2502\n\u2502 /a/b/d \u2506 d    \u2506 b      \u2506 40         \u2502\n\u2502 /a/b/e \u2506 e    \u2506 b      \u2506 35         \u2502\n\u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2518\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to be exported</p> required <code>path_col</code> <code>str</code> <p>column name for <code>node.path_name</code>, defaults to 'path'</p> <code>'path'</code> <code>name_col</code> <code>str</code> <p>column name for <code>node.node_name</code>, defaults to 'name'</p> <code>'name'</code> <code>parent_col</code> <code>str</code> <p>column name for <code>node.parent.node_name</code>, optional</p> <code>''</code> <code>attr_dict</code> <code>Dict[str, str]</code> <p>dictionary mapping node attributes to column name, key: node attributes, value: corresponding column in dataframe, optional</p> <code>{}</code> <code>all_attrs</code> <code>bool</code> <p>indicator whether to retrieve all <code>Node</code> attributes, overrides <code>attr_dict</code>, defaults to False</p> <code>False</code> <code>max_depth</code> <code>int</code> <p>maximum depth to export tree, optional</p> <code>0</code> <code>skip_depth</code> <code>int</code> <p>number of initial depths to skip, optional</p> <code>0</code> <code>leaf_only</code> <code>bool</code> <p>indicator to retrieve only information from leaf nodes</p> <code>False</code> <p>Returns:</p> Type Description <code>DataFrame</code> <p>(pl.DataFrame)</p>"},{"location":"bigtree/tree/export/#bigtree.tree.export.tree_to_dict","title":"tree_to_dict","text":"<pre><code>tree_to_dict(\n    tree,\n    name_key=\"name\",\n    parent_key=\"\",\n    attr_dict={},\n    all_attrs=False,\n    max_depth=0,\n    skip_depth=0,\n    leaf_only=False,\n)\n</code></pre> <p>Export tree to dictionary.</p> <p>All descendants from <code>tree</code> will be exported, <code>tree</code> can be the root node or child node of tree.</p> <p>Exported dictionary will have key as node path, and node attributes as a nested dictionary.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, tree_to_dict\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=b)\n&gt;&gt;&gt; e = Node(\"e\", age=35, parent=b)\n&gt;&gt;&gt; tree_to_dict(root, name_key=\"name\", parent_key=\"parent\", attr_dict={\"age\": \"person age\"})\n{'/a': {'name': 'a', 'parent': None, 'person age': 90}, '/a/b': {'name': 'b', 'parent': 'a', 'person age': 65}, '/a/b/d': {'name': 'd', 'parent': 'b', 'person age': 40}, '/a/b/e': {'name': 'e', 'parent': 'b', 'person age': 35}, '/a/c': {'name': 'c', 'parent': 'a', 'person age': 60}}\n</code></pre> <p>For a subset of a tree</p> <pre><code>&gt;&gt;&gt; tree_to_dict(c, name_key=\"name\", parent_key=\"parent\", attr_dict={\"age\": \"person age\"})\n{'/a/c': {'name': 'c', 'parent': 'a', 'person age': 60}}\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to be exported</p> required <code>name_key</code> <code>str</code> <p>dictionary key for <code>node.node_name</code>, defaults to 'name'</p> <code>'name'</code> <code>parent_key</code> <code>str</code> <p>dictionary key for <code>node.parent.node_name</code>, optional</p> <code>''</code> <code>attr_dict</code> <code>Dict[str, str]</code> <p>dictionary mapping node attributes to dictionary key, key: node attributes, value: corresponding dictionary key, optional</p> <code>{}</code> <code>all_attrs</code> <code>bool</code> <p>indicator whether to retrieve all <code>Node</code> attributes, overrides <code>attr_dict</code>, defaults to False</p> <code>False</code> <code>max_depth</code> <code>int</code> <p>maximum depth to export tree, optional</p> <code>0</code> <code>skip_depth</code> <code>int</code> <p>number of initial depths to skip, optional</p> <code>0</code> <code>leaf_only</code> <code>bool</code> <p>indicator to retrieve only information from leaf nodes</p> <code>False</code> <p>Returns:</p> Type Description <code>Dict[str, Any]</code> <p>(Dict[str, Any])</p>"},{"location":"bigtree/tree/export/#bigtree.tree.export.tree_to_nested_dict","title":"tree_to_nested_dict","text":"<pre><code>tree_to_nested_dict(\n    tree,\n    name_key=\"name\",\n    child_key=\"children\",\n    attr_dict={},\n    all_attrs=False,\n    max_depth=0,\n)\n</code></pre> <p>Export tree to nested dictionary.</p> <p>All descendants from <code>tree</code> will be exported, <code>tree</code> can be the root node or child node of tree.</p> <p>Exported dictionary will have key as node attribute names, and children as a nested recursive dictionary.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, tree_to_nested_dict\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=b)\n&gt;&gt;&gt; e = Node(\"e\", age=35, parent=b)\n&gt;&gt;&gt; tree_to_nested_dict(root, all_attrs=True)\n{'name': 'a', 'age': 90, 'children': [{'name': 'b', 'age': 65, 'children': [{'name': 'd', 'age': 40}, {'name': 'e', 'age': 35}]}, {'name': 'c', 'age': 60}]}\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to be exported</p> required <code>name_key</code> <code>str</code> <p>dictionary key for <code>node.node_name</code>, defaults to 'name'</p> <code>'name'</code> <code>child_key</code> <code>str</code> <p>dictionary key for list of children, optional</p> <code>'children'</code> <code>attr_dict</code> <code>Dict[str, str]</code> <p>dictionary mapping node attributes to dictionary key, key: node attributes, value: corresponding dictionary key, optional</p> <code>{}</code> <code>all_attrs</code> <code>bool</code> <p>indicator whether to retrieve all <code>Node</code> attributes, overrides <code>attr_dict</code>, defaults to False</p> <code>False</code> <code>max_depth</code> <code>int</code> <p>maximum depth to export tree, optional</p> <code>0</code> <p>Returns:</p> Type Description <code>Dict[str, Any]</code> <p>(Dict[str, Any])</p>"},{"location":"bigtree/tree/export/#bigtree.tree.export.tree_to_dot","title":"tree_to_dot","text":"<pre><code>tree_to_dot(\n    tree,\n    directed=True,\n    rankdir=\"TB\",\n    bg_colour=\"\",\n    node_colour=\"\",\n    node_shape=\"\",\n    edge_colour=\"\",\n    node_attr=\"\",\n    edge_attr=\"\",\n)\n</code></pre> <p>Export tree or list of trees to image. Possible node attributes include style, fillcolor, shape.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, tree_to_dot\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=b)\n&gt;&gt;&gt; e = Node(\"e\", age=35, parent=b)\n&gt;&gt;&gt; graph = tree_to_dot(root)\n</code></pre> <p>Display image directly without saving (requires IPython)</p> <pre><code>&gt;&gt;&gt; from IPython.display import Image, display\n&gt;&gt;&gt; plt = Image(graph.create_png())\n&gt;&gt;&gt; display(plt)\n&lt;IPython.core.display.Image object&gt;\n</code></pre> <p>Export to image, dot file, etc.</p> <pre><code>&gt;&gt;&gt; graph.write_png(\"assets/docstr/tree.png\")\n&gt;&gt;&gt; graph.write_dot(\"assets/docstr/tree.dot\")\n</code></pre> <p>Export to string</p> <pre><code>&gt;&gt;&gt; graph.to_string()\n'strict digraph G {\\nrankdir=TB;\\na0 [label=a];\\nb0 [label=b];\\na0 -&gt; b0;\\nd0 [label=d];\\nb0 -&gt; d0;\\ne0 [label=e];\\nb0 -&gt; e0;\\nc0 [label=c];\\na0 -&gt; c0;\\n}\\n'\n</code></pre> <p>Defining node and edge attributes (using node attribute)</p> <pre><code>&gt;&gt;&gt; class CustomNode(Node):\n...     def __init__(self, name, node_shape=\"\", edge_label=\"\", **kwargs):\n...         super().__init__(name, **kwargs)\n...         self.node_shape = node_shape\n...         self.edge_label = edge_label\n...\n...     @property\n...     def edge_attr(self):\n...         if self.edge_label:\n...             return {\"label\": self.edge_label}\n...         return {}\n...\n...     @property\n...     def node_attr(self):\n...         if self.node_shape:\n...             return {\"shape\": self.node_shape}\n...         return {}\n&gt;&gt;&gt;\n&gt;&gt;&gt;\n&gt;&gt;&gt; root = CustomNode(\"a\", node_shape=\"circle\")\n&gt;&gt;&gt; b = CustomNode(\"b\", edge_label=\"child\", parent=root)\n&gt;&gt;&gt; c = CustomNode(\"c\", edge_label=\"child\", parent=root)\n&gt;&gt;&gt; d = CustomNode(\"d\", node_shape=\"square\", edge_label=\"child\", parent=b)\n&gt;&gt;&gt; e = CustomNode(\"e\", node_shape=\"square\", edge_label=\"child\", parent=b)\n&gt;&gt;&gt; graph = tree_to_dot(root, node_colour=\"gold\", node_shape=\"diamond\", node_attr=\"node_attr\", edge_attr=\"edge_attr\")\n&gt;&gt;&gt; graph.write_png(\"assets/export_tree_dot.png\")\n</code></pre> <p></p> <p>Alternative way to define node and edge attributes (using callable function)</p> <pre><code>&gt;&gt;&gt; def get_node_attribute(node: Node):\n...     if node.is_leaf:\n...         return {\"shape\": \"square\"}\n...     return {\"shape\": \"circle\"}\n&gt;&gt;&gt;\n&gt;&gt;&gt;\n&gt;&gt;&gt; root = CustomNode(\"a\")\n&gt;&gt;&gt; b = CustomNode(\"b\", parent=root)\n&gt;&gt;&gt; c = CustomNode(\"c\", parent=root)\n&gt;&gt;&gt; d = CustomNode(\"d\", parent=b)\n&gt;&gt;&gt; e = CustomNode(\"e\", parent=b)\n&gt;&gt;&gt; graph = tree_to_dot(root, node_colour=\"gold\", node_attr=get_node_attribute)\n&gt;&gt;&gt; graph.write_png(\"assets/export_tree_dot_callable.png\")\n</code></pre> <p></p> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node / List[Node]</code> <p>tree or list of trees to be exported</p> required <code>directed</code> <code>bool</code> <p>indicator whether graph should be directed or undirected, defaults to True</p> <code>True</code> <code>rankdir</code> <code>str</code> <p>layout direction, defaults to 'TB' (top to bottom), can be 'BT' (bottom to top), 'LR' (left to right), 'RL' (right to left)</p> <code>'TB'</code> <code>bg_colour</code> <code>str</code> <p>background color of image, defaults to None</p> <code>''</code> <code>node_colour</code> <code>str</code> <p>fill colour of nodes, defaults to None</p> <code>''</code> <code>node_shape</code> <code>str</code> <p>shape of nodes, defaults to None Possible node_shape include \"circle\", \"square\", \"diamond\", \"triangle\"</p> <code>''</code> <code>edge_colour</code> <code>str</code> <p>colour of edges, defaults to None</p> <code>''</code> <code>node_attr</code> <code>str | Callable</code> <p>If string type, it refers to <code>Node</code> attribute for node style. If callable type, it takes in the node itself and returns the node style. This overrides <code>node_colour</code> and <code>node_shape</code> and defaults to None. Possible node styles include {\"style\": \"filled\", \"fillcolor\": \"gold\", \"shape\": \"diamond\"}</p> <code>''</code> <code>edge_attr</code> <code>str | Callable</code> <p>If stirng type, it refers to <code>Node</code> attribute for edge style. If callable type, it takes in the node itself and returns the edge style. This overrides <code>edge_colour</code>, and defaults to None. Possible edge styles include {\"style\": \"bold\", \"label\": \"edge label\", \"color\": \"black\"}</p> <code>''</code> <p>Returns:</p> Type Description <code>Dot</code> <p>(pydot.Dot)</p>"},{"location":"bigtree/tree/export/#bigtree.tree.export.tree_to_pillow","title":"tree_to_pillow","text":"<pre><code>tree_to_pillow(\n    tree,\n    width=0,\n    height=0,\n    start_pos=(10, 10),\n    font_family=\"\",\n    font_size=12,\n    font_colour=\"black\",\n    bg_colour=\"white\",\n    **kwargs\n)\n</code></pre> <p>Export tree to image (JPG, PNG). Image will be similar format as <code>print_tree</code>, accepts additional keyword arguments as input to <code>yield_tree</code>.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, tree_to_pillow\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=b)\n&gt;&gt;&gt; e = Node(\"e\", age=35, parent=b)\n&gt;&gt;&gt; pillow_image = tree_to_pillow(root)\n</code></pre> <p>Export to image (PNG, JPG) file, etc.</p> <pre><code>&gt;&gt;&gt; pillow_image.save(\"assets/docstr/tree_pillow.png\")\n&gt;&gt;&gt; pillow_image.save(\"assets/docstr/tree_pillow.jpg\")\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to be exported</p> required <code>width</code> <code>int</code> <p>width of image, optional as width of image is calculated automatically</p> <code>0</code> <code>height</code> <code>int</code> <p>height of image, optional as height of image is calculated automatically</p> <code>0</code> <code>start_pos</code> <code>Tuple[int, int]</code> <p>start position of text, (x-offset, y-offset), defaults to (10, 10)</p> <code>(10, 10)</code> <code>font_family</code> <code>str</code> <p>file path of font family, requires .ttf file, defaults to DejaVuSans</p> <code>''</code> <code>font_size</code> <code>int</code> <p>font size, defaults to 12</p> <code>12</code> <code>font_colour</code> <code>Union[Tuple[int, int, int], str]</code> <p>font colour, accepts tuple of RGB values or string, defaults to black</p> <code>'black'</code> <code>bg_colour</code> <code>Union[Tuple[int, int, int], str]</code> <p>background of image, accepts tuple of RGB values or string, defaults to white</p> <code>'white'</code> <p>Returns:</p> Type Description <code>Image</code> <p>(PIL.Image.Image)</p>"},{"location":"bigtree/tree/export/#bigtree.tree.export.tree_to_mermaid","title":"tree_to_mermaid","text":"<pre><code>tree_to_mermaid(\n    tree,\n    title=\"\",\n    rankdir=\"TB\",\n    line_shape=\"basis\",\n    node_colour=\"\",\n    node_border_colour=\"\",\n    node_border_width=1,\n    node_shape=\"rounded_edge\",\n    node_shape_attr=\"\",\n    edge_arrow=\"normal\",\n    edge_arrow_attr=\"\",\n    edge_label=\"\",\n    node_attr=\"\",\n    **kwargs\n)\n</code></pre> <p>Export tree to mermaid Markdown text. Accepts additional keyword arguments as input to <code>yield_tree</code>.</p> Parameters for customizations that applies to entire flowchart include <ul> <li>Title, <code>title</code></li> <li>Layout direction, <code>rankdir</code></li> <li>Line shape or curvature, <code>line_shape</code></li> <li>Fill colour of nodes, <code>node_colour</code></li> <li>Border colour of nodes, <code>node_border_colour</code></li> <li>Border width of nodes, <code>node_border_width</code></li> <li>Node shape, <code>node_shape</code></li> <li>Edge arrow style, <code>edge_arrow</code></li> </ul> Parameters for customizations that apply to customized nodes <ul> <li>Fill colour of nodes, fill under <code>node_attr</code></li> <li>Border colour of nodes, stroke under <code>node_attr</code></li> <li>Border width of nodes, stroke-width under <code>node_attr</code></li> <li>Node shape, <code>node_shape_attr</code></li> <li>Edge arrow style, <code>edge_arrow_attr</code></li> <li>Edge label, <code>edge_label</code></li> </ul> <p>Accepted Parameter Values</p> Possible rankdir <ul> <li><code>TB</code>: top-to-bottom</li> <li><code>BT</code>: bottom-to-top</li> <li><code>LR</code>: left-to-right</li> <li><code>RL</code>: right-to-left</li> </ul> Possible line_shape <ul> <li><code>basis</code></li> <li><code>bumpX</code>: used in LR or RL direction</li> <li><code>bumpY</code></li> <li><code>cardinal</code>: undirected</li> <li><code>catmullRom</code>: undirected</li> <li><code>linear</code>:</li> <li><code>monotoneX</code>: used in LR or RL direction</li> <li><code>monotoneY</code></li> <li><code>natural</code></li> <li><code>step</code>: used in LR or RL direction</li> <li><code>stepAfter</code></li> <li><code>stepBefore</code>: used in LR or RL direction</li> </ul> Possible node_shape <ul> <li><code>rounded_edge</code>: rectangular with rounded edges</li> <li><code>stadium</code>: (_) shape, rectangular with rounded ends</li> <li><code>subroutine</code>: ||_|| shape, rectangular with additional line at the ends</li> <li><code>cylindrical</code>: database node</li> <li><code>circle</code>: circular</li> <li><code>asymmetric</code>: &gt;_| shape</li> <li><code>rhombus</code>: decision node</li> <li><code>hexagon</code>: &lt;_&gt; shape</li> <li><code>parallelogram</code>: /_/ shape</li> <li><code>parallelogram_alt</code>: \\_\\ shape, inverted parallelogram</li> <li><code>trapezoid</code>: /_\\ shape</li> <li><code>trapezoid_alt</code>: \\_/ shape, inverted trapezoid</li> <li><code>double_circle</code></li> </ul> Possible edge_arrow <ul> <li><code>normal</code>: directed arrow, shaded arrowhead</li> <li><code>bold</code>: bold directed arrow</li> <li><code>dotted</code>: dotted directed arrow</li> <li><code>open</code>: line, undirected arrow</li> <li><code>bold_open</code>: bold line</li> <li><code>dotted_open</code>: dotted line</li> <li><code>invisible</code>: no line</li> <li><code>circle</code>: directed arrow with filled circle arrowhead</li> <li><code>cross</code>: directed arrow with cross arrowhead</li> <li><code>double_normal</code>: bidirectional directed arrow</li> <li><code>double_circle</code>: bidirectional directed arrow with filled circle arrowhead</li> <li><code>double_cross</code>: bidirectional directed arrow with cross arrowhead</li> </ul> <p>Refer to mermaid documentation for more information. Paste the output into any markdown file renderer to view the flowchart, alternatively visit the mermaid playground here.</p> <p>Note</p> <p>Advanced mermaid flowchart functionalities such as subgraphs and interactions (script, click) are not supported.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import tree_to_mermaid\n&gt;&gt;&gt; root = Node(\"a\", node_shape=\"rhombus\")\n&gt;&gt;&gt; b = Node(\"b\", edge_arrow=\"bold\", edge_label=\"Child 1\", parent=root)\n&gt;&gt;&gt; c = Node(\"c\", edge_arrow=\"dotted\", edge_label=\"Child 2\", parent=root)\n&gt;&gt;&gt; d = Node(\"d\", node_style=\"fill:yellow, stroke:black\", parent=b)\n&gt;&gt;&gt; e = Node(\"e\", parent=b)\n&gt;&gt;&gt; graph = tree_to_mermaid(root)\n&gt;&gt;&gt; print(graph)\n```mermaid\n%%{ init: { 'flowchart': { 'curve': 'basis' } } }%%\nflowchart TB\n0(\"a\") --&gt; 0-0(\"b\")\n0-0 --&gt; 0-0-0(\"d\")\n0-0 --&gt; 0-0-1(\"e\")\n0(\"a\") --&gt; 0-1(\"c\")\nclassDef default stroke-width:1\n```\n</code></pre> <p>Customize node shape, edge label, edge arrow, and custom node attributes</p> <pre><code>&gt;&gt;&gt; graph = tree_to_mermaid(root, node_shape_attr=\"node_shape\", edge_label=\"edge_label\", edge_arrow_attr=\"edge_arrow\", node_attr=\"node_style\")\n&gt;&gt;&gt; print(graph)\n```mermaid\n%%{ init: { 'flowchart': { 'curve': 'basis' } } }%%\nflowchart TB\n0{\"a\"} ==&gt;|Child 1| 0-0(\"b\")\n0-0:::class0-0-0 --&gt; 0-0-0(\"d\")\n0-0 --&gt; 0-0-1(\"e\")\n0{\"a\"} -.-&gt;|Child 2| 0-1(\"c\")\nclassDef default stroke-width:1\nclassDef class0-0-0 fill:yellow, stroke:black\n```\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to be exported</p> required <code>title</code> <code>str</code> <p>title, defaults to None</p> <code>''</code> <code>rankdir</code> <code>str</code> <p>layout direction, defaults to 'TB' (top to bottom), can be 'BT' (bottom to top), 'LR' (left to right), 'RL' (right to left)</p> <code>'TB'</code> <code>line_shape</code> <code>str</code> <p>line shape or curvature, defaults to 'basis'</p> <code>'basis'</code> <code>node_colour</code> <code>str</code> <p>fill colour of nodes, can be colour name or hexcode, defaults to None</p> <code>''</code> <code>node_border_colour</code> <code>str</code> <p>border colour of nodes, can be colour name or hexcode, defaults to None</p> <code>''</code> <code>node_border_width</code> <code>float</code> <p>width of node border, defaults to 1</p> <code>1</code> <code>node_shape</code> <code>str</code> <p>node shape, sets the shape of every node, defaults to 'rounded_edge'</p> <code>'rounded_edge'</code> <code>node_shape_attr</code> <code>str | Callable</code> <p>If string type, it refers to <code>Node</code> attribute for node shape. If callable type, it takes in the node itself and returns the node shape. This sets the shape of custom nodes, and overrides default <code>node_shape</code>, defaults to None</p> <code>''</code> <code>edge_arrow</code> <code>str</code> <p>edge arrow style from parent to itself, sets the arrow style of every edge, defaults to 'normal'</p> <code>'normal'</code> <code>edge_arrow_attr</code> <code>str | Callable</code> <p>If string type, it refers to <code>Node</code> attribute for edge arrow style. If callable type, it takes in the node itself and returns the edge arrow style. This sets the edge arrow style of custom nodes from parent to itself, and overrides default <code>edge_arrow</code>, defaults to None</p> <code>''</code> <code>edge_label</code> <code>str</code> <p><code>Node</code> attribute for edge label from parent to itself, defaults to None</p> <code>''</code> <code>node_attr</code> <code>str | Callable</code> <p>If string type, it refers to <code>Node</code> attribute for node style. If callable type, it takes in the node itself and returns the node style. This overrides <code>node_colour</code>, <code>node_border_colour</code>, and <code>node_border_width</code>, defaults to None</p> <code>''</code> <p>Returns:</p> Type Description <code>str</code> <p>(str)</p>"},{"location":"bigtree/tree/export/#bigtree.tree.export.tree_to_newick","title":"tree_to_newick","text":"<pre><code>tree_to_newick(\n    tree,\n    intermediate_node_name=True,\n    length_attr=\"\",\n    length_sep=NewickCharacter.SEP,\n    attr_list=[],\n    attr_prefix=\"&amp;&amp;NHX:\",\n    attr_sep=NewickCharacter.SEP,\n)\n</code></pre> <p>Export tree to Newick notation. Useful for describing phylogenetic tree.</p> <p>In the Newick Notation (or New Hampshire Notation),   - Tree is represented in round brackets i.e., <code>(child1,child2,child3)parent</code>.   - If there are nested tree, they will be in nested round brackets i.e., <code>((grandchild1)child1,(grandchild2,grandchild3)child2)parent</code>.   - If there is length attribute, they will be beside the name i.e., <code>(child1:0.5,child2:0.1)parent</code>.   - If there are other attributes, attributes are represented in square brackets i.e., <code>(child1:0.5[S:human],child2:0.1[S:human])parent[S:parent]</code>.</p> Customizations include <ul> <li>Omitting names of root and intermediate nodes, default all node names are shown.</li> <li>Changing length separator to other symbol, default is <code>:</code>.</li> <li>Adding an attribute prefix, default is <code>&amp;&amp;NHX:</code>.</li> <li>Changing the attribute separator to other symbol, default is <code>:</code>.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, tree_to_newick\n&gt;&gt;&gt; root = Node(\"a\", species=\"human\")\n&gt;&gt;&gt; b = Node(\"b\", age=65, species=\"human\", parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, species=\"human\", parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, species=\"human\", parent=b)\n&gt;&gt;&gt; e = Node(\"e\", age=35, species=\"human\", parent=b)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2514\u2500\u2500 c\n</code></pre> <pre><code>&gt;&gt;&gt; tree_to_newick(root)\n'((d,e)b,c)a'\n</code></pre> <pre><code>&gt;&gt;&gt; tree_to_newick(root, length_attr=\"age\")\n'((d:40,e:35)b:65,c:60)a'\n</code></pre> <pre><code>&gt;&gt;&gt; tree_to_newick(root, length_attr=\"age\", attr_list=[\"species\"])\n'((d:40[&amp;&amp;NHX:species=human],e:35[&amp;&amp;NHX:species=human])b:65[&amp;&amp;NHX:species=human],c:60[&amp;&amp;NHX:species=human])a[&amp;&amp;NHX:species=human]'\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to be exported</p> required <code>intermediate_node_name</code> <code>bool</code> <p>indicator if intermediate nodes have node names, defaults to True</p> <code>True</code> <code>length_attr</code> <code>str</code> <p>node length attribute to extract to beside name, optional</p> <code>''</code> <code>length_sep</code> <code>str</code> <p>separator between node name and length, used if length_attr is non-empty, defaults to \":\"</p> <code>SEP</code> <code>attr_list</code> <code>Iterable[str]</code> <p>list of node attributes to extract into square bracket, optional</p> <code>[]</code> <code>attr_prefix</code> <code>str</code> <p>prefix before all attributes, within square bracket, used if attr_list is non-empty, defaults to \"&amp;&amp;NHX:\"</p> <code>'&amp;&amp;NHX:'</code> <code>attr_sep</code> <code>str</code> <p>separator between attributes, within square brackets, used if attr_list is non-empty, defaults to \":\"</p> <code>SEP</code> <p>Returns:</p> Type Description <code>str</code> <p>(str)</p>"},{"location":"bigtree/tree/helper/","title":"\ud83d\udd27 Helper","text":"<p>Helper functions that can come in handy.</p>"},{"location":"bigtree/tree/helper/#bigtree.tree.helper","title":"bigtree.tree.helper","text":""},{"location":"bigtree/tree/helper/#bigtree.tree.helper.clone_tree","title":"clone_tree","text":"<pre><code>clone_tree(tree, node_type)\n</code></pre> <p>Clone tree to another <code>Node</code> type. If the same type is needed, simply do a tree.copy().</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import BaseNode, Node, clone_tree\n&gt;&gt;&gt; root = BaseNode(name=\"a\")\n&gt;&gt;&gt; b = BaseNode(name=\"b\", parent=root)\n&gt;&gt;&gt; clone_tree(root, Node)\nNode(/a, )\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode</code> <p>tree to be cloned, must inherit from BaseNode</p> required <code>node_type</code> <code>Type[BaseNode]</code> <p>type of cloned tree</p> required <p>Returns:</p> Type Description <code>BaseNodeT</code> <p>(BaseNode)</p>"},{"location":"bigtree/tree/helper/#bigtree.tree.helper.get_subtree","title":"get_subtree","text":"<pre><code>get_subtree(tree, node_name_or_path='', max_depth=0)\n</code></pre> <p>Get subtree based on node name or node path, and/or maximum depth of tree.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, get_subtree\n&gt;&gt;&gt; root = Node(\"a\")\n&gt;&gt;&gt; b = Node(\"b\", parent=root)\n&gt;&gt;&gt; c = Node(\"c\", parent=b)\n&gt;&gt;&gt; d = Node(\"d\", parent=b)\n&gt;&gt;&gt; e = Node(\"e\", parent=root)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 c\n\u2502   \u2514\u2500\u2500 d\n\u2514\u2500\u2500 e\n</code></pre> <p>Get subtree</p> <pre><code>&gt;&gt;&gt; root_subtree = get_subtree(root, \"b\")\n&gt;&gt;&gt; root_subtree.show()\nb\n\u251c\u2500\u2500 c\n\u2514\u2500\u2500 d\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>existing tree</p> required <code>node_name_or_path</code> <code>str</code> <p>node name or path to get subtree, defaults to None</p> <code>''</code> <code>max_depth</code> <code>int</code> <p>maximum depth of subtree, based on <code>depth</code> attribute, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>NodeT</code> <p>(Node)</p>"},{"location":"bigtree/tree/helper/#bigtree.tree.helper.prune_tree","title":"prune_tree","text":"<pre><code>prune_tree(\n    tree, prune_path=\"\", exact=False, sep=\"/\", max_depth=0\n)\n</code></pre> <p>Prune tree by path or depth, returns the root of a copy of the original tree.</p> <p>For pruning by <code>prune_path</code>,</p> <ul> <li>All siblings along the prune path will be removed.</li> <li>If <code>exact=True</code>, all descendants of prune path will be removed.</li> <li>Prune path can be string (only one path) or a list of strings (multiple paths).</li> <li>Prune path name should be unique, can be full path, partial path (trailing part of path), or node name.</li> </ul> <p>For pruning by <code>max_depth</code>,</p> <ul> <li>All nodes that are beyond <code>max_depth</code> will be removed.</li> </ul> <p>Path should contain <code>Node</code> name, separated by <code>sep</code>.</p> <ul> <li>For example: Path string \"a/b\" refers to Node(\"b\") with parent Node(\"a\").</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, prune_tree\n&gt;&gt;&gt; root = Node(\"a\")\n&gt;&gt;&gt; b = Node(\"b\", parent=root)\n&gt;&gt;&gt; c = Node(\"c\", parent=b)\n&gt;&gt;&gt; d = Node(\"d\", parent=b)\n&gt;&gt;&gt; e = Node(\"e\", parent=root)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 c\n\u2502   \u2514\u2500\u2500 d\n\u2514\u2500\u2500 e\n</code></pre> <p>Prune (default is keep descendants)</p> <pre><code>&gt;&gt;&gt; root_pruned = prune_tree(root, \"a/b\")\n&gt;&gt;&gt; root_pruned.show()\na\n\u2514\u2500\u2500 b\n    \u251c\u2500\u2500 c\n    \u2514\u2500\u2500 d\n</code></pre> <p>Prune exact path</p> <pre><code>&gt;&gt;&gt; root_pruned = prune_tree(root, \"a/b\", exact=True)\n&gt;&gt;&gt; root_pruned.show()\na\n\u2514\u2500\u2500 b\n</code></pre> <p>Prune multiple paths</p> <pre><code>&gt;&gt;&gt; root_pruned = prune_tree(root, [\"a/b/d\", \"a/e\"])\n&gt;&gt;&gt; root_pruned.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u2514\u2500\u2500 d\n\u2514\u2500\u2500 e\n</code></pre> <p>Prune by depth</p> <pre><code>&gt;&gt;&gt; root_pruned = prune_tree(root, max_depth=2)\n&gt;&gt;&gt; root_pruned.show()\na\n\u251c\u2500\u2500 b\n\u2514\u2500\u2500 e\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Union[BinaryNode, Node]</code> <p>existing tree</p> required <code>prune_path</code> <code>List[str] | str</code> <p>prune path(s), all siblings along the prune path(s) will be removed</p> <code>''</code> <code>exact</code> <code>bool</code> <p>prune path(s) to be exactly the path, defaults to False (descendants of the path are retained)</p> <code>False</code> <code>sep</code> <code>str</code> <p>path separator of <code>prune_path</code></p> <code>'/'</code> <code>max_depth</code> <code>int</code> <p>maximum depth of pruned tree, based on <code>depth</code> attribute, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>Union[BinaryNodeT, NodeT]</code> <p>(Union[BinaryNode, Node])</p>"},{"location":"bigtree/tree/helper/#bigtree.tree.helper.get_tree_diff","title":"get_tree_diff","text":"<pre><code>get_tree_diff(\n    tree, other_tree, only_diff=True, attr_list=[]\n)\n</code></pre> <p>Get difference of <code>tree</code> to <code>other_tree</code>, changes are relative to <code>tree</code>.</p> <p>Compares the difference in tree structure (default), but can also compare tree attributes using <code>attr_list</code>. Function can return only the differences (default), or all original tree nodes and differences.</p> <p>Comparing tree structure:</p> <ul> <li>(+) and (-) will be added to node name relative to <code>tree</code>.</li> <li>For example: (+) refers to nodes that are in <code>other_tree</code> but not <code>tree</code>.</li> <li>For example: (-) refers to nodes that are in <code>tree</code> but not <code>other_tree</code>.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; # Create original tree\n&gt;&gt;&gt; from bigtree import Node, get_tree_diff, list_to_tree\n&gt;&gt;&gt; root = list_to_tree([\"Downloads/Pictures/photo1.jpg\", \"Downloads/file1.doc\", \"Downloads/photo2.jpg\"])\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u251c\u2500\u2500 file1.doc\n\u2514\u2500\u2500 photo2.jpg\n</code></pre> <pre><code>&gt;&gt;&gt; # Create other tree\n&gt;&gt;&gt; root_other = list_to_tree([\"Downloads/Pictures/photo1.jpg\", \"Downloads/Pictures/photo2.jpg\", \"Downloads/file1.doc\"])\n&gt;&gt;&gt; root_other.show()\nDownloads\n\u251c\u2500\u2500 Pictures\n\u2502   \u251c\u2500\u2500 photo1.jpg\n\u2502   \u2514\u2500\u2500 photo2.jpg\n\u2514\u2500\u2500 file1.doc\n</code></pre> <pre><code>&gt;&gt;&gt; # Get tree differences\n&gt;&gt;&gt; tree_diff = get_tree_diff(root, root_other)\n&gt;&gt;&gt; tree_diff.show()\nDownloads\n\u251c\u2500\u2500 photo2.jpg (-)\n\u2514\u2500\u2500 Pictures\n    \u2514\u2500\u2500 photo2.jpg (+)\n</code></pre> <pre><code>&gt;&gt;&gt; tree_diff = get_tree_diff(root, root_other, only_diff=False)\n&gt;&gt;&gt; tree_diff.show()\nDownloads\n\u251c\u2500\u2500 Pictures\n\u2502   \u251c\u2500\u2500 photo1.jpg\n\u2502   \u2514\u2500\u2500 photo2.jpg (+)\n\u251c\u2500\u2500 file1.doc\n\u2514\u2500\u2500 photo2.jpg (-)\n</code></pre> <p>Comparing tree attributes</p> <ul> <li>(~) will be added to node name if there are differences in tree attributes defined in <code>attr_list</code>.</li> <li>The node's attributes will be a list of [value in <code>tree</code>, value in <code>other_tree</code>]</li> </ul> <pre><code>&gt;&gt;&gt; # Create original tree\n&gt;&gt;&gt; root = Node(\"Downloads\")\n&gt;&gt;&gt; picture_folder = Node(\"Pictures\", parent=root)\n&gt;&gt;&gt; photo2 = Node(\"photo1.jpg\", tags=\"photo1\", parent=picture_folder)\n&gt;&gt;&gt; file1 = Node(\"file1.doc\", tags=\"file1\", parent=root)\n&gt;&gt;&gt; root.show(attr_list=[\"tags\"])\nDownloads\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg [tags=photo1]\n\u2514\u2500\u2500 file1.doc [tags=file1]\n</code></pre> <pre><code>&gt;&gt;&gt; # Create other tree\n&gt;&gt;&gt; root_other = Node(\"Downloads\")\n&gt;&gt;&gt; picture_folder = Node(\"Pictures\", parent=root_other)\n&gt;&gt;&gt; photo1 = Node(\"photo1.jpg\", tags=\"photo1-edited\", parent=picture_folder)\n&gt;&gt;&gt; photo2 = Node(\"photo2.jpg\", tags=\"photo2-new\", parent=picture_folder)\n&gt;&gt;&gt; file1 = Node(\"file1.doc\", tags=\"file1\", parent=root_other)\n&gt;&gt;&gt; root_other.show(attr_list=[\"tags\"])\nDownloads\n\u251c\u2500\u2500 Pictures\n\u2502   \u251c\u2500\u2500 photo1.jpg [tags=photo1-edited]\n\u2502   \u2514\u2500\u2500 photo2.jpg [tags=photo2-new]\n\u2514\u2500\u2500 file1.doc [tags=file1]\n</code></pre> <pre><code>&gt;&gt;&gt; # Get tree differences\n&gt;&gt;&gt; tree_diff = get_tree_diff(root, root_other, attr_list=[\"tags\"])\n&gt;&gt;&gt; tree_diff.show(attr_list=[\"tags\"])\nDownloads\n\u2514\u2500\u2500 Pictures\n    \u251c\u2500\u2500 photo1.jpg (~) [tags=('photo1', 'photo1-edited')]\n    \u2514\u2500\u2500 photo2.jpg (+)\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to be compared against</p> required <code>other_tree</code> <code>Node</code> <p>tree to be compared with</p> required <code>only_diff</code> <code>bool</code> <p>indicator to show all nodes or only nodes that are different (+/-), defaults to True</p> <code>True</code> <code>attr_list</code> <code>List[str]</code> <p>tree attributes to check for difference, defaults to empty list</p> <code>[]</code> <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/tree/modify/","title":"\ud83d\udcdd Modify","text":"<p>There are two types of modification available</p> <ol> <li>Non-replacing scenario: Shift or copy nodes within same tree or between two trees using <code>from_paths</code> (list of paths) and <code>to_paths</code> (list of paths).</li> <li>Replacing scenario: Shift or copy nodes within same tree or between two trees while replacing the to-node using <code>from_paths</code> (list of paths) and <code>to_paths</code> (list of paths).</li> </ol>"},{"location":"bigtree/tree/modify/#available-configurations-for-customization","title":"Available Configurations for Customization","text":"<p>In non-replacing scenario, there are several configurations available for customization.</p> Configuration Description Default Value <code>copy</code> Indicates whether it is to shift the nodes, or copy the nodes False (nodes are shifted, not copied) <code>to_tree</code> Indicates whether shifting/copying is within the same tree, or between different trees None (nodes are shifted/copied within the same tree) <code>skippable</code> Skip shifting/copying of nodes if from_path cannot be found False (from-node must be found) <code>overriding</code> Override existing node if it exists False (to-node must not exist) <code>merge_children</code> Shift/copy children of from-node and remove intermediate parent node False (children are not merged) <code>merge_leaves</code> Shift/copy leaves of from-node and remove all intermediate nodes False (leaves are not merged) <code>delete_children</code> Shift/copy node only and delete its children False (nodes are shifted/copied together with children) <p>In replacing scenario, all the configurations are also available except <code>overriding</code>, <code>merge_children</code>, and <code>merge_leaves</code> as it is doing a one-to-one replacement. It is by default overriding, and there is nothing to merge.</p> <p>Note</p> <p><code>merge_children</code> and <code>merge_leaves</code> cannot be simultaneously set to <code>True</code>.</p> <p>Note</p> <p>Error will always be thrown if multiple from-nodes are found, paths in <code>from_paths</code> must be unique.</p>"},{"location":"bigtree/tree/modify/#tree-modification-permutations","title":"Tree Modification Permutations","text":"<p>There are several ways you can mix and match the tree modification methods. If you know all the parameters to choose, feel free to use <code>copy_or_shift_logic</code> or <code>replace_logic</code> methods as they are the most customizable. All other methods calls these 2 methods directly.</p> Shift / Copy? Same tree / Between two trees? Replace destination node? Method to use Shift Same tree No <code>shift_nodes</code> Copy Same tree No <code>copy_nodes</code> Copy Between two trees No <code>copy_nodes_from_tree_to_tree</code> Any Any No <code>copy_or_shift_logic</code> Shift Same tree Yes <code>shift_and_replace_nodes</code> Copy Between two trees Yes <code>copy_and_replace_nodes_from_tree_to_tree</code> Any Any Yes <code>replace_logic</code>"},{"location":"bigtree/tree/modify/#tree-modification-illustration","title":"Tree Modification Illustration","text":""},{"location":"bigtree/tree/modify/#sample-tree-modification-shift-copy-delete","title":"Sample Tree Modification (Shift, Copy, Delete)","text":"Setting Sample path in <code>from_paths</code> Sample path in <code>to_paths</code> Description Default \"/a/c\" \"/a/b/c\" Shift/copy node <code>c</code> Default \"/c\" \"/a/b/c\" Shift/copy node <code>c</code> Default \"c\" \"/a/b/c\" Shift/copy node <code>c</code> Default \"/a/e\" None Delete node <code>e</code> skippable \"/a/c\" \"/a/b/c\" Shift/copy node <code>c</code>, skip if \"/a/c\" cannot be found"},{"location":"bigtree/tree/modify/#sample-tree-modification-advanced","title":"Sample Tree Modification (Advanced)","text":"Setting Sample path in <code>from_paths</code> Sample path in <code>to_paths</code> Description overriding \"a/b/c\" \"a/d/c\" Shift/copy node <code>c</code>, override if \"a/d/c\" exists merge_children \"a/b/c\" \"a/d/c\" If path not present: Shift/copy children of node <code>c</code> to be children of node <code>d</code>, removing node <code>c</code>If path present: Shift/copy children of node <code>c</code> to be merged with existing \"a/d/c\" children merge_children + overriding \"a/b/c\" \"a/d/c\" If path not present: Behaves like merge_childrenIf path present: Behaves like overriding merge_leaves \"a/b/c\" \"a/d/c\" If path not present: Shift/copy leaves of node <code>c</code> to be children of node <code>d</code>If path present: Shift/copy leaves of node <code>c</code> to be merged with existing \"a/d/c\" children - merge_leaves + overriding \"a/b/c\" \"a/d/c\" If path not present: Behaves like merge_leavesIf path present: Behaves like overriding, but original node <code>c</code> remains delete_children \"a/b\" \"a/d/b\" Shift/copy node <code>b</code> only without any node <code>b</code> children"},{"location":"bigtree/tree/modify/#bigtree.tree.modify","title":"bigtree.tree.modify","text":""},{"location":"bigtree/tree/modify/#bigtree.tree.modify.shift_nodes","title":"shift_nodes","text":"<pre><code>shift_nodes(\n    tree,\n    from_paths,\n    to_paths,\n    sep=\"/\",\n    skippable=False,\n    overriding=False,\n    merge_children=False,\n    merge_leaves=False,\n    delete_children=False,\n    with_full_path=False,\n)\n</code></pre> <p>Shift nodes from <code>from_paths</code> to <code>to_paths</code> in-place.</p> <ul> <li>Creates intermediate nodes if to path is not present</li> <li>Able to skip nodes if from path is not found, defaults to False (from-nodes must be found; not skippable).</li> <li>Able to override existing node if it exists, defaults to False (to-nodes must not exist; not overridden).</li> <li>Able to merge children and remove intermediate parent node, defaults to False (nodes are shifted; not merged).</li> <li>Able to merge only leaf nodes and remove all intermediate nodes, defaults to False (nodes are shifted; not merged)</li> <li>Able to shift node only and delete children, defaults to False (nodes are shifted together with children).</li> </ul> <p>For paths in <code>from_paths</code> and <code>to_paths</code>,</p> <ul> <li>Path name can be with or without leading tree path separator symbol.</li> </ul> <p>For paths in <code>from_paths</code>,</p> <ul> <li>Path name can be partial path (trailing part of path) or node name.</li> <li>If <code>with_full_path=True</code>, path name must be full path.</li> <li>Path name must be unique to one node.</li> </ul> <p>For paths in <code>to_paths</code>,</p> <ul> <li>Path name must be full path.</li> <li>Can set to empty string or None to delete the path in <code>from_paths</code>, note that <code>copy</code> must be set to False.</li> </ul> <p>If <code>merge_children=True</code>,</p> <ul> <li>If <code>to_path</code> is not present, it shifts children of <code>from_path</code>.</li> <li>If <code>to_path</code> is present, and <code>overriding=False</code>, original and new children are merged.</li> <li>If <code>to_path</code> is present and <code>overriding=True</code>, it behaves like overriding and only new children are retained.</li> </ul> <p>If <code>merge_leaves=True</code>,</p> <ul> <li>If <code>to_path</code> is not present, it shifts leaves of <code>from_path</code>.</li> <li>If <code>to_path</code> is present, and <code>overriding=False</code>, original children and leaves are merged.</li> <li>If <code>to_path</code> is present and <code>overriding=True</code>, it behaves like overriding and only new leaves are retained,     original non-leaf nodes in <code>from_path</code> are retained.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import list_to_tree, str_to_tree, shift_nodes\n&gt;&gt;&gt; root = list_to_tree([\"Downloads/photo1.jpg\", \"Downloads/file1.doc\"])\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 file1.doc\n</code></pre> <pre><code>&gt;&gt;&gt; shift_nodes(\n...     tree=root,\n...     from_paths=[\"Downloads/photo1.jpg\", \"Downloads/file1.doc\"],\n...     to_paths=[\"Downloads/Pictures/photo1.jpg\", \"Downloads/Files/file1.doc\"],\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Files\n    \u2514\u2500\u2500 file1.doc\n</code></pre> <p>To delete node,</p> <pre><code>&gt;&gt;&gt; root = list_to_tree([\"Downloads/photo1.jpg\", \"Downloads/file1.doc\"])\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 file1.doc\n</code></pre> <pre><code>&gt;&gt;&gt; shift_nodes(root, [\"Downloads/photo1.jpg\"], [None])\n&gt;&gt;&gt; root.show()\nDownloads\n\u2514\u2500\u2500 file1.doc\n</code></pre> <p>In overriding case,</p> <pre><code>&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 Misc\\n\"\n... \"\u2502   \u2514\u2500\u2500 Pictures\\n\"\n... \"\u2502       \u2514\u2500\u2500 photo1.jpg\\n\"\n... \"\u2514\u2500\u2500 Pictures\\n\"\n... \"    \u2514\u2500\u2500 photo2.jpg\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u2514\u2500\u2500 Pictures\n\u2502       \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Pictures\n    \u2514\u2500\u2500 photo2.jpg\n</code></pre> <pre><code>&gt;&gt;&gt; shift_nodes(root, [\"Downloads/Misc/Pictures\"], [\"Downloads/Pictures\"], overriding=True)\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2514\u2500\u2500 Pictures\n    \u2514\u2500\u2500 photo1.jpg\n</code></pre> <p>In <code>merge_children=True</code> case, child nodes are shifted instead of the parent node.</p> <ul> <li>If the path already exists, child nodes are merged with existing children.</li> <li>If same node is shifted, the child nodes of the node are merged with the node's parent.</li> </ul> <pre><code>&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 Misc\\n\"\n... \"\u2502   \u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2502   \u2514\u2500\u2500 photo2.jpg\\n\"\n... \"\u2502   \u2514\u2500\u2500 Applications\\n\"\n... \"\u2502       \u2514\u2500\u2500 Chrome.exe\\n\"\n... \"\u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2514\u2500\u2500 photo1.jpg\\n\"\n... \"\u2514\u2500\u2500 dummy\\n\"\n... \"    \u2514\u2500\u2500 Files\\n\"\n... \"        \u2514\u2500\u2500 file1.doc\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u251c\u2500\u2500 Pictures\n\u2502   \u2502   \u2514\u2500\u2500 photo2.jpg\n\u2502   \u2514\u2500\u2500 Applications\n\u2502       \u2514\u2500\u2500 Chrome.exe\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 dummy\n    \u2514\u2500\u2500 Files\n        \u2514\u2500\u2500 file1.doc\n</code></pre> <pre><code>&gt;&gt;&gt; shift_nodes(\n...     root,\n...     [\"Downloads/Misc/Pictures\", \"Applications\", \"Downloads/dummy\"],\n...     [\"Downloads/Pictures\", \"Downloads/Applications\", \"Downloads/dummy\"],\n...     merge_children=True,\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u251c\u2500\u2500 Pictures\n\u2502   \u251c\u2500\u2500 photo1.jpg\n\u2502   \u2514\u2500\u2500 photo2.jpg\n\u251c\u2500\u2500 Chrome.exe\n\u2514\u2500\u2500 Files\n    \u2514\u2500\u2500 file1.doc\n</code></pre> <p>In <code>merge_leaves=True</code> case, leaf nodes are copied instead of the parent node.</p> <ul> <li>If the path already exists, leaf nodes are merged with existing children.</li> <li>If same node is copied, the leaf nodes of the node are merged with the node's parent.</li> </ul> <pre><code>&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 Misc\\n\"\n... \"\u2502   \u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2502   \u2514\u2500\u2500 photo2.jpg\\n\"\n... \"\u2502   \u2514\u2500\u2500 Applications\\n\"\n... \"\u2502       \u2514\u2500\u2500 Chrome.exe\\n\"\n... \"\u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2514\u2500\u2500 photo1.jpg\\n\"\n... \"\u2514\u2500\u2500 dummy\\n\"\n... \"    \u2514\u2500\u2500 Files\\n\"\n... \"        \u2514\u2500\u2500 file1.doc\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u251c\u2500\u2500 Pictures\n\u2502   \u2502   \u2514\u2500\u2500 photo2.jpg\n\u2502   \u2514\u2500\u2500 Applications\n\u2502       \u2514\u2500\u2500 Chrome.exe\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 dummy\n    \u2514\u2500\u2500 Files\n        \u2514\u2500\u2500 file1.doc\n</code></pre> <pre><code>&gt;&gt;&gt; shift_nodes(\n...     root,\n...     [\"Downloads/Misc/Pictures\", \"Applications\", \"Downloads/dummy\"],\n...     [\"Downloads/Pictures\", \"Downloads/Applications\", \"Downloads/dummy\"],\n...     merge_leaves=True,\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 Applications\n\u251c\u2500\u2500 Pictures\n\u2502   \u251c\u2500\u2500 photo1.jpg\n\u2502   \u2514\u2500\u2500 photo2.jpg\n\u251c\u2500\u2500 dummy\n\u2502   \u2514\u2500\u2500 Files\n\u251c\u2500\u2500 Chrome.exe\n\u2514\u2500\u2500 file1.doc\n</code></pre> <p>In <code>delete_children=True</code> case, only the node is shifted without its accompanying children/descendants.</p> <pre><code>&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 Misc\\n\"\n... \"\u2502   \u2514\u2500\u2500 Applications\\n\"\n... \"\u2502       \u2514\u2500\u2500 Chrome.exe\\n\"\n... \"\u2514\u2500\u2500 Pictures\\n\"\n... \"    \u2514\u2500\u2500 photo1.jpg\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u2514\u2500\u2500 Applications\n\u2502       \u2514\u2500\u2500 Chrome.exe\n\u2514\u2500\u2500 Pictures\n    \u2514\u2500\u2500 photo1.jpg\n</code></pre> <pre><code>&gt;&gt;&gt; shift_nodes(root, [\"Applications\"], [\"Downloads/Applications\"], delete_children=True)\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Applications\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to modify</p> required <code>from_paths</code> <code>List[str]</code> <p>original paths to shift nodes from</p> required <code>to_paths</code> <code>List[str]</code> <p>new paths to shift nodes to</p> required <code>sep</code> <code>str</code> <p>path separator for input paths, applies to <code>from_path</code> and <code>to_path</code></p> <code>'/'</code> <code>skippable</code> <code>bool</code> <p>indicator to skip if from path is not found, defaults to False</p> <code>False</code> <code>overriding</code> <code>bool</code> <p>indicator to override existing to path if there is clashes, defaults to False</p> <code>False</code> <code>merge_children</code> <code>bool</code> <p>indicator to merge children and remove intermediate parent node, defaults to False</p> <code>False</code> <code>merge_leaves</code> <code>bool</code> <p>indicator to merge leaf nodes and remove intermediate parent node(s), defaults to False</p> <code>False</code> <code>delete_children</code> <code>bool</code> <p>indicator to shift node only without children, defaults to False</p> <code>False</code> <code>with_full_path</code> <code>bool</code> <p>indicator to shift/copy node with full path in <code>from_paths</code>, results in faster search, defaults to False</p> <code>False</code>"},{"location":"bigtree/tree/modify/#bigtree.tree.modify.copy_nodes","title":"copy_nodes","text":"<pre><code>copy_nodes(\n    tree,\n    from_paths,\n    to_paths,\n    sep=\"/\",\n    skippable=False,\n    overriding=False,\n    merge_children=False,\n    merge_leaves=False,\n    delete_children=False,\n    with_full_path=False,\n)\n</code></pre> <p>Copy nodes from <code>from_paths</code> to <code>to_paths</code> in-place.</p> <ul> <li>Creates intermediate nodes if to path is not present</li> <li>Able to skip nodes if from path is not found, defaults to False (from-nodes must be found; not skippable).</li> <li>Able to override existing node if it exists, defaults to False (to-nodes must not exist; not overridden).</li> <li>Able to merge children and remove intermediate parent node, defaults to False (nodes are shifted; not merged).</li> <li>Able to merge only leaf nodes and remove all intermediate nodes, defaults to False (nodes are shifted; not merged)</li> <li>Able to copy node only and delete children, defaults to False (nodes are copied together with children).</li> </ul> <p>For paths in <code>from_paths</code> and <code>to_paths</code>,</p> <ul> <li>Path name can be with or without leading tree path separator symbol.</li> </ul> <p>For paths in <code>from_paths</code>,</p> <ul> <li>Path name can be partial path (trailing part of path) or node name.</li> <li>If <code>with_full_path=True</code>, path name must be full path.</li> <li>Path name must be unique to one node.</li> </ul> <p>For paths in <code>to_paths</code>,</p> <ul> <li>Path name must be full path.</li> </ul> <p>If <code>merge_children=True</code>,</p> <ul> <li>If <code>to_path</code> is not present, it copies children of <code>from_path</code>.</li> <li>If <code>to_path</code> is present, and <code>overriding=False</code>, original and new children are merged.</li> <li>If <code>to_path</code> is present and <code>overriding=True</code>, it behaves like overriding and only new children are retained.</li> </ul> <p>If <code>merge_leaves=True</code>,</p> <ul> <li>If <code>to_path</code> is not present, it copies leaves of <code>from_path</code>.</li> <li>If <code>to_path</code> is present, and <code>overriding=False</code>, original children and leaves are merged.</li> <li>If <code>to_path</code> is present and <code>overriding=True</code>, it behaves like overriding and only new leaves are retained.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import list_to_tree, str_to_tree, copy_nodes\n&gt;&gt;&gt; root = list_to_tree([\"Downloads/Pictures\", \"Downloads/photo1.jpg\", \"Downloads/file1.doc\"])\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Pictures\n\u251c\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 file1.doc\n</code></pre> <pre><code>&gt;&gt;&gt; copy_nodes(\n...     tree=root,\n...     from_paths=[\"Downloads/photo1.jpg\", \"Downloads/file1.doc\"],\n...     to_paths=[\"Downloads/Pictures/photo1.jpg\", \"Downloads/Files/file1.doc\"],\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u251c\u2500\u2500 photo1.jpg\n\u251c\u2500\u2500 file1.doc\n\u2514\u2500\u2500 Files\n    \u2514\u2500\u2500 file1.doc\n</code></pre> <p>In overriding case,</p> <pre><code>&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 Misc\\n\"\n... \"\u2502   \u2514\u2500\u2500 Pictures\\n\"\n... \"\u2502       \u2514\u2500\u2500 photo1.jpg\\n\"\n... \"\u2514\u2500\u2500 Pictures\\n\"\n... \"    \u2514\u2500\u2500 photo2.jpg\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u2514\u2500\u2500 Pictures\n\u2502       \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Pictures\n    \u2514\u2500\u2500 photo2.jpg\n</code></pre> <pre><code>&gt;&gt;&gt; copy_nodes(root, [\"Downloads/Misc/Pictures\"], [\"Downloads/Pictures\"], overriding=True)\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u2514\u2500\u2500 Pictures\n\u2502       \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Pictures\n    \u2514\u2500\u2500 photo1.jpg\n</code></pre> <p>In <code>merge_children=True</code> case, child nodes are copied instead of the parent node.</p> <ul> <li>If the path already exists, child nodes are merged with existing children.</li> <li>If same node is copied, the child nodes of the node are merged with the node's parent.</li> </ul> <pre><code>&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 Misc\\n\"\n... \"\u2502   \u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2502   \u2514\u2500\u2500 photo2.jpg\\n\"\n... \"\u2502   \u2514\u2500\u2500 Applications\\n\"\n... \"\u2502       \u2514\u2500\u2500 Chrome.exe\\n\"\n... \"\u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2514\u2500\u2500 photo1.jpg\\n\"\n... \"\u2514\u2500\u2500 dummy\\n\"\n... \"    \u2514\u2500\u2500 Files\\n\"\n... \"        \u2514\u2500\u2500 file1.doc\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u251c\u2500\u2500 Pictures\n\u2502   \u2502   \u2514\u2500\u2500 photo2.jpg\n\u2502   \u2514\u2500\u2500 Applications\n\u2502       \u2514\u2500\u2500 Chrome.exe\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 dummy\n    \u2514\u2500\u2500 Files\n        \u2514\u2500\u2500 file1.doc\n</code></pre> <pre><code>&gt;&gt;&gt; copy_nodes(\n...     root,\n...     [\"Downloads/Misc/Pictures\", \"Applications\", \"Downloads/dummy\"],\n...     [\"Downloads/Pictures\", \"Downloads/Applications\", \"Downloads/dummy\"],\n...     merge_children=True,\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u251c\u2500\u2500 Pictures\n\u2502   \u2502   \u2514\u2500\u2500 photo2.jpg\n\u2502   \u2514\u2500\u2500 Applications\n\u2502       \u2514\u2500\u2500 Chrome.exe\n\u251c\u2500\u2500 Pictures\n\u2502   \u251c\u2500\u2500 photo1.jpg\n\u2502   \u2514\u2500\u2500 photo2.jpg\n\u251c\u2500\u2500 Chrome.exe\n\u2514\u2500\u2500 Files\n    \u2514\u2500\u2500 file1.doc\n</code></pre> <p>In <code>merge_leaves=True</code> case, leaf nodes are copied instead of the parent node.</p> <ul> <li>If the path already exists, leaf nodes are merged with existing children.</li> <li>If same node is copied, the leaf nodes of the node are merged with the node's parent.</li> </ul> <pre><code>&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 Misc\\n\"\n... \"\u2502   \u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2502   \u2514\u2500\u2500 photo2.jpg\\n\"\n... \"\u2502   \u2514\u2500\u2500 Applications\\n\"\n... \"\u2502       \u2514\u2500\u2500 Chrome.exe\\n\"\n... \"\u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2514\u2500\u2500 photo1.jpg\\n\"\n... \"\u2514\u2500\u2500 dummy\\n\"\n... \"    \u2514\u2500\u2500 Files\\n\"\n... \"        \u2514\u2500\u2500 file1.doc\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u251c\u2500\u2500 Pictures\n\u2502   \u2502   \u2514\u2500\u2500 photo2.jpg\n\u2502   \u2514\u2500\u2500 Applications\n\u2502       \u2514\u2500\u2500 Chrome.exe\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 dummy\n    \u2514\u2500\u2500 Files\n        \u2514\u2500\u2500 file1.doc\n</code></pre> <pre><code>&gt;&gt;&gt; copy_nodes(\n...     root,\n...     [\"Downloads/Misc/Pictures\", \"Applications\", \"Downloads/dummy\"],\n...     [\"Downloads/Pictures\", \"Downloads/Applications\", \"Downloads/dummy\"],\n...     merge_leaves=True,\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u251c\u2500\u2500 Pictures\n\u2502   \u2502   \u2514\u2500\u2500 photo2.jpg\n\u2502   \u2514\u2500\u2500 Applications\n\u2502       \u2514\u2500\u2500 Chrome.exe\n\u251c\u2500\u2500 Pictures\n\u2502   \u251c\u2500\u2500 photo1.jpg\n\u2502   \u2514\u2500\u2500 photo2.jpg\n\u251c\u2500\u2500 dummy\n\u2502   \u2514\u2500\u2500 Files\n\u2502       \u2514\u2500\u2500 file1.doc\n\u251c\u2500\u2500 Chrome.exe\n\u2514\u2500\u2500 file1.doc\n</code></pre> <p>In <code>delete_children=True</code> case, only the node is copied without its accompanying children/descendants.</p> <pre><code>&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 Misc\\n\"\n... \"\u2502   \u2514\u2500\u2500 Applications\\n\"\n... \"\u2502       \u2514\u2500\u2500 Chrome.exe\\n\"\n... \"\u2514\u2500\u2500 Pictures\\n\"\n... \"    \u2514\u2500\u2500 photo1.jpg\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u2514\u2500\u2500 Applications\n\u2502       \u2514\u2500\u2500 Chrome.exe\n\u2514\u2500\u2500 Pictures\n    \u2514\u2500\u2500 photo1.jpg\n</code></pre> <pre><code>&gt;&gt;&gt; copy_nodes(root, [\"Applications\"], [\"Downloads/Applications\"], delete_children=True)\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Misc\n\u2502   \u2514\u2500\u2500 Applications\n\u2502       \u2514\u2500\u2500 Chrome.exe\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Applications\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to modify</p> required <code>from_paths</code> <code>List[str]</code> <p>original paths to shift nodes from</p> required <code>to_paths</code> <code>List[str]</code> <p>new paths to shift nodes to</p> required <code>sep</code> <code>str</code> <p>path separator for input paths, applies to <code>from_path</code> and <code>to_path</code></p> <code>'/'</code> <code>skippable</code> <code>bool</code> <p>indicator to skip if from path is not found, defaults to False</p> <code>False</code> <code>overriding</code> <code>bool</code> <p>indicator to override existing to path if there is clashes, defaults to False</p> <code>False</code> <code>merge_children</code> <code>bool</code> <p>indicator to merge children and remove intermediate parent node, defaults to False</p> <code>False</code> <code>merge_leaves</code> <code>bool</code> <p>indicator to merge leaf nodes and remove intermediate parent node(s), defaults to False</p> <code>False</code> <code>delete_children</code> <code>bool</code> <p>indicator to copy node only without children, defaults to False</p> <code>False</code> <code>with_full_path</code> <code>bool</code> <p>indicator to shift/copy node with full path in <code>from_paths</code>, results in faster search, defaults to False</p> <code>False</code>"},{"location":"bigtree/tree/modify/#bigtree.tree.modify.shift_and_replace_nodes","title":"shift_and_replace_nodes","text":"<pre><code>shift_and_replace_nodes(\n    tree,\n    from_paths,\n    to_paths,\n    sep=\"/\",\n    skippable=False,\n    delete_children=False,\n    with_full_path=False,\n)\n</code></pre> <p>Shift nodes from <code>from_paths</code> to replace <code>to_paths</code> in-place.</p> <ul> <li>Creates intermediate nodes if to path is not present</li> <li>Able to skip nodes if from path is not found, defaults to False (from-nodes must be found; not skippable).</li> <li>Able to shift node only and delete children, defaults to False (nodes are shifted together with children).</li> </ul> <p>For paths in <code>from_paths</code> and <code>to_paths</code>,</p> <ul> <li>Path name can be with or without leading tree path separator symbol.</li> </ul> <p>For paths in <code>from_paths</code>,</p> <ul> <li>Path name can be partial path (trailing part of path) or node name.</li> <li>If <code>with_full_path=True</code>, path name must be full path.</li> <li>Path name must be unique to one node.</li> </ul> <p>For paths in <code>to_paths</code>,</p> <ul> <li>Path name must be full path.</li> <li>Path must exist, node-to-be-replaced must be present.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import str_to_tree, shift_and_replace_nodes\n&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2514\u2500\u2500 photo1.jpg\\n\"\n... \"\u2514\u2500\u2500 Misc\\n\"\n... \"    \u2514\u2500\u2500 dummy\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Misc\n    \u2514\u2500\u2500 dummy\n</code></pre> <pre><code>&gt;&gt;&gt; shift_and_replace_nodes(root, [\"Downloads/Pictures\"], [\"Downloads/Misc/dummy\"])\n&gt;&gt;&gt; root.show()\nDownloads\n\u2514\u2500\u2500 Misc\n    \u2514\u2500\u2500 Pictures\n        \u2514\u2500\u2500 photo1.jpg\n</code></pre> <p>In <code>delete_children=True</code> case, only the node is shifted without its accompanying children/descendants.</p> <pre><code>&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2514\u2500\u2500 photo1.jpg\\n\"\n... \"\u2514\u2500\u2500 Misc\\n\"\n... \"    \u2514\u2500\u2500 dummy\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Misc\n    \u2514\u2500\u2500 dummy\n</code></pre> <pre><code>&gt;&gt;&gt; shift_and_replace_nodes(root, [\"Downloads/Pictures\"], [\"Downloads/Misc/dummy\"], delete_children=True)\n&gt;&gt;&gt; root.show()\nDownloads\n\u2514\u2500\u2500 Misc\n    \u2514\u2500\u2500 Pictures\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to modify</p> required <code>from_paths</code> <code>List[str]</code> <p>original paths to shift nodes from</p> required <code>to_paths</code> <code>List[str]</code> <p>new paths to shift nodes to</p> required <code>sep</code> <code>str</code> <p>path separator for input paths, applies to <code>from_path</code> and <code>to_path</code></p> <code>'/'</code> <code>skippable</code> <code>bool</code> <p>indicator to skip if from path is not found, defaults to False</p> <code>False</code> <code>delete_children</code> <code>bool</code> <p>indicator to shift node only without children, defaults to False</p> <code>False</code> <code>with_full_path</code> <code>bool</code> <p>indicator to shift/copy node with full path in <code>from_paths</code>, results in faster search, defaults to False</p> <code>False</code>"},{"location":"bigtree/tree/modify/#bigtree.tree.modify.copy_nodes_from_tree_to_tree","title":"copy_nodes_from_tree_to_tree","text":"<pre><code>copy_nodes_from_tree_to_tree(\n    from_tree,\n    to_tree,\n    from_paths,\n    to_paths,\n    sep=\"/\",\n    skippable=False,\n    overriding=False,\n    merge_children=False,\n    merge_leaves=False,\n    delete_children=False,\n    with_full_path=False,\n)\n</code></pre> <p>Copy nodes from <code>from_paths</code> to <code>to_paths</code> in-place.</p> <ul> <li>Creates intermediate nodes if to path is not present</li> <li>Able to skip nodes if from path is not found, defaults to False (from-nodes must be found; not skippable).</li> <li>Able to override existing node if it exists, defaults to False (to-nodes must not exist; not overridden).</li> <li>Able to merge children and remove intermediate parent node, defaults to False (nodes are shifted; not merged).</li> <li>Able to merge only leaf nodes and remove all intermediate nodes, defaults to False (nodes are shifted; not merged)</li> <li>Able to copy node only and delete children, defaults to False (nodes are copied together with children).</li> </ul> <p>For paths in <code>from_paths</code> and <code>to_paths</code>,</p> <ul> <li>Path name can be with or without leading tree path separator symbol.</li> </ul> <p>For paths in <code>from_paths</code>,</p> <ul> <li>Path name can be partial path (trailing part of path) or node name.</li> <li>If <code>with_full_path=True</code>, path name must be full path.</li> <li>Path name must be unique to one node.</li> </ul> <p>For paths in <code>to_paths</code>,</p> <ul> <li>Path name must be full path.</li> </ul> <p>If <code>merge_children=True</code>,</p> <ul> <li>If <code>to_path</code> is not present, it copies children of <code>from_path</code></li> <li>If <code>to_path</code> is present, and <code>overriding=False</code>, original and new children are merged</li> <li>If <code>to_path</code> is present and <code>overriding=True</code>, it behaves like overriding and only new leaves are retained.</li> </ul> <p>If <code>merge_leaves=True</code>,</p> <ul> <li>If <code>to_path</code> is not present, it copies leaves of <code>from_path</code>.</li> <li>If <code>to_path</code> is present, and <code>overriding=False</code>, original children and leaves are merged.</li> <li>If <code>to_path</code> is present and <code>overriding=True</code>, it behaves like overriding and only new leaves are retained.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, str_to_tree, copy_nodes_from_tree_to_tree\n&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 file1.doc\\n\"\n... \"\u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2514\u2500\u2500 photo1.jpg\\n\"\n... \"\u2514\u2500\u2500 Misc\\n\"\n... \"    \u2514\u2500\u2500 dummy\\n\"\n... \"        \u2514\u2500\u2500 photo2.jpg\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 file1.doc\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Misc\n    \u2514\u2500\u2500 dummy\n        \u2514\u2500\u2500 photo2.jpg\n</code></pre> <pre><code>&gt;&gt;&gt; root_other = Node(\"Documents\")\n&gt;&gt;&gt; copy_nodes_from_tree_to_tree(\n...     from_tree=root,\n...     to_tree=root_other,\n...     from_paths=[\"Downloads/Pictures\", \"Downloads/Misc\"],\n...     to_paths=[\"Documents/Pictures\", \"Documents/New Misc/Misc\"],\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 New Misc\n    \u2514\u2500\u2500 Misc\n        \u2514\u2500\u2500 dummy\n            \u2514\u2500\u2500 photo2.jpg\n</code></pre> <p>In overriding case,</p> <pre><code>&gt;&gt;&gt; root_other = str_to_tree(\n... \"Documents\\n\"\n... \"\u2514\u2500\u2500 Pictures\\n\"\n... \"    \u2514\u2500\u2500 photo3.jpg\"\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u2514\u2500\u2500 Pictures\n    \u2514\u2500\u2500 photo3.jpg\n</code></pre> <pre><code>&gt;&gt;&gt; copy_nodes_from_tree_to_tree(\n...     root,\n...     root_other,\n...     [\"Downloads/Pictures\", \"Downloads/Misc\"],\n...     [\"Documents/Pictures\", \"Documents/Misc\"],\n...     overriding=True,\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Misc\n    \u2514\u2500\u2500 dummy\n        \u2514\u2500\u2500 photo2.jpg\n</code></pre> <p>In <code>merge_children=True</code> case, child nodes are copied instead of the parent node.</p> <ul> <li>If the path already exists, child nodes are merged with existing children.</li> </ul> <pre><code>&gt;&gt;&gt; root_other = str_to_tree(\n... \"Documents\\n\"\n... \"\u2514\u2500\u2500 Pictures\\n\"\n... \"    \u2514\u2500\u2500 photo3.jpg\"\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u2514\u2500\u2500 Pictures\n    \u2514\u2500\u2500 photo3.jpg\n</code></pre> <pre><code>&gt;&gt;&gt; copy_nodes_from_tree_to_tree(\n...     root,\n...     root_other,\n...     [\"Downloads/Pictures\", \"Downloads/Misc\"],\n...     [\"Documents/Pictures\", \"Documents/Misc\"],\n...     merge_children=True,\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u251c\u2500\u2500 Pictures\n\u2502   \u251c\u2500\u2500 photo3.jpg\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 dummy\n    \u2514\u2500\u2500 photo2.jpg\n</code></pre> <p>In <code>merge_leaves=True</code> case, leaf nodes are copied instead of the parent node.</p> <ul> <li>If the path already exists, leaf nodes are merged with existing children.</li> </ul> <pre><code>&gt;&gt;&gt; root_other = str_to_tree(\n... \"Documents\\n\"\n... \"\u2514\u2500\u2500 Pictures\\n\"\n... \"    \u2514\u2500\u2500 photo3.jpg\"\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u2514\u2500\u2500 Pictures\n    \u2514\u2500\u2500 photo3.jpg\n</code></pre> <pre><code>&gt;&gt;&gt; copy_nodes_from_tree_to_tree(\n...     root,\n...     root_other,\n...     [\"Downloads/Pictures\", \"Downloads/Misc\"],\n...     [\"Documents/Pictures\", \"Documents/Misc\"],\n...     merge_leaves=True,\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u251c\u2500\u2500 Pictures\n\u2502   \u251c\u2500\u2500 photo3.jpg\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 photo2.jpg\n</code></pre> <p>In <code>delete_children=True</code> case, only the node is copied without its accompanying children/descendants.</p> <pre><code>&gt;&gt;&gt; root_other = Node(\"Documents\")\n&gt;&gt;&gt; root_other.show()\nDocuments\n</code></pre> <pre><code>&gt;&gt;&gt; copy_nodes_from_tree_to_tree(\n...     root,\n...     root_other,\n...     [\"Downloads/Pictures\", \"Downloads/Misc\"],\n...     [\"Documents/Pictures\", \"Documents/Misc\"],\n...     delete_children=True,\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u251c\u2500\u2500 Pictures\n\u2514\u2500\u2500 Misc\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>from_tree</code> <code>Node</code> <p>tree to copy nodes from</p> required <code>to_tree</code> <code>Node</code> <p>tree to copy nodes to</p> required <code>from_paths</code> <code>List[str]</code> <p>original paths to shift nodes from</p> required <code>to_paths</code> <code>List[str]</code> <p>new paths to shift nodes to</p> required <code>sep</code> <code>str</code> <p>path separator for input paths, applies to <code>from_path</code> and <code>to_path</code></p> <code>'/'</code> <code>skippable</code> <code>bool</code> <p>indicator to skip if from path is not found, defaults to False</p> <code>False</code> <code>overriding</code> <code>bool</code> <p>indicator to override existing to path if there is clashes, defaults to False</p> <code>False</code> <code>merge_children</code> <code>bool</code> <p>indicator to merge children and remove intermediate parent node, defaults to False</p> <code>False</code> <code>merge_leaves</code> <code>bool</code> <p>indicator to merge leaf nodes and remove intermediate parent node(s), defaults to False</p> <code>False</code> <code>delete_children</code> <code>bool</code> <p>indicator to copy node only without children, defaults to False</p> <code>False</code> <code>with_full_path</code> <code>bool</code> <p>indicator to shift/copy node with full path in <code>from_paths</code>, results in faster search, defaults to False</p> <code>False</code>"},{"location":"bigtree/tree/modify/#bigtree.tree.modify.copy_and_replace_nodes_from_tree_to_tree","title":"copy_and_replace_nodes_from_tree_to_tree","text":"<pre><code>copy_and_replace_nodes_from_tree_to_tree(\n    from_tree,\n    to_tree,\n    from_paths,\n    to_paths,\n    sep=\"/\",\n    skippable=False,\n    delete_children=False,\n    with_full_path=False,\n)\n</code></pre> <p>Copy nodes from <code>from_paths</code> to replace <code>to_paths</code> in-place.</p> <ul> <li>Creates intermediate nodes if to path is not present</li> <li>Able to skip nodes if from path is not found, defaults to False (from-nodes must be found; not skippable).</li> <li>Able to copy node only and delete children, defaults to False (nodes are copied together with children).</li> </ul> <p>For paths in <code>from_paths</code> and <code>to_paths</code>,</p> <ul> <li>Path name can be with or without leading tree path separator symbol.</li> </ul> <p>For paths in <code>from_paths</code>,</p> <ul> <li>Path name can be partial path (trailing part of path) or node name.</li> <li>If <code>with_full_path=True</code>, path name must be full path.</li> <li>Path name must be unique to one node.</li> </ul> <p>For paths in <code>to_paths</code>,</p> <ul> <li>Path name must be full path.</li> <li>Path must exist, node-to-be-replaced must be present.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import str_to_tree, copy_and_replace_nodes_from_tree_to_tree\n&gt;&gt;&gt; root = str_to_tree(\n... \"Downloads\\n\"\n... \"\u251c\u2500\u2500 file1.doc\\n\"\n... \"\u251c\u2500\u2500 Pictures\\n\"\n... \"\u2502   \u2514\u2500\u2500 photo1.jpg\\n\"\n... \"\u2514\u2500\u2500 Misc\\n\"\n... \"    \u2514\u2500\u2500 dummy\\n\"\n... \"        \u2514\u2500\u2500 photo2.jpg\"\n... )\n&gt;&gt;&gt; root.show()\nDownloads\n\u251c\u2500\u2500 file1.doc\n\u251c\u2500\u2500 Pictures\n\u2502   \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Misc\n    \u2514\u2500\u2500 dummy\n        \u2514\u2500\u2500 photo2.jpg\n</code></pre> <pre><code>&gt;&gt;&gt; root_other = str_to_tree(\n... \"Documents\\n\"\n... \"\u251c\u2500\u2500 Pictures2\\n\"\n... \"\u2502   \u2514\u2500\u2500 photo2.jpg\\n\"\n... \"\u2514\u2500\u2500 Misc2\"\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u251c\u2500\u2500 Pictures2\n\u2502   \u2514\u2500\u2500 photo2.jpg\n\u2514\u2500\u2500 Misc2\n</code></pre> <pre><code>&gt;&gt;&gt; copy_and_replace_nodes_from_tree_to_tree(\n...     from_tree=root,\n...     to_tree=root_other,\n...     from_paths=[\"Downloads/Pictures\", \"Downloads/Misc\"],\n...     to_paths=[\"Documents/Pictures2/photo2.jpg\", \"Documents/Misc2\"],\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u251c\u2500\u2500 Pictures2\n\u2502   \u2514\u2500\u2500 Pictures\n\u2502       \u2514\u2500\u2500 photo1.jpg\n\u2514\u2500\u2500 Misc\n    \u2514\u2500\u2500 dummy\n        \u2514\u2500\u2500 photo2.jpg\n</code></pre> <p>In <code>delete_children=True</code> case, only the node is copied without its accompanying children/descendants.</p> <pre><code>&gt;&gt;&gt; root_other = str_to_tree(\n... \"Documents\\n\"\n... \"\u251c\u2500\u2500 Pictures2\\n\"\n... \"\u2502   \u2514\u2500\u2500 photo2.jpg\\n\"\n... \"\u2514\u2500\u2500 Misc2\"\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u251c\u2500\u2500 Pictures2\n\u2502   \u2514\u2500\u2500 photo2.jpg\n\u2514\u2500\u2500 Misc2\n</code></pre> <pre><code>&gt;&gt;&gt; copy_and_replace_nodes_from_tree_to_tree(\n...     from_tree=root,\n...     to_tree=root_other,\n...     from_paths=[\"Downloads/Pictures\", \"Downloads/Misc\"],\n...     to_paths=[\"Documents/Pictures2/photo2.jpg\", \"Documents/Misc2\"],\n...     delete_children=True,\n... )\n&gt;&gt;&gt; root_other.show()\nDocuments\n\u251c\u2500\u2500 Pictures2\n\u2502   \u2514\u2500\u2500 Pictures\n\u2514\u2500\u2500 Misc\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>from_tree</code> <code>Node</code> <p>tree to copy nodes from</p> required <code>to_tree</code> <code>Node</code> <p>tree to copy nodes to</p> required <code>from_paths</code> <code>List[str]</code> <p>original paths to shift nodes from</p> required <code>to_paths</code> <code>List[str]</code> <p>new paths to shift nodes to</p> required <code>sep</code> <code>str</code> <p>path separator for input paths, applies to <code>from_path</code> and <code>to_path</code></p> <code>'/'</code> <code>skippable</code> <code>bool</code> <p>indicator to skip if from path is not found, defaults to False</p> <code>False</code> <code>delete_children</code> <code>bool</code> <p>indicator to copy node only without children, defaults to False</p> <code>False</code> <code>with_full_path</code> <code>bool</code> <p>indicator to shift/copy node with full path in <code>from_paths</code>, results in faster search, defaults to False</p> <code>False</code>"},{"location":"bigtree/tree/modify/#bigtree.tree.modify.copy_or_shift_logic","title":"copy_or_shift_logic","text":"<pre><code>copy_or_shift_logic(\n    tree,\n    from_paths,\n    to_paths,\n    sep=\"/\",\n    copy=False,\n    skippable=False,\n    overriding=False,\n    merge_children=False,\n    merge_leaves=False,\n    delete_children=False,\n    to_tree=None,\n    with_full_path=False,\n)\n</code></pre> <p>Shift or copy nodes from <code>from_paths</code> to <code>to_paths</code> in-place.</p> <ul> <li>Creates intermediate nodes if to path is not present</li> <li>Able to copy node, defaults to False (nodes are shifted; not copied).</li> <li>Able to skip nodes if from path is not found, defaults to False (from-nodes must be found; not skippable)</li> <li>Able to override existing node if it exists, defaults to False (to-nodes must not exist; not overridden)</li> <li>Able to merge children and remove intermediate parent node, defaults to False (nodes are shifted; not merged)</li> <li>Able to merge only leaf nodes and remove all intermediate nodes, defaults to False (nodes are shifted; not merged)</li> <li>Able to shift/copy node only and delete children, defaults to False (nodes are shifted/copied together with children).</li> <li>Able to shift/copy nodes from one tree to another tree, defaults to None (shifting/copying happens within same tree)</li> </ul> <p>For paths in <code>from_paths</code> and <code>to_paths</code>,</p> <ul> <li>Path name can be with or without leading tree path separator symbol.</li> </ul> <p>For paths in <code>from_paths</code>,</p> <ul> <li>Path name can be partial path (trailing part of path) or node name.</li> <li>If <code>with_full_path=True</code>, path name must be full path.</li> <li>Path name must be unique to one node.</li> </ul> <p>For paths in <code>to_paths</code>,</p> <ul> <li>Path name must be full path.</li> <li>Can set to empty string or None to delete the path in <code>from_paths</code>, note that <code>copy</code> must be set to False.</li> </ul> <p>If <code>merge_children=True</code>,</p> <ul> <li>If <code>to_path</code> is not present, it shifts/copies children of <code>from_path</code>.</li> <li>If <code>to_path</code> is present, and <code>overriding=False</code>, original and new children are merged.</li> <li>If <code>to_path</code> is present and <code>overriding=True</code>, it behaves like overriding and only new children are retained.</li> </ul> <p>If <code>merge_leaves=True</code>,</p> <ul> <li>If <code>to_path</code> is not present, it shifts/copies leaves of <code>from_path</code>.</li> <li>If <code>to_path</code> is present, and <code>overriding=False</code>, original children and leaves are merged.</li> <li>If <code>to_path</code> is present and <code>overriding=True</code>, it behaves like overriding and only new leaves are retained,     original non-leaf nodes in <code>from_path</code> are retained.</li> </ul> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to modify</p> required <code>from_paths</code> <code>List[str]</code> <p>original paths to shift nodes from</p> required <code>to_paths</code> <code>List[str]</code> <p>new paths to shift nodes to</p> required <code>sep</code> <code>str</code> <p>path separator for input paths, applies to <code>from_path</code> and <code>to_path</code></p> <code>'/'</code> <code>copy</code> <code>bool</code> <p>indicator to copy node, defaults to False</p> <code>False</code> <code>skippable</code> <code>bool</code> <p>indicator to skip if from path is not found, defaults to False</p> <code>False</code> <code>overriding</code> <code>bool</code> <p>indicator to override existing to path if there is clashes, defaults to False</p> <code>False</code> <code>merge_children</code> <code>bool</code> <p>indicator to merge children and remove intermediate parent node, defaults to False</p> <code>False</code> <code>merge_leaves</code> <code>bool</code> <p>indicator to merge leaf nodes and remove intermediate parent node(s), defaults to False</p> <code>False</code> <code>delete_children</code> <code>bool</code> <p>indicator to shift/copy node only without children, defaults to False</p> <code>False</code> <code>to_tree</code> <code>Node</code> <p>tree to copy to, defaults to None</p> <code>None</code> <code>with_full_path</code> <code>bool</code> <p>indicator to shift/copy node with full path in <code>from_paths</code>, results in faster search, defaults to False</p> <code>False</code>"},{"location":"bigtree/tree/modify/#bigtree.tree.modify.replace_logic","title":"replace_logic","text":"<pre><code>replace_logic(\n    tree,\n    from_paths,\n    to_paths,\n    sep=\"/\",\n    copy=False,\n    skippable=False,\n    delete_children=False,\n    to_tree=None,\n    with_full_path=False,\n)\n</code></pre> <p>Shift or copy nodes from <code>from_paths</code> to replace <code>to_paths</code> in-place.</p> <ul> <li>Creates intermediate nodes if to path is not present</li> <li>Able to copy node, defaults to False (nodes are shifted; not copied).</li> <li>Able to skip nodes if from path is not found, defaults to False (from-nodes must be found; not skippable)</li> <li>Able to replace node only and delete children, defaults to False (nodes are shifted/copied together with children).</li> <li>Able to shift/copy nodes from one tree to another tree, defaults to None (shifting/copying happens within same tree)</li> </ul> <p>For paths in <code>from_paths</code> and <code>to_paths</code>,</p> <ul> <li>Path name can be with or without leading tree path separator symbol.</li> </ul> <p>For paths in <code>from_paths</code>,</p> <ul> <li>Path name can be partial path (trailing part of path) or node name.</li> <li>If <code>with_full_path=True</code>, path name must be full path.</li> <li>Path name must be unique to one node.</li> </ul> <p>For paths in <code>to_paths</code>,</p> <ul> <li>Path name must be full path.</li> <li>Path must exist, node-to-be-replaced must be present.</li> </ul> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to modify</p> required <code>from_paths</code> <code>List[str]</code> <p>original paths to shift nodes from</p> required <code>to_paths</code> <code>List[str]</code> <p>new paths to shift nodes to</p> required <code>sep</code> <code>str</code> <p>path separator for input paths, applies to <code>from_path</code> and <code>to_path</code></p> <code>'/'</code> <code>copy</code> <code>bool</code> <p>indicator to copy node, defaults to False</p> <code>False</code> <code>skippable</code> <code>bool</code> <p>indicator to skip if from path is not found, defaults to False</p> <code>False</code> <code>delete_children</code> <code>bool</code> <p>indicator to shift/copy node only without children, defaults to False</p> <code>False</code> <code>to_tree</code> <code>Node</code> <p>tree to copy to, defaults to None</p> <code>None</code> <code>with_full_path</code> <code>bool</code> <p>indicator to shift/copy node with full path in <code>from_paths</code>, results in faster search, defaults to False</p> <code>False</code>"},{"location":"bigtree/tree/search/","title":"\ud83d\udd0d Search","text":"<p>Search methods for Trees.</p> Search by One node One or more nodes General method <code>find</code>, <code>find_child</code> <code>findall</code>, <code>find_children</code> Node name <code>find_name</code>, <code>find_child_by_name</code> <code>find_names</code> Node path <code>find_path</code>, <code>find_full_path</code>, <code>find_relative_path</code> <code>find_paths</code>, <code>find_relative_path</code> Node attributes <code>find_attr</code> <code>find_attrs</code>"},{"location":"bigtree/tree/search/#bigtree.tree.search","title":"bigtree.tree.search","text":""},{"location":"bigtree/tree/search/#bigtree.tree.search.findall","title":"findall","text":"<pre><code>findall(\n    tree, condition, max_depth=0, min_count=0, max_count=0\n)\n</code></pre> <p>Search tree for nodes matching condition (callable function).</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, findall\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=c)\n&gt;&gt;&gt; findall(root, lambda node: node.age &gt; 62)\n(Node(/a, age=90), Node(/a/b, age=65))\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode</code> <p>tree to search</p> required <code>condition</code> <code>Callable</code> <p>function that takes in node as argument, returns node if condition evaluates to <code>True</code></p> required <code>max_depth</code> <code>int</code> <p>maximum depth to search for, based on the <code>depth</code> attribute, defaults to None</p> <code>0</code> <code>min_count</code> <code>int</code> <p>checks for minimum number of occurrences, raise SearchError if the number of results do not meet min_count, defaults to None</p> <code>0</code> <code>max_count</code> <code>int</code> <p>checks for maximum number of occurrences, raise SearchError if the number of results do not meet min_count, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>Tuple[T, ...]</code> <p>(Tuple[BaseNode, ...])</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find","title":"find","text":"<pre><code>find(tree, condition, max_depth=0)\n</code></pre> <p>Search tree for single node matching condition (callable function).</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=c)\n&gt;&gt;&gt; find(root, lambda node: node.age == 65)\nNode(/a/b, age=65)\n&gt;&gt;&gt; find(root, lambda node: node.age &gt; 5)\nTraceback (most recent call last):\n    ...\nbigtree.utils.exceptions.SearchError: Expected less than 1 element(s), found 4 elements\n(Node(/a, age=90), Node(/a/b, age=65), Node(/a/c, age=60), Node(/a/c/d, age=40))\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode</code> <p>tree to search</p> required <code>condition</code> <code>Callable</code> <p>function that takes in node as argument, returns node if condition evaluates to <code>True</code></p> required <code>max_depth</code> <code>int</code> <p>maximum depth to search for, based on the <code>depth</code> attribute, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>T</code> <p>(BaseNode)</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find_name","title":"find_name","text":"<pre><code>find_name(tree, name, max_depth=0)\n</code></pre> <p>Search tree for single node matching name attribute.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find_name\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=c)\n&gt;&gt;&gt; find_name(root, \"c\")\nNode(/a/c, age=60)\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to search</p> required <code>name</code> <code>str</code> <p>value to match for name attribute</p> required <code>max_depth</code> <code>int</code> <p>maximum depth to search for, based on the <code>depth</code> attribute, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>NodeT</code> <p>(Node)</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find_names","title":"find_names","text":"<pre><code>find_names(tree, name, max_depth=0)\n</code></pre> <p>Search tree for multiple node(s) matching name attribute.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find_names\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"b\", age=40, parent=c)\n&gt;&gt;&gt; find_names(root, \"c\")\n(Node(/a/c, age=60),)\n&gt;&gt;&gt; find_names(root, \"b\")\n(Node(/a/b, age=65), Node(/a/c/b, age=40))\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to search</p> required <code>name</code> <code>str</code> <p>value to match for name attribute</p> required <code>max_depth</code> <code>int</code> <p>maximum depth to search for, based on the <code>depth</code> attribute, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>Iterable[NodeT]</code> <p>(Iterable[Node])</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find_relative_path","title":"find_relative_path","text":"<pre><code>find_relative_path(tree, path_name)\n</code></pre> <p>Search tree for single node matching relative path attribute.</p> <ul> <li>Supports unix folder expression for relative path, i.e., '../../node_name'</li> <li>Supports wildcards, i.e., '*/node_name'</li> <li>If path name starts with leading separator symbol, it will start at root node.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find_relative_path\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=c)\n&gt;&gt;&gt; find_relative_path(d, \"..\")\n(Node(/a/c, age=60),)\n&gt;&gt;&gt; find_relative_path(d, \"../../b\")\n(Node(/a/b, age=65),)\n&gt;&gt;&gt; find_relative_path(d, \"../../*\")\n(Node(/a/b, age=65), Node(/a/c, age=60))\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to search</p> required <code>path_name</code> <code>str</code> <p>value to match (relative path) of path_name attribute</p> required <p>Returns:</p> Type Description <code>Iterable[NodeT]</code> <p>(Iterable[Node])</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find_full_path","title":"find_full_path","text":"<pre><code>find_full_path(tree, path_name)\n</code></pre> <p>Search tree for single node matching path attribute.</p> <ul> <li>Path name can be with or without leading tree path separator symbol.</li> <li>Path name must be full path, works similar to <code>find_path</code> but faster.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find_full_path\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=c)\n&gt;&gt;&gt; find_full_path(root, \"/a/c/d\")\nNode(/a/c/d, age=40)\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to search</p> required <code>path_name</code> <code>str</code> <p>value to match (full path) of path_name attribute</p> required <p>Returns:</p> Type Description <code>NodeT</code> <p>(Node)</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find_path","title":"find_path","text":"<pre><code>find_path(tree, path_name)\n</code></pre> <p>Search tree for single node matching path attribute.</p> <ul> <li>Path name can be with or without leading tree path separator symbol.</li> <li>Path name can be full path or partial path (trailing part of path) or node name.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find_path\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=c)\n&gt;&gt;&gt; find_path(root, \"c\")\nNode(/a/c, age=60)\n&gt;&gt;&gt; find_path(root, \"/c\")\nNode(/a/c, age=60)\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to search</p> required <code>path_name</code> <code>str</code> <p>value to match (full path) or trailing part (partial path) of path_name attribute</p> required <p>Returns:</p> Type Description <code>NodeT</code> <p>(Node)</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find_paths","title":"find_paths","text":"<pre><code>find_paths(tree, path_name)\n</code></pre> <p>Search tree for multiple nodes matching path attribute.</p> <ul> <li>Path name can be with or without leading tree path separator symbol.</li> <li>Path name can be partial path (trailing part of path) or node name.</li> </ul> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find_paths\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"c\", age=40, parent=c)\n&gt;&gt;&gt; find_paths(root, \"/a/c\")\n(Node(/a/c, age=60),)\n&gt;&gt;&gt; find_paths(root, \"/c\")\n(Node(/a/c, age=60), Node(/a/c/c, age=40))\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node</code> <p>tree to search</p> required <code>path_name</code> <code>str</code> <p>value to match (full path) or trailing part (partial path) of path_name attribute</p> required <p>Returns:</p> Type Description <code>Tuple[NodeT, ...]</code> <p>(Tuple[Node, ...])</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find_attr","title":"find_attr","text":"<pre><code>find_attr(tree, attr_name, attr_value, max_depth=0)\n</code></pre> <p>Search tree for single node matching custom attribute.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find_attr\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=c)\n&gt;&gt;&gt; find_attr(root, \"age\", 65)\nNode(/a/b, age=65)\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode</code> <p>tree to search</p> required <code>attr_name</code> <code>str</code> <p>attribute name to perform matching</p> required <code>attr_value</code> <code>Any</code> <p>value to match for attr_name attribute</p> required <code>max_depth</code> <code>int</code> <p>maximum depth to search for, based on the <code>depth</code> attribute, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>BaseNode</code> <p>(BaseNode)</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find_attrs","title":"find_attrs","text":"<pre><code>find_attrs(tree, attr_name, attr_value, max_depth=0)\n</code></pre> <p>Search tree for node(s) matching custom attribute.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find_attrs\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=65, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=c)\n&gt;&gt;&gt; find_attrs(root, \"age\", 65)\n(Node(/a/b, age=65), Node(/a/c, age=65))\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode</code> <p>tree to search</p> required <code>attr_name</code> <code>str</code> <p>attribute name to perform matching</p> required <code>attr_value</code> <code>Any</code> <p>value to match for attr_name attribute</p> required <code>max_depth</code> <code>int</code> <p>maximum depth to search for, based on the <code>depth</code> attribute, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>Tuple[BaseNode, ...]</code> <p>(Tuple[BaseNode, ...])</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find_children","title":"find_children","text":"<pre><code>find_children(tree, condition, min_count=0, max_count=0)\n</code></pre> <p>Search children for nodes matching condition (callable function).</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find_children\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=c)\n&gt;&gt;&gt; find_children(root, lambda node: node.age &gt; 30)\n(Node(/a/b, age=65), Node(/a/c, age=60))\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode / DAGNode</code> <p>tree to search for its children</p> required <code>condition</code> <code>Callable</code> <p>function that takes in node as argument, returns node if condition evaluates to <code>True</code></p> required <code>min_count</code> <code>int</code> <p>checks for minimum number of occurrences, raise SearchError if the number of results do not meet min_count, defaults to None</p> <code>0</code> <code>max_count</code> <code>int</code> <p>checks for maximum number of occurrences, raise SearchError if the number of results do not meet min_count, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>Tuple[Union[T, DAGNodeT], ...]</code> <p>(BaseNode/DAGNode)</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find_child","title":"find_child","text":"<pre><code>find_child(tree, condition)\n</code></pre> <p>Search children for single node matching condition (callable function).</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find_child\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=c)\n&gt;&gt;&gt; find_child(root, lambda node: node.age &gt; 62)\nNode(/a/b, age=65)\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode / DAGNode</code> <p>tree to search for its child</p> required <code>condition</code> <code>Callable</code> <p>function that takes in node as argument, returns node if condition evaluates to <code>True</code></p> required <p>Returns:</p> Type Description <code>Union[T, DAGNodeT]</code> <p>(BaseNode/DAGNode)</p>"},{"location":"bigtree/tree/search/#bigtree.tree.search.find_child_by_name","title":"find_child_by_name","text":"<pre><code>find_child_by_name(tree, name)\n</code></pre> <p>Search tree for single node matching name attribute.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, find_child_by_name\n&gt;&gt;&gt; root = Node(\"a\", age=90)\n&gt;&gt;&gt; b = Node(\"b\", age=65, parent=root)\n&gt;&gt;&gt; c = Node(\"c\", age=60, parent=root)\n&gt;&gt;&gt; d = Node(\"d\", age=40, parent=c)\n&gt;&gt;&gt; find_child_by_name(root, \"c\")\nNode(/a/c, age=60)\n&gt;&gt;&gt; find_child_by_name(c, \"d\")\nNode(/a/c/d, age=40)\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Node / DAGNode</code> <p>tree to search, parent node</p> required <code>name</code> <code>str</code> <p>value to match for name attribute, child node</p> required <p>Returns:</p> Type Description <code>Union[NodeT, DAGNodeT]</code> <p>(Node/DAGNode)</p>"},{"location":"bigtree/utils/","title":"\ud83d\udd27 Utils","text":""},{"location":"bigtree/utils/iterators/","title":"\u27b0 Iterators","text":"<p>Iterator methods for Trees and DAGs.</p>"},{"location":"bigtree/utils/iterators/#iterator-methods","title":"Iterator Methods","text":"Data Structure Algorithm Description Binary Tree In-order Traversal Depth-First Search, LNR Tree Pre-order Traversal Depth-First Search, NLR Tree Post-Order Traversal Depth-First Search, LRN Tree Level-Order Traversal Breadth-First Search Tree ZigZag Traversal Breadth-First Search Tree ZigZag Group Traversal Breadth-First Search DAG General Depth-First Search"},{"location":"bigtree/utils/iterators/#bigtree.utils.iterators","title":"bigtree.utils.iterators","text":""},{"location":"bigtree/utils/iterators/#bigtree.utils.iterators.inorder_iter","title":"inorder_iter","text":"<pre><code>inorder_iter(tree, filter_condition=None, max_depth=0)\n</code></pre> <p>Iterate through all children of a tree.</p> <p>In-Order Iteration Algorithm, LNR     1. Recursively traverse the current node's left subtree.     2. Visit the current node.     3. Recursively traverse the current node's right subtree.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import BinaryNode, list_to_binarytree, inorder_iter\n&gt;&gt;&gt; num_list = [1, 2, 3, 4, 5, 6, 7, 8]\n&gt;&gt;&gt; root = list_to_binarytree(num_list)\n&gt;&gt;&gt; root.show()\n1\n\u251c\u2500\u2500 2\n\u2502   \u251c\u2500\u2500 4\n\u2502   \u2502   \u2514\u2500\u2500 8\n\u2502   \u2514\u2500\u2500 5\n\u2514\u2500\u2500 3\n    \u251c\u2500\u2500 6\n    \u2514\u2500\u2500 7\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in inorder_iter(root)]\n['8', '4', '2', '5', '1', '6', '3', '7']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in inorder_iter(root, filter_condition=lambda x: x.node_name in [\"1\", \"4\", \"3\", \"6\", \"7\"])]\n['4', '1', '6', '3', '7']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in inorder_iter(root, max_depth=3)]\n['4', '2', '5', '1', '6', '3', '7']\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BinaryNode</code> <p>input tree</p> required <code>filter_condition</code> <code>Optional[Callable[[BinaryNode], bool]]</code> <p>function that takes in node as argument, optional Return node if condition evaluates to <code>True</code></p> <code>None</code> <code>max_depth</code> <code>int</code> <p>maximum depth of iteration, based on <code>depth</code> attribute, optional</p> <code>0</code> <p>Returns:</p> Type Description <code>Iterable[BinaryNodeT]</code> <p>(Iterable[BinaryNode])</p>"},{"location":"bigtree/utils/iterators/#bigtree.utils.iterators.preorder_iter","title":"preorder_iter","text":"<pre><code>preorder_iter(\n    tree,\n    filter_condition=None,\n    stop_condition=None,\n    max_depth=0,\n)\n</code></pre> <p>Iterate through all children of a tree.</p> <p>Pre-Order Iteration Algorithm, NLR     1. Visit the current node.     2. Recursively traverse the current node's left subtree.     3. Recursively traverse the current node's right subtree.</p> <p>It is topologically sorted because a parent node is processed before its child nodes.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, list_to_tree, preorder_iter\n&gt;&gt;&gt; path_list = [\"a/b/d\", \"a/b/e/g\", \"a/b/e/h\", \"a/c/f\"]\n&gt;&gt;&gt; root = list_to_tree(path_list)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in preorder_iter(root)]\n['a', 'b', 'd', 'e', 'g', 'h', 'c', 'f']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in preorder_iter(root, filter_condition=lambda x: x.node_name in [\"a\", \"d\", \"e\", \"f\", \"g\"])]\n['a', 'd', 'e', 'g', 'f']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in preorder_iter(root, stop_condition=lambda x: x.node_name == \"e\")]\n['a', 'b', 'd', 'c', 'f']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in preorder_iter(root, max_depth=3)]\n['a', 'b', 'd', 'e', 'c', 'f']\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>Union[BaseNode, DAGNode]</code> <p>input tree</p> required <code>filter_condition</code> <code>Optional[Callable[[T], bool]]</code> <p>function that takes in node as argument, optional Return node if condition evaluates to <code>True</code></p> <code>None</code> <code>stop_condition</code> <code>Optional[Callable[[T], bool]]</code> <p>function that takes in node as argument, optional Stops iteration if condition evaluates to <code>True</code></p> <code>None</code> <code>max_depth</code> <code>int</code> <p>maximum depth of iteration, based on <code>depth</code> attribute, optional</p> <code>0</code> <p>Returns:</p> Type Description <code>Iterable[T]</code> <p>(Union[Iterable[BaseNode], Iterable[DAGNode]])</p>"},{"location":"bigtree/utils/iterators/#bigtree.utils.iterators.postorder_iter","title":"postorder_iter","text":"<pre><code>postorder_iter(\n    tree,\n    filter_condition=None,\n    stop_condition=None,\n    max_depth=0,\n)\n</code></pre> <p>Iterate through all children of a tree.</p> <p>Post-Order Iteration Algorithm, LRN     1. Recursively traverse the current node's left subtree.     2. Recursively traverse the current node's right subtree.     3. Visit the current node.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, list_to_tree, postorder_iter\n&gt;&gt;&gt; path_list = [\"a/b/d\", \"a/b/e/g\", \"a/b/e/h\", \"a/c/f\"]\n&gt;&gt;&gt; root = list_to_tree(path_list)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in postorder_iter(root)]\n['d', 'g', 'h', 'e', 'b', 'f', 'c', 'a']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in postorder_iter(root, filter_condition=lambda x: x.node_name in [\"a\", \"d\", \"e\", \"f\", \"g\"])]\n['d', 'g', 'e', 'f', 'a']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in postorder_iter(root, stop_condition=lambda x: x.node_name == \"e\")]\n['d', 'b', 'f', 'c', 'a']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in postorder_iter(root, max_depth=3)]\n['d', 'e', 'b', 'f', 'c', 'a']\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode</code> <p>input tree</p> required <code>filter_condition</code> <code>Optional[Callable[[BaseNode], bool]]</code> <p>function that takes in node as argument, optional Return node if condition evaluates to <code>True</code></p> <code>None</code> <code>stop_condition</code> <code>Optional[Callable[[BaseNode], bool]]</code> <p>function that takes in node as argument, optional Stops iteration if condition evaluates to <code>True</code></p> <code>None</code> <code>max_depth</code> <code>int</code> <p>maximum depth of iteration, based on <code>depth</code> attribute, optional</p> <code>0</code> <p>Returns:</p> Type Description <code>Iterable[BaseNodeT]</code> <p>(Iterable[BaseNode])</p>"},{"location":"bigtree/utils/iterators/#bigtree.utils.iterators.levelorder_iter","title":"levelorder_iter","text":"<pre><code>levelorder_iter(\n    tree,\n    filter_condition=None,\n    stop_condition=None,\n    max_depth=0,\n)\n</code></pre> <p>Iterate through all children of a tree.</p> <p>Level-Order Iteration Algorithm     1. Recursively traverse the nodes on same level.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, list_to_tree, levelorder_iter\n&gt;&gt;&gt; path_list = [\"a/b/d\", \"a/b/e/g\", \"a/b/e/h\", \"a/c/f\"]\n&gt;&gt;&gt; root = list_to_tree(path_list)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in levelorder_iter(root)]\n['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in levelorder_iter(root, filter_condition=lambda x: x.node_name in [\"a\", \"d\", \"e\", \"f\", \"g\"])]\n['a', 'd', 'e', 'f', 'g']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in levelorder_iter(root, stop_condition=lambda x: x.node_name == \"e\")]\n['a', 'b', 'c', 'd', 'f']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in levelorder_iter(root, max_depth=3)]\n['a', 'b', 'c', 'd', 'e', 'f']\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode</code> <p>input tree</p> required <code>filter_condition</code> <code>Optional[Callable[[BaseNode], bool]]</code> <p>function that takes in node as argument, optional Return node if condition evaluates to <code>True</code></p> <code>None</code> <code>stop_condition</code> <code>Optional[Callable[[BaseNode], bool]]</code> <p>function that takes in node as argument, optional Stops iteration if condition evaluates to <code>True</code></p> <code>None</code> <code>max_depth</code> <code>int</code> <p>maximum depth of iteration, based on <code>depth</code> attribute, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>Iterable[BaseNodeT]</code> <p>(Iterable[BaseNode])</p>"},{"location":"bigtree/utils/iterators/#bigtree.utils.iterators.levelordergroup_iter","title":"levelordergroup_iter","text":"<pre><code>levelordergroup_iter(\n    tree,\n    filter_condition=None,\n    stop_condition=None,\n    max_depth=0,\n)\n</code></pre> <p>Iterate through all children of a tree.</p> <p>Level-Order Group Iteration Algorithm     1. Recursively traverse the nodes on same level, returns nodes level by level in a nested list.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, list_to_tree, levelordergroup_iter\n&gt;&gt;&gt; path_list = [\"a/b/d\", \"a/b/e/g\", \"a/b/e/h\", \"a/c/f\"]\n&gt;&gt;&gt; root = list_to_tree(path_list)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n</code></pre> <pre><code>&gt;&gt;&gt; [[node.node_name for node in group] for group in levelordergroup_iter(root)]\n[['a'], ['b', 'c'], ['d', 'e', 'f'], ['g', 'h']]\n</code></pre> <pre><code>&gt;&gt;&gt; [[node.node_name for node in group] for group in levelordergroup_iter(root, filter_condition=lambda x: x.node_name in [\"a\", \"d\", \"e\", \"f\", \"g\"])]\n[['a'], [], ['d', 'e', 'f'], ['g']]\n</code></pre> <pre><code>&gt;&gt;&gt; [[node.node_name for node in group] for group in levelordergroup_iter(root, stop_condition=lambda x: x.node_name == \"e\")]\n[['a'], ['b', 'c'], ['d', 'f']]\n</code></pre> <pre><code>&gt;&gt;&gt; [[node.node_name for node in group] for group in levelordergroup_iter(root, max_depth=3)]\n[['a'], ['b', 'c'], ['d', 'e', 'f']]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode</code> <p>input tree</p> required <code>filter_condition</code> <code>Optional[Callable[[BaseNode], bool]]</code> <p>function that takes in node as argument, optional Return node if condition evaluates to <code>True</code></p> <code>None</code> <code>stop_condition</code> <code>Optional[Callable[[BaseNode], bool]]</code> <p>function that takes in node as argument, optional Stops iteration if condition evaluates to <code>True</code></p> <code>None</code> <code>max_depth</code> <code>int</code> <p>maximum depth of iteration, based on <code>depth</code> attribute, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>Iterable[Iterable[BaseNodeT]]</code> <p>(Iterable[Iterable[BaseNode]])</p>"},{"location":"bigtree/utils/iterators/#bigtree.utils.iterators.zigzag_iter","title":"zigzag_iter","text":"<pre><code>zigzag_iter(\n    tree,\n    filter_condition=None,\n    stop_condition=None,\n    max_depth=0,\n)\n</code></pre> <p>Iterate through all children of a tree.</p> <p>ZigZag Iteration Algorithm     1. Recursively traverse the nodes on same level, in a zigzag manner across different levels.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, list_to_tree, zigzag_iter\n&gt;&gt;&gt; path_list = [\"a/b/d\", \"a/b/e/g\", \"a/b/e/h\", \"a/c/f\"]\n&gt;&gt;&gt; root = list_to_tree(path_list)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in zigzag_iter(root)]\n['a', 'c', 'b', 'd', 'e', 'f', 'h', 'g']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in zigzag_iter(root, filter_condition=lambda x: x.node_name in [\"a\", \"d\", \"e\", \"f\", \"g\"])]\n['a', 'd', 'e', 'f', 'g']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in zigzag_iter(root, stop_condition=lambda x: x.node_name == \"e\")]\n['a', 'c', 'b', 'd', 'f']\n</code></pre> <pre><code>&gt;&gt;&gt; [node.node_name for node in zigzag_iter(root, max_depth=3)]\n['a', 'c', 'b', 'd', 'e', 'f']\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode</code> <p>input tree</p> required <code>filter_condition</code> <code>Optional[Callable[[BaseNode], bool]]</code> <p>function that takes in node as argument, optional Return node if condition evaluates to <code>True</code></p> <code>None</code> <code>stop_condition</code> <code>Optional[Callable[[BaseNode], bool]]</code> <p>function that takes in node as argument, optional Stops iteration if condition evaluates to <code>True</code></p> <code>None</code> <code>max_depth</code> <code>int</code> <p>maximum depth of iteration, based on <code>depth</code> attribute, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>Iterable[BaseNodeT]</code> <p>(Iterable[BaseNode])</p>"},{"location":"bigtree/utils/iterators/#bigtree.utils.iterators.zigzaggroup_iter","title":"zigzaggroup_iter","text":"<pre><code>zigzaggroup_iter(\n    tree,\n    filter_condition=None,\n    stop_condition=None,\n    max_depth=0,\n)\n</code></pre> <p>Iterate through all children of a tree.</p> <p>ZigZag Group Iteration Algorithm     1. Recursively traverse the nodes on same level, in a zigzag manner across different levels,         returns nodes level by level in a nested list.</p> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import Node, list_to_tree, zigzaggroup_iter\n&gt;&gt;&gt; path_list = [\"a/b/d\", \"a/b/e/g\", \"a/b/e/h\", \"a/c/f\"]\n&gt;&gt;&gt; root = list_to_tree(path_list)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n</code></pre> <pre><code>&gt;&gt;&gt; [[node.node_name for node in group] for group in zigzaggroup_iter(root)]\n[['a'], ['c', 'b'], ['d', 'e', 'f'], ['h', 'g']]\n</code></pre> <pre><code>&gt;&gt;&gt; [[node.node_name for node in group] for group in zigzaggroup_iter(root, filter_condition=lambda x: x.node_name in [\"a\", \"d\", \"e\", \"f\", \"g\"])]\n[['a'], [], ['d', 'e', 'f'], ['g']]\n</code></pre> <pre><code>&gt;&gt;&gt; [[node.node_name for node in group] for group in zigzaggroup_iter(root, stop_condition=lambda x: x.node_name == \"e\")]\n[['a'], ['c', 'b'], ['d', 'f']]\n</code></pre> <pre><code>&gt;&gt;&gt; [[node.node_name for node in group] for group in zigzaggroup_iter(root, max_depth=3)]\n[['a'], ['c', 'b'], ['d', 'e', 'f']]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>tree</code> <code>BaseNode</code> <p>input tree</p> required <code>filter_condition</code> <code>Optional[Callable[[BaseNode], bool]]</code> <p>function that takes in node as argument, optional Return node if condition evaluates to <code>True</code></p> <code>None</code> <code>stop_condition</code> <code>Optional[Callable[[BaseNode], bool]]</code> <p>function that takes in node as argument, optional Stops iteration if condition evaluates to <code>True</code></p> <code>None</code> <code>max_depth</code> <code>int</code> <p>maximum depth of iteration, based on <code>depth</code> attribute, defaults to None</p> <code>0</code> <p>Returns:</p> Type Description <code>Iterable[Iterable[BaseNodeT]]</code> <p>(Iterable[Iterable[BaseNode]])</p>"},{"location":"bigtree/utils/iterators/#bigtree.utils.iterators.dag_iterator","title":"dag_iterator","text":"<pre><code>dag_iterator(dag)\n</code></pre> <p>Iterate through all nodes of a Directed Acyclic Graph (DAG). Note that node names must be unique. Note that DAG must at least have two nodes to be shown on graph.</p> <ol> <li>Visit the current node.</li> <li>Recursively traverse the current node's parents.</li> <li>Recursively traverse the current node's children.</li> </ol> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import DAGNode, dag_iterator\n&gt;&gt;&gt; a = DAGNode(\"a\", step=1)\n&gt;&gt;&gt; b = DAGNode(\"b\", step=1)\n&gt;&gt;&gt; c = DAGNode(\"c\", step=2, parents=[a, b])\n&gt;&gt;&gt; d = DAGNode(\"d\", step=2, parents=[a, c])\n&gt;&gt;&gt; e = DAGNode(\"e\", step=3, parents=[d])\n&gt;&gt;&gt; [(parent.node_name, child.node_name) for parent, child in dag_iterator(a)]\n[('a', 'c'), ('a', 'd'), ('b', 'c'), ('c', 'd'), ('d', 'e')]\n</code></pre> <p>Parameters:</p> Name Type Description Default <code>dag</code> <code>DAGNode</code> <p>input dag</p> required <p>Returns:</p> Type Description <code>Iterable[Tuple[DAGNodeT, DAGNodeT]]</code> <p>(Iterable[Tuple[DAGNode, DAGNode]])</p>"},{"location":"bigtree/utils/plot/","title":"\ud83d\udcca Plot","text":"<p>Plotting methods for Trees.</p>"},{"location":"bigtree/utils/plot/#bigtree.utils.plot","title":"bigtree.utils.plot","text":""},{"location":"bigtree/utils/plot/#bigtree.utils.plot.reingold_tilford","title":"reingold_tilford","text":"<pre><code>reingold_tilford(\n    tree_node,\n    sibling_separation=1.0,\n    subtree_separation=1.0,\n    level_separation=1.0,\n    x_offset=0.0,\n    y_offset=0.0,\n)\n</code></pre> <p>Algorithm for drawing tree structure, retrieves <code>(x, y)</code> coordinates for a tree structure. Adds <code>x</code> and <code>y</code> attributes to every node in the tree. Modifies tree in-place.</p> <p>This algorithm[1] is an improvement over Reingold Tilford algorithm[2].</p> <p>According to Reingold Tilford's paper, a tree diagram should satisfy the following aesthetic rules,</p> <ol> <li>Nodes at the same depth should lie along a straight line, and the straight lines defining the depths should be parallel.</li> <li>A left child should be positioned to the left of its parent node and a right child to the right.</li> <li>A parent should be centered over their children.</li> <li>A tree and its mirror image should produce drawings that are reflections of one another; a subtree should be drawn the same way regardless of where it occurs in the tree.</li> </ol> <p>Examples:</p> <pre><code>&gt;&gt;&gt; from bigtree import reingold_tilford, list_to_tree\n&gt;&gt;&gt; path_list = [\"a/b/d\", \"a/b/e/g\", \"a/b/e/h\", \"a/c/f\"]\n&gt;&gt;&gt; root = list_to_tree(path_list)\n&gt;&gt;&gt; root.show()\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n</code></pre> <pre><code>&gt;&gt;&gt; reingold_tilford(root)\n&gt;&gt;&gt; root.show(attr_list=[\"x\", \"y\"])\na [x=1.25, y=3.0]\n\u251c\u2500\u2500 b [x=0.5, y=2.0]\n\u2502   \u251c\u2500\u2500 d [x=0.0, y=1.0]\n\u2502   \u2514\u2500\u2500 e [x=1.0, y=1.0]\n\u2502       \u251c\u2500\u2500 g [x=0.5, y=0.0]\n\u2502       \u2514\u2500\u2500 h [x=1.5, y=0.0]\n\u2514\u2500\u2500 c [x=2.0, y=2.0]\n    \u2514\u2500\u2500 f [x=2.0, y=1.0]\n</code></pre> <p>References</p> <ul> <li>[1] Walker, J. (1991). Positioning Nodes for General Trees. https://www.drdobbs.com/positioning-nodes-for-general-trees/184402320?pgno=4</li> <li>[2] Reingold, E., Tilford, J. (1981). Tidier Drawings of Trees. IEEE Transactions on Software Engineering. https://reingold.co/tidier-drawings.pdf</li> </ul> <p>Parameters:</p> Name Type Description Default <code>tree_node</code> <code>BaseNode</code> <p>tree to compute (x, y) coordinate</p> required <code>sibling_separation</code> <code>float</code> <p>minimum distance between adjacent siblings of the tree</p> <code>1.0</code> <code>subtree_separation</code> <code>float</code> <p>minimum distance between adjacent subtrees of the tree</p> <code>1.0</code> <code>level_separation</code> <code>float</code> <p>fixed distance between adjacent levels of the tree</p> <code>1.0</code> <code>x_offset</code> <code>float</code> <p>graph offset of x-coordinates</p> <code>0.0</code> <code>y_offset</code> <code>float</code> <p>graph offset of y-coordinates</p> <code>0.0</code>"},{"location":"bigtree/workflows/","title":"\ud83d\udc77 Workflows","text":""},{"location":"bigtree/workflows/app_calendar/","title":"\ud83d\udcc6 Calendar App","text":""},{"location":"bigtree/workflows/app_calendar/#bigtree.workflows.app_calendar","title":"bigtree.workflows.app_calendar","text":""},{"location":"bigtree/workflows/app_calendar/#bigtree.workflows.app_calendar.Calendar","title":"Calendar","text":"<pre><code>Calendar(name)\n</code></pre> <p>Calendar Implementation with Big Tree.   - Calendar has four levels - year, month, day, and event name (with event attributes)</p> <p>Examples:</p> <p>Initializing and Adding Events</p> <pre><code>&gt;&gt;&gt; from bigtree import Calendar\n&gt;&gt;&gt; calendar = Calendar(\"My Calendar\")\n&gt;&gt;&gt; calendar.add_event(\"Gym\", \"2023-01-01 18:00\")\n&gt;&gt;&gt; calendar.add_event(\"Dinner\", \"2023-01-01\", date_format=\"%Y-%m-%d\", budget=20)\n&gt;&gt;&gt; calendar.add_event(\"Gym\", \"2023-01-02 18:00\")\n&gt;&gt;&gt; calendar.show()\nMy Calendar\n2023-01-01 00:00:00 - Dinner (budget: 20)\n2023-01-01 18:00:00 - Gym\n2023-01-02 18:00:00 - Gym\n</code></pre> <p>Search for Events</p> <pre><code>&gt;&gt;&gt; calendar.find_event(\"Gym\")\n2023-01-01 18:00:00 - Gym\n2023-01-02 18:00:00 - Gym\n</code></pre> <p>Removing Events</p> <pre><code>&gt;&gt;&gt; import datetime as dt\n&gt;&gt;&gt; calendar.delete_event(\"Gym\", dt.date(2023, 1, 1))\n&gt;&gt;&gt; calendar.show()\nMy Calendar\n2023-01-01 00:00:00 - Dinner (budget: 20)\n2023-01-02 18:00:00 - Gym\n</code></pre> <p>Export Calendar</p> <pre><code>&gt;&gt;&gt; calendar.to_dataframe()\n                             path    name        date      time  budget\n0  /My Calendar/2023/01/01/Dinner  Dinner  2023-01-01  00:00:00    20.0\n1     /My Calendar/2023/01/02/Gym     Gym  2023-01-02  18:00:00     NaN\n</code></pre>"},{"location":"bigtree/workflows/app_calendar/#bigtree.workflows.app_calendar.Calendar.add_event","title":"add_event","text":"<pre><code>add_event(\n    event_name,\n    event_datetime,\n    date_format=\"%Y-%m-%d %H:%M\",\n    **kwargs\n)\n</code></pre> <p>Add event to calendar</p> <p>Parameters:</p> Name Type Description Default <code>event_name</code> <code>str</code> <p>event name to be added</p> required <code>event_datetime</code> <code>Union[str, datetime]</code> <p>event date and time</p> required <code>date_format</code> <code>str</code> <p>specify datetime format if event_datetime is str</p> <code>'%Y-%m-%d %H:%M'</code>"},{"location":"bigtree/workflows/app_calendar/#bigtree.workflows.app_calendar.Calendar.delete_event","title":"delete_event","text":"<pre><code>delete_event(event_name, event_date=None)\n</code></pre> <p>Delete event from calendar</p> <p>Parameters:</p> Name Type Description Default <code>event_name</code> <code>str</code> <p>event name to be deleted</p> required <code>event_date</code> <code>date</code> <p>event date to be deleted</p> <code>None</code>"},{"location":"bigtree/workflows/app_calendar/#bigtree.workflows.app_calendar.Calendar.find_event","title":"find_event","text":"<pre><code>find_event(event_name)\n</code></pre> <p>Find event by name, prints result to console</p> <p>Parameters:</p> Name Type Description Default <code>event_name</code> <code>str</code> <p>event name</p> required"},{"location":"bigtree/workflows/app_calendar/#bigtree.workflows.app_calendar.Calendar.show","title":"show","text":"<pre><code>show()\n</code></pre> <p>Show calendar, prints result to console</p>"},{"location":"bigtree/workflows/app_calendar/#bigtree.workflows.app_calendar.Calendar.to_dataframe","title":"to_dataframe","text":"<pre><code>to_dataframe()\n</code></pre> <p>Export calendar to DataFrame</p> <p>Returns:</p> Type Description <code>DataFrame</code> <p>(pd.DataFrame)</p>"},{"location":"bigtree/workflows/app_todo/","title":"\u2714\ufe0f To Do App","text":""},{"location":"bigtree/workflows/app_todo/#bigtree.workflows.app_todo","title":"bigtree.workflows.app_todo","text":""},{"location":"bigtree/workflows/app_todo/#bigtree.workflows.app_todo.AppToDo","title":"AppToDo","text":"<pre><code>AppToDo(app_name='')\n</code></pre> <p>To-Do List Implementation with Big Tree.   - To-Do List has three levels - app name, list name, and item name.   - If list name is not given, item will be assigned to a <code>General</code> list.</p> <p>Examples:</p> <p>Initializing and Adding Items</p> <pre><code>&gt;&gt;&gt; from bigtree import AppToDo\n&gt;&gt;&gt; app = AppToDo(\"To Do App\")\n&gt;&gt;&gt; app.add_item(item_name=\"Homework 1\", list_name=\"School\")\n&gt;&gt;&gt; app.add_item(item_name=[\"Milk\", \"Bread\"], list_name=\"Groceries\", description=\"Urgent\")\n&gt;&gt;&gt; app.add_item(item_name=\"Cook\")\n&gt;&gt;&gt; app.show()\nTo Do App\n\u251c\u2500\u2500 School\n\u2502   \u2514\u2500\u2500 Homework 1\n\u251c\u2500\u2500 Groceries\n\u2502   \u251c\u2500\u2500 Milk [description=Urgent]\n\u2502   \u2514\u2500\u2500 Bread [description=Urgent]\n\u2514\u2500\u2500 General\n    \u2514\u2500\u2500 Cook\n</code></pre> <p>Reorder List and Item</p> <pre><code>&gt;&gt;&gt; app.prioritize_list(list_name=\"General\")\n&gt;&gt;&gt; app.show()\nTo Do App\n\u251c\u2500\u2500 General\n\u2502   \u2514\u2500\u2500 Cook\n\u251c\u2500\u2500 School\n\u2502   \u2514\u2500\u2500 Homework 1\n\u2514\u2500\u2500 Groceries\n    \u251c\u2500\u2500 Milk [description=Urgent]\n    \u2514\u2500\u2500 Bread [description=Urgent]\n</code></pre> <pre><code>&gt;&gt;&gt; app.prioritize_item(item_name=\"Bread\")\n&gt;&gt;&gt; app.show()\nTo Do App\n\u251c\u2500\u2500 General\n\u2502   \u2514\u2500\u2500 Cook\n\u251c\u2500\u2500 School\n\u2502   \u2514\u2500\u2500 Homework 1\n\u2514\u2500\u2500 Groceries\n    \u251c\u2500\u2500 Bread [description=Urgent]\n    \u2514\u2500\u2500 Milk [description=Urgent]\n</code></pre> <p>Removing Items</p> <pre><code>&gt;&gt;&gt; app.remove_item(\"Homework 1\")\n&gt;&gt;&gt; app.show()\nTo Do App\n\u251c\u2500\u2500 General\n\u2502   \u2514\u2500\u2500 Cook\n\u2514\u2500\u2500 Groceries\n    \u251c\u2500\u2500 Bread [description=Urgent]\n    \u2514\u2500\u2500 Milk [description=Urgent]\n</code></pre> <p>Exporting and Importing List</p> <pre><code>&gt;&gt;&gt; app.save(\"assets/docstr/list.json\")\n&gt;&gt;&gt; app2 = AppToDo.load(\"assets/docstr/list.json\")\n&gt;&gt;&gt; app2.show()\nTo Do App\n\u251c\u2500\u2500 General\n\u2502   \u2514\u2500\u2500 Cook\n\u2514\u2500\u2500 Groceries\n    \u251c\u2500\u2500 Bread [description=Urgent]\n    \u2514\u2500\u2500 Milk [description=Urgent]\n</code></pre> <p>Initialize To-Do app</p> <p>Parameters:</p> Name Type Description Default <code>app_name</code> <code>str</code> <p>name of to-do app, optional</p> <code>''</code>"},{"location":"bigtree/workflows/app_todo/#bigtree.workflows.app_todo.AppToDo.add_list","title":"add_list","text":"<pre><code>add_list(list_name, **kwargs)\n</code></pre> <p>Add list to app</p> <p>If list is present, return list node, else a new list will be created</p> <p>Parameters:</p> Name Type Description Default <code>list_name</code> <code>str</code> <p>name of list</p> required <p>Returns:</p> Type Description <code>Node</code> <p>(Node)</p>"},{"location":"bigtree/workflows/app_todo/#bigtree.workflows.app_todo.AppToDo.prioritize_list","title":"prioritize_list","text":"<pre><code>prioritize_list(list_name)\n</code></pre> <p>Prioritize list in app, shift it to be the first list</p> <p>Parameters:</p> Name Type Description Default <code>list_name</code> <code>str</code> <p>name of list</p> required"},{"location":"bigtree/workflows/app_todo/#bigtree.workflows.app_todo.AppToDo.add_item","title":"add_item","text":"<pre><code>add_item(item_name, list_name='', **kwargs)\n</code></pre> <p>Add items to list</p> <p>Parameters:</p> Name Type Description Default <code>item_name</code> <code>str / List[str]</code> <p>items to be added</p> required <code>list_name</code> <code>str</code> <p>list to add items to, optional</p> <code>''</code>"},{"location":"bigtree/workflows/app_todo/#bigtree.workflows.app_todo.AppToDo.remove_item","title":"remove_item","text":"<pre><code>remove_item(item_name, list_name='')\n</code></pre> <p>Remove items from list</p> <p>Parameters:</p> Name Type Description Default <code>item_name</code> <code>str / List[str]</code> <p>items to be added</p> required <code>list_name</code> <code>str</code> <p>list to add items to, optional</p> <code>''</code>"},{"location":"bigtree/workflows/app_todo/#bigtree.workflows.app_todo.AppToDo.prioritize_item","title":"prioritize_item","text":"<pre><code>prioritize_item(item_name)\n</code></pre> <p>Prioritize item in list, shift it to be the first item in list</p> <p>Parameters:</p> Name Type Description Default <code>item_name</code> <code>str</code> <p>name of item</p> required"},{"location":"bigtree/workflows/app_todo/#bigtree.workflows.app_todo.AppToDo.show","title":"show","text":"<pre><code>show(**kwargs)\n</code></pre> <p>Print tree to console</p>"},{"location":"bigtree/workflows/app_todo/#bigtree.workflows.app_todo.AppToDo.load","title":"load  <code>staticmethod</code>","text":"<pre><code>load(json_path)\n</code></pre> <p>Load To-Do app from json</p> <p>Parameters:</p> Name Type Description Default <code>json_path</code> <code>str</code> <p>json load path</p> required <p>Returns:</p> Type Description <code>AppToDo</code> <p>(Self)</p>"},{"location":"bigtree/workflows/app_todo/#bigtree.workflows.app_todo.AppToDo.save","title":"save","text":"<pre><code>save(json_path)\n</code></pre> <p>Save To-Do app as json</p> <p>Parameters:</p> Name Type Description Default <code>json_path</code> <code>str</code> <p>json save path</p> required"},{"location":"demo/binarytree/","title":"\ud83d\udccb Binary Tree Demonstration","text":"<p>Compared to nodes in tree, nodes in Binary Tree are only allowed maximum of 2 children. Since BinaryNode extends from Node, construct, traverse, search, export methods from Node are applicable to Binary Tree as well.</p>"},{"location":"demo/binarytree/#construct-binary-tree","title":"Construct Binary Tree","text":""},{"location":"demo/binarytree/#1-from-binarynode","title":"1. From BinaryNode","text":"<p>BinaryNode can be linked to each other with <code>parent</code>, <code>children</code>, <code>left</code>, and <code>right</code> setter methods, or using bitshift operator with the convention <code>parent_node &gt;&gt; child_node</code> or <code>child_node &lt;&lt; parent_node</code>.</p> <pre><code>from bigtree import BinaryNode, tree_to_dot\n\ne = BinaryNode(5)\nd = BinaryNode(4)\nc = BinaryNode(3)\nb = BinaryNode(2, left=d, right=e)\na = BinaryNode(1, children=[b, c])\nf = BinaryNode(6, parent=c)\ng = BinaryNode(7, parent=c)\nh = BinaryNode(8, parent=d)\n\ngraph = tree_to_dot(a, node_colour=\"gold\")\ngraph.write_png(\"assets/demo/binarytree.png\")\n</code></pre> <p></p>"},{"location":"demo/binarytree/#2-from-list","title":"2. From list","text":"<p>Construct nodes only, list has similar format as <code>heapq</code> list.</p> <pre><code>from bigtree import list_to_binarytree\n\nnums_list = [1, 2, 3, 4, 5, 6, 7, 8]\nroot = list_to_binarytree(nums_list)\nroot.show()\n# 1\n# \u251c\u2500\u2500 2\n# \u2502   \u251c\u2500\u2500 4\n# \u2502   \u2502   \u2514\u2500\u2500 8\n# \u2502   \u2514\u2500\u2500 5\n# \u2514\u2500\u2500 3\n#     \u251c\u2500\u2500 6\n#     \u2514\u2500\u2500 7\n</code></pre>"},{"location":"demo/binarytree/#traverse-binary-tree","title":"Traverse Binary Tree","text":"<p>In addition to the traversal methods in the usual tree, binary tree includes in-order traversal method.</p> <pre><code>from bigtree import (\n    inorder_iter,\n    levelorder_iter,\n    levelordergroup_iter,\n    list_to_binarytree,\n    postorder_iter,\n    preorder_iter,\n    zigzag_iter,\n    zigzaggroup_iter,\n)\n\nnums_list = [1, 2, 3, 4, 5, 6, 7, 8]\nroot = list_to_binarytree(nums_list)\nroot.show()\n# 1\n# \u251c\u2500\u2500 2\n# \u2502   \u251c\u2500\u2500 4\n# \u2502   \u2502   \u2514\u2500\u2500 8\n# \u2502   \u2514\u2500\u2500 5\n# \u2514\u2500\u2500 3\n#     \u251c\u2500\u2500 6\n#     \u2514\u2500\u2500 7\n\n[node.name for node in inorder_iter(root)]\n# ['8', '4', '2', '5', '1', '6', '3', '7']\n\n[node.name for node in preorder_iter(root)]\n# ['1', '2', '4', '8', '5', '3', '6', '7']\n\n[node.name for node in postorder_iter(root)]\n# ['8', '4', '5', '2', '6', '7', '3', '1']\n\n[node.name for node in levelorder_iter(root)]\n# ['1', '2', '3', '4', '5', '6', '7', '8']\n\n[[node.name for node in node_group] for node_group in levelordergroup_iter(root)]\n# [['1'], ['2', '3'], ['4', '5', '6', '7'], ['8']]\n\n[node.name for node in zigzag_iter(root)]\n# ['1', '3', '2', '4', '5', '6', '7', '8']\n\n[[node.name for node in node_group] for node_group in zigzaggroup_iter(root)]\n# [['1'], ['3', '2'], ['4', '5', '6', '7'], ['8']]\n</code></pre>"},{"location":"demo/dag/","title":"\ud83d\udccb DAG Demonstration","text":"<p>Compared to nodes in tree, nodes in DAG are able to have multiple parents.</p>"},{"location":"demo/dag/#construct-dag","title":"Construct DAG","text":""},{"location":"demo/dag/#1-from-dagnode","title":"1. From DAGNode","text":"<p>DAGNodes can be linked to each other in the following ways:</p> <ul> <li>Using <code>parents</code> and <code>children</code> setter methods</li> <li>Directly passing <code>parents</code> or <code>children</code> argument</li> <li>Using bitshift operator with the convention <code>parent_node &gt;&gt; child_node</code> or <code>child_node &lt;&lt; parent_node</code></li> </ul> <pre><code>from bigtree import DAGNode, dag_to_dot\n\na = DAGNode(\"a\")\nb = DAGNode(\"b\")\nc = DAGNode(\"c\", parents=[a, b])\nd = DAGNode(\"d\", parents=[a, c])\ne = DAGNode(\"e\", parents=[d])\nf = DAGNode(\"f\", parents=[c, d])\nh = DAGNode(\"h\")\ng = DAGNode(\"g\", parents=[c], children=[h])\n\ngraph = dag_to_dot(a, node_colour=\"gold\")\ngraph.write_png(\"assets/demo/dag.png\")\n</code></pre> <p></p>"},{"location":"demo/dag/#2-from-list","title":"2. From list","text":"<p>Construct nodes only, list contains parent-child tuples.</p> <pre><code>from bigtree import list_to_dag, dag_iterator\n\nrelations_list = [(\"a\", \"c\"), (\"a\", \"d\"), (\"b\", \"c\"), (\"c\", \"d\"), (\"d\", \"e\")]\ndag = list_to_dag(relations_list)\n\nprint([(parent.node_name, child.node_name) for parent, child in dag_iterator(dag)])\n# [('a', 'd'), ('c', 'd'), ('d', 'e'), ('a', 'c'), ('b', 'c')]\n</code></pre>"},{"location":"demo/dag/#3-from-nested-dictionary","title":"3. From nested dictionary","text":"<p>Construct nodes with attributes, <code>key</code>: child name, <code>value</code>: dict of parent name, child node attributes.</p> <pre><code>from bigtree import dict_to_dag, dag_iterator\n\nrelation_dict = {\n    \"a\": {\"step\": 1},\n    \"b\": {\"step\": 1},\n    \"c\": {\"parents\": [\"a\", \"b\"], \"step\": 2},\n    \"d\": {\"parents\": [\"a\", \"c\"], \"step\": 2},\n    \"e\": {\"parents\": [\"d\"], \"step\": 3},\n}\ndag = dict_to_dag(relation_dict, parent_key=\"parents\")\n\nprint([(parent.node_name, child.node_name) for parent, child in dag_iterator(dag)])\n# [('a', 'd'), ('c', 'd'), ('d', 'e'), ('a', 'c'), ('b', 'c')]\n</code></pre>"},{"location":"demo/dag/#4-from-pandas-dataframe","title":"4. From pandas DataFrame","text":"<p>Construct nodes with attributes, pandas DataFrame contains child column, parent column, and attribute columns.</p> <pre><code>import pandas as pd\nfrom bigtree import dataframe_to_dag, dag_iterator\n\npath_data = pd.DataFrame(\n    [\n        [\"a\", None, 1],\n        [\"b\", None, 1],\n        [\"c\", \"a\", 2],\n        [\"c\", \"b\", 2],\n        [\"d\", \"a\", 2],\n        [\"d\", \"c\", 2],\n        [\"e\", \"d\", 3],\n    ],\n    columns=[\"child\", \"parent\", \"step\"],\n)\ndag = dataframe_to_dag(path_data)\n\nprint([(parent.node_name, child.node_name) for parent, child in dag_iterator(dag)])\n# [('a', 'd'), ('c', 'd'), ('d', 'e'), ('a', 'c'), ('b', 'c')]\n</code></pre>"},{"location":"demo/dag/#dag-attributes-and-operations","title":"DAG Attributes and Operations","text":"<p>Note that using <code>DAGNode</code> as superclass inherits the default class attributes (properties) and operations (methods).</p> <pre><code>from bigtree import list_to_dag\n\nrelations_list = [(\"a\", \"c\"), (\"a\", \"d\"), (\"b\", \"c\"), (\"c\", \"d\"), (\"d\", \"e\")]\ndag = list_to_dag(relations_list)\ndag\n# DAGNode(d, )\n\n# Accessing children\nnode_e = dag[\"e\"]\nnode_a = dag.parents[0]\n</code></pre> <p>Below are the tables of attributes available to <code>DAGNode</code> class.</p> Attributes wrt self Code Returns Check if root <code>node_a.is_root</code> True Check if leaf node <code>dag.is_leaf</code> False Get node name (only for <code>Node</code>) <code>dag.node_name</code> 'd' Attributes wrt structure Code Returns Get child/children <code>node_a.children</code> (DAGNode(c, ), DAGNode(d, )) Get parents <code>dag.parents</code> (DAGNode(a, ), DAGNode(c, )) Get siblings <code>dag.siblings</code> (DAGNode(c, ),) Get ancestors <code>dag.ancestors</code> [DAGNode(a, ), DAGNode(b, ), DAGNode(c, )] Get descendants <code>dag.descendants</code> [DAGNode(e, )] <p>Below is the table of operations available to <code>DAGNode</code> class.</p> Operations Code Returns Get node information <code>dag.describe(exclude_prefix=\"_\")</code> [('name', 'd')] Find path(s) from one node to another <code>node_a.go_to(dag)</code> [[DAGNode(a, ), DAGNode(c, ), DAGNode(d, description=dag-tag)], [DAGNode(a, ), DAGNode(d, description=dag-tag)]] Set attribute(s) <code>dag.set_attrs({\"description\": \"dag-tag\"})</code> None Get attribute <code>dag.get_attr(\"description\")</code> 'dag-tag' Copy DAG <code>dag.copy()</code> None"},{"location":"demo/tree/","title":"\ud83d\udccb Tree Demonstration","text":"<p>Here are some codes to get started.</p>"},{"location":"demo/tree/#construct-tree","title":"Construct Tree","text":"<p>Nodes can have attributes if they are initialized from <code>Node</code>, dictionary, pandas DataFrame, or polars DataFrame.</p>"},{"location":"demo/tree/#1-from-node","title":"1. From Node","text":"<p>Nodes can be linked to each other in the following ways:</p> <ul> <li>Using <code>parent</code> and <code>children</code> setter methods</li> <li>Directly passing <code>parent</code> or <code>children</code> argument</li> <li>Using bitshift operator with the convention <code>parent &gt;&gt; child</code> or <code>child &lt;&lt; parent</code></li> <li>Using <code>.append(child)</code> or <code>.extend([child1, child2])</code> methods</li> </ul> <code>parent</code> and <code>children</code> setter methods<code>parent</code> or <code>children</code> argumentBitshift operator<code>append</code> and <code>extend</code> <pre><code>from bigtree import Node, tree_to_dot\n\nroot = Node(\"a\")\nb = Node(\"b\")\nc = Node(\"c\")\nd = Node(\"d\")\n\nroot.children = [b, c]\nd.parent = b\n\nroot.show()\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u2514\u2500\u2500 d\n# \u2514\u2500\u2500 c\n\nroot.hshow()\n#      \u250c\u2500 b \u2500\u2500\u2500 d\n# \u2500 a \u2500\u2524\n#      \u2514\u2500 c\n\ngraph = tree_to_dot(root, node_colour=\"gold\")\ngraph.write_png(\"assets/demo/tree.png\")\n</code></pre> <pre><code>from bigtree import Node\n\nb = Node(\"b\")\nc = Node(\"c\")\nd = Node(\"d\", parent=b)\nroot = Node(\"a\", children=[b, c])\n</code></pre> <pre><code>from bigtree import Node\n\nroot = Node(\"a\")\nb = Node(\"b\")\nc = Node(\"c\")\nd = Node(\"d\")\n\nroot &gt;&gt; b\nroot &gt;&gt; c\nd &lt;&lt; b\n</code></pre> <pre><code>from bigtree import Node\n\nroot = Node(\"a\")\nb = Node(\"b\")\nc = Node(\"c\")\nd = Node(\"d\")\n\nroot.extend([b, c])\nb.append(d)\n</code></pre> <p></p>"},{"location":"demo/tree/#2-from-str","title":"2. From str","text":"<p>Construct nodes only. Newick string notation supports parsing attributes.</p> Tree stringNewick string <pre><code>from bigtree import str_to_tree\n\ntree_str = \"\"\"\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2502       \u251c\u2500\u2500 g\n\u2502       \u2514\u2500\u2500 h\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n\"\"\"\nroot = str_to_tree(tree_str)\n\nroot.show()\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u251c\u2500\u2500 d\n# \u2502   \u2514\u2500\u2500 e\n# \u2502       \u251c\u2500\u2500 g\n# \u2502       \u2514\u2500\u2500 h\n# \u2514\u2500\u2500 c\n#     \u2514\u2500\u2500 f\n</code></pre> <pre><code>from bigtree import newick_to_tree\n\nnewick_str = \"((d,(g,h)e)b,(f)c)a\"\nroot = newick_to_tree(newick_str)\n\nroot.show()\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u251c\u2500\u2500 d\n# \u2502   \u2514\u2500\u2500 e\n# \u2502       \u251c\u2500\u2500 g\n# \u2502       \u2514\u2500\u2500 h\n# \u2514\u2500\u2500 c\n#     \u2514\u2500\u2500 f\n</code></pre>"},{"location":"demo/tree/#3-from-list","title":"3. From list","text":"<p>Construct nodes only. List can contain either full paths or tuples of parent-child names.</p> Full pathsParent-child names <pre><code>from bigtree import list_to_tree\n\nroot = list_to_tree([\"a/b/d\", \"a/c\"])\n\nroot.show()\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u2514\u2500\u2500 d\n# \u2514\u2500\u2500 c\n</code></pre> <pre><code>from bigtree import list_to_tree_by_relation\n\nroot = list_to_tree_by_relation([(\"a\", \"b\"), (\"a\", \"c\"), (\"b\", \"d\")])\n\nroot.show()\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u2514\u2500\u2500 d\n# \u2514\u2500\u2500 c\n</code></pre>"},{"location":"demo/tree/#4-from-nested-dictionary","title":"4. From nested dictionary","text":"<p>Construct nodes with attributes. Dictionary can be in a flat structure where <code>key</code> is path and <code>value</code> is dictionary of node attribute names and values, or in a recursive structure where <code>key</code> is node attribute names and <code>value</code> is node attribute values, and list of children (recursive).</p> Flat structureRecursive structure <pre><code>from bigtree import dict_to_tree\n\npath_dict = {\n   \"a\": {\"age\": 90},\n   \"a/b\": {\"age\": 65},\n   \"a/c\": {\"age\": 60},\n   \"a/b/d\": {\"age\": 40},\n}\nroot = dict_to_tree(path_dict)\n\nroot.show(attr_list=[\"age\"])\n# a [age=90]\n# \u251c\u2500\u2500 b [age=65]\n# \u2502   \u2514\u2500\u2500 d [age=40]\n# \u2514\u2500\u2500 c [age=60]\n</code></pre> <pre><code>from bigtree import nested_dict_to_tree\n\npath_dict = {\n   \"name\": \"a\",\n   \"age\": 90,\n   \"children\": [\n      {\n         \"name\": \"b\",\n         \"age\": 65,\n         \"children\": [\n            {\"name\": \"d\", \"age\": 40},\n         ],\n      },\n      {\"name\": \"c\", \"age\": 60},\n   ],\n}\nroot = nested_dict_to_tree(path_dict)\n\nroot.show(attr_list=[\"age\"])\n# a [age=90]\n# \u251c\u2500\u2500 b [age=65]\n# \u2502   \u2514\u2500\u2500 d [age=40]\n# \u2514\u2500\u2500 c [age=60]\n</code></pre>"},{"location":"demo/tree/#5-from-pandas-dataframe","title":"5. From pandas DataFrame","text":"<p>Construct nodes with attributes. Pandas DataFrame can contain either path column or parent-child columns. Other columns can be used to specify attributes.</p> Path columnParent-child columns <pre><code>import pandas as pd\n\nfrom bigtree import dataframe_to_tree\n\ndata = pd.DataFrame(\n   [\n      [\"a\", 90],\n      [\"a/b\", 65],\n      [\"a/c\", 60],\n      [\"a/b/d\", 40],\n   ],\n   columns=[\"path\", \"age\"],\n)\nroot = dataframe_to_tree(data)\n\nroot.show(attr_list=[\"age\"])\n# a [age=90]\n# \u251c\u2500\u2500 b [age=65]\n# \u2502   \u2514\u2500\u2500 d [age=40]\n# \u2514\u2500\u2500 c [age=60]\n</code></pre> <pre><code>import pandas as pd\n\nfrom bigtree import dataframe_to_tree_by_relation\n\ndata = pd.DataFrame(\n   [\n      [\"a\", None, 90],\n      [\"b\", \"a\", 65],\n      [\"c\", \"a\", 60],\n      [\"d\", \"b\", 40],\n   ],\n   columns=[\"child\", \"parent\", \"age\"],\n)\nroot = dataframe_to_tree_by_relation(data)\n\nroot.show(attr_list=[\"age\"])\n# a [age=90]\n# \u251c\u2500\u2500 b [age=65]\n# \u2502   \u2514\u2500\u2500 d [age=40]\n# \u2514\u2500\u2500 c [age=60]\n</code></pre>"},{"location":"demo/tree/#6-from-polars-dataframe","title":"6. From polars DataFrame","text":"<p>Construct nodes with attributes. Polars DataFrame can contain either path column or parent-child columns. Other columns can be used to specify attributes.</p> Path columnParent-child columns <pre><code>import polars as pl\n\nfrom bigtree import polars_to_tree\n\ndata = pl.DataFrame(\n   [\n      [\"a\", 90],\n      [\"a/b\", 65],\n      [\"a/c\", 60],\n      [\"a/b/d\", 40],\n   ],\n   schema=[\"path\", \"age\"],\n)\nroot = polars_to_tree(data)\n\nroot.show(attr_list=[\"age\"])\n# a [age=90]\n# \u251c\u2500\u2500 b [age=65]\n# \u2502   \u2514\u2500\u2500 d [age=40]\n# \u2514\u2500\u2500 c [age=60]\n</code></pre> <pre><code>import polars as pl\n\nfrom bigtree import polars_to_tree_by_relation\n\ndata = pl.DataFrame(\n   [\n      [\"a\", None, 90],\n      [\"b\", \"a\", 65],\n      [\"c\", \"a\", 60],\n      [\"d\", \"b\", 40],\n   ],\n   schema=[\"child\", \"parent\", \"age\"],\n)\nroot = polars_to_tree_by_relation(data)\n\nroot.show(attr_list=[\"age\"])\n# a [age=90]\n# \u251c\u2500\u2500 b [age=65]\n# \u2502   \u2514\u2500\u2500 d [age=40]\n# \u2514\u2500\u2500 c [age=60]\n</code></pre> <p>Note</p> <p>If tree is already created, nodes can still be added using path string, dictionary, and pandas/polars DataFrame! Attributes can be added to existing nodes using a dictionary or pandas/polars DataFrame.</p>"},{"location":"demo/tree/#print-tree","title":"Print Tree","text":"<p>After tree is constructed, it can be viewed by printing to console using <code>show</code> or <code>hshow</code> method directly, for vertical and horizontal orientation respectively. Alternatively, the <code>print_tree</code> or <code>hprint_tree</code> method can be used.</p> <pre><code>from bigtree import Node, print_tree, hprint_tree\n\nroot = Node(\"a\", age=90, gender=\"F\")\nb = Node(\"b\", age=65, gender=\"M\", parent=root)\nc = Node(\"c\", age=60, gender=\"M\", parent=root)\nd = Node(\"d\", age=40, gender=\"F\", parent=b)\ne = Node(\"e\", age=35, gender=\"M\", parent=b)\nprint_tree(root) # (1)!\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u251c\u2500\u2500 d\n# \u2502   \u2514\u2500\u2500 e\n# \u2514\u2500\u2500 c\n\nhprint_tree(root) # (2)!\n#            \u250c\u2500 d\n#      \u250c\u2500 b \u2500\u2524\n# \u2500 a \u2500\u2524     \u2514\u2500 e\n#      \u2514\u2500 c\n\n# Print subtree\nprint_tree(root, node_name_or_path=\"b\")\n# b\n# \u251c\u2500\u2500 d\n# \u2514\u2500\u2500 e\n\nprint_tree(root, max_depth=2)\n# a\n# \u251c\u2500\u2500 b\n# \u2514\u2500\u2500 c\n\n# Print attributes\nprint_tree(root, attr_list=[\"age\"])\n# a [age=90]\n# \u251c\u2500\u2500 b [age=65]\n# \u2502   \u251c\u2500\u2500 d [age=40]\n# \u2502   \u2514\u2500\u2500 e [age=35]\n# \u2514\u2500\u2500 c [age=60]\n\nprint_tree(root, attr_list=[\"age\"], attr_bracket=[\"*(\", \")\"])\n# a *(age=90)\n# \u251c\u2500\u2500 b *(age=65)\n# \u2502   \u251c\u2500\u2500 d *(age=40)\n# \u2502   \u2514\u2500\u2500 e *(age=35)\n# \u2514\u2500\u2500 c *(age=60)\n\nprint_tree(root, all_attrs=True)\n# a [age=90, gender=F]\n# \u251c\u2500\u2500 b [age=65, gender=M]\n# \u2502   \u251c\u2500\u2500 d [age=40, gender=F]\n# \u2502   \u2514\u2500\u2500 e [age=35, gender=M]\n# \u2514\u2500\u2500 c [age=60, gender=M]\n\n# Available styles\nprint_tree(root, style=\"ansi\")\n# a\n# |-- b\n# |   |-- d\n# |   `-- e\n# `-- c\n\nprint_tree(root, style=\"ascii\")\n# a\n# |-- b\n# |   |-- d\n# |   +-- e\n# +-- c\n\nprint_tree(root, style=\"const\")\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u251c\u2500\u2500 d\n# \u2502   \u2514\u2500\u2500 e\n# \u2514\u2500\u2500 c\n\nprint_tree(root, style=\"const_bold\")\n# a\n# \u2523\u2501\u2501 b\n# \u2503   \u2523\u2501\u2501 d\n# \u2503   \u2517\u2501\u2501 e\n# \u2517\u2501\u2501 c\n\nprint_tree(root, style=\"rounded\")\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u251c\u2500\u2500 d\n# \u2502   \u2570\u2500\u2500 e\n# \u2570\u2500\u2500 c\n\nprint_tree(root, style=\"double\")\n# a\n# \u2560\u2550\u2550 b\n# \u2551   \u2560\u2550\u2550 d\n# \u2551   \u255a\u2550\u2550 e\n# \u255a\u2550\u2550 c\n\nprint_tree(\n    root,\n    style=\"custom\",\n    custom_style=(\"\u2502  \", \"\u251c\u2192 \", \"\u2570\u2192 \"),\n)\n# a\n# \u251c\u2192 b\n# \u2502  \u251c\u2192 d\n# \u2502  \u2570\u2192 e\n# \u2570\u2192 c\n</code></pre> <ol> <li>Alternatively, <code>root.show()</code> can be used</li> <li>Alternatively, <code>root.hshow()</code> can be used</li> </ol>"},{"location":"demo/tree/#tree-attributes-and-operations","title":"Tree Attributes and Operations","text":"<p>Note that using <code>BaseNode</code> or <code>Node</code> as superclass inherits the default class attributes (properties) and operations (methods).</p> <pre><code>from bigtree import str_to_tree\n\n# Initialize tree\ntree_str = \"\"\"\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u251c\u2500\u2500 e\n\u2502   \u2514\u2500\u2500 f\n\u2502       \u251c\u2500\u2500 h\n\u2502       \u2514\u2500\u2500 i\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 g\n\"\"\"\nroot = str_to_tree(tree_str)\n\n# Accessing children\nnode_b = root[\"b\"]\nnode_e = root[\"b\"][\"e\"]\n</code></pre> <p>Below are the tables of attributes available to <code>BaseNode</code> and <code>Node</code> classes.</p> Attributes wrt self Code Returns Check if root <code>root.is_root</code> True Check if leaf node <code>root.is_leaf</code> False Check diameter of tree <code>node_b.diameter</code> 3 Check depth of node <code>node_b.depth</code> 2 Check depth of tree <code>node_b.max_depth</code> 4 Get root of tree <code>node_b.root</code> Node(/a, ) Get node path <code>node_b.node_path</code> (Node(/a, ), Node(/a/b, )) Get node name (only for <code>Node</code>) <code>node_b.node_name</code> 'b' Get node path name (only for <code>Node</code>) <code>node_b.path_name</code> '/a/b' Attributes wrt structure Code Returns Get child/children <code>root.children</code> (Node(/a/b, ), Node(/a/c, )) Get parent <code>node_e.parent</code> Node(/a/b, ) Get siblings <code>node_e.siblings</code> (Node(/a/b/d, ), Node(/a/b/f, )) Get left sibling <code>node_e.left_sibling</code> Node(/a/b/d, ) Get right sibling <code>node_e.right_sibling</code> Node(/a/b/f, ) Get ancestors (lazy evaluation) <code>list(node_e.ancestors)</code> [Node(/a/b, ), Node(/a, )] Get descendants (lazy evaluation) <code>list(node_b.descendants)</code> [Node(/a/b/d, ), Node(/a/b/e, ), Node(/a/b/f, ), Node(/a/b/f/h, ), Node(/a/b/f/i, )] Get leaves (lazy evaluation) <code>list(node_b.leaves)</code> [Node(/a/b/d, ), Node(/a/b/e, ), Node(/a/b/f/h, ), Node(/a/b/f/i, )] <p>Below is the table of operations available to <code>BaseNode</code> and <code>Node</code> classes.</p> Operations Code Returns Visualize tree (only for <code>Node</code>) <code>root.show()</code> None Visualize tree (horizontally) (only for <code>Node</code>) <code>root.hshow()</code> None Get node information <code>root.describe(exclude_prefix=\"_\")</code> [('name', 'a')] Find path from one node to another <code>root.go_to(node_e)</code> [Node(/a, ), Node(/a/b, ), Node(/a/b/e, )] Add child to node <code>root.append(Node(\"j\"))</code> None Add multiple children to node <code>root.extend([Node(\"k\"), Node(\"l\")])</code> None Set attribute(s) <code>root.set_attrs({\"description\": \"root-tag\"})</code> None Get attribute <code>root.get_attr(\"description\")</code> 'root-tag' Copy tree <code>root.copy()</code> None Sort children <code>root.sort(key=lambda node: node.node_name, reverse=True)</code> None"},{"location":"demo/tree/#traverse-tree","title":"Traverse Tree","text":"<p>Tree can be traversed using the following traversal methods.</p> <pre><code>from bigtree import (\n    Node,\n    levelorder_iter,\n    levelordergroup_iter,\n    postorder_iter,\n    preorder_iter,\n    zigzag_iter,\n    zigzaggroup_iter,\n)\n\nroot = Node(\"a\")\nb = Node(\"b\", parent=root)\nc = Node(\"c\", parent=root)\nd = Node(\"d\", parent=b)\ne = Node(\"e\", parent=b)\nroot.show()\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u251c\u2500\u2500 d\n# \u2502   \u2514\u2500\u2500 e\n# \u2514\u2500\u2500 c\n\n[node.name for node in preorder_iter(root)]\n# ['a', 'b', 'd', 'e', 'c']\n\n[node.name for node in postorder_iter(root)]\n# ['d', 'e', 'b', 'c', 'a']\n\n[node.name for node in levelorder_iter(root)]\n# ['a', 'b', 'c', 'd', 'e']\n\n[[node.name for node in node_group] for node_group in levelordergroup_iter(root)]\n# [['a'], ['b', 'c'], ['d', 'e']]\n\n[node.name for node in zigzag_iter(root)]\n# ['a', 'c', 'b', 'd', 'e']\n\n[[node.name for node in node_group] for node_group in zigzaggroup_iter(root)]\n# [['a'], ['c', 'b'], ['d', 'e']]\n</code></pre>"},{"location":"demo/tree/#modify-tree","title":"Modify Tree","text":"<p>Nodes can be shifted (with or without replacement) or copied (without replacement) from one path to another, this changes the tree in-place. Nodes can also be copied (with or without replacement) between two different trees.</p> Shift nodes <pre><code>from bigtree import list_to_tree, shift_nodes, shift_and_replace_nodes\n\nroot = list_to_tree(\n    [\"Downloads/Pictures\", \"Downloads/photo1.jpg\", \"Downloads/file1.doc\"]\n)\nroot.show()\n# Downloads\n# \u251c\u2500\u2500 Pictures\n# \u251c\u2500\u2500 photo1.jpg\n# \u2514\u2500\u2500 file1.doc\n\nshift_nodes(\n   tree=root,\n   from_paths=[\"photo1.jpg\", \"Downloads/file1.doc\"],\n   to_paths=[\"Downloads/Pictures/photo1.jpg\", \"Downloads/Files/file1.doc\"],\n)\nroot.show()\n# Downloads\n# \u251c\u2500\u2500 Pictures\n# \u2502   \u2514\u2500\u2500 photo1.jpg (1)\n# \u2514\u2500\u2500 Files\n#     \u2514\u2500\u2500 file1.doc (2)\n\nshift_and_replace_nodes(\n   tree=root,\n   from_paths=[\"Downloads/Files\"],\n   to_paths=[\"Downloads/Pictures/photo1.jpg\"],\n)\nroot.show()\n# Downloads\n# \u2514\u2500\u2500 Pictures\n#     \u2514\u2500\u2500 Files (3)\n#         \u2514\u2500\u2500 file1.doc\n</code></pre> <ol> <li>The first shift to destination <code>Downloads/Pictures/photo1.jpg</code></li> <li>The second shift to destination <code>Downloads/Files/file1.doc</code>, this creates intermediate Node <code>Files</code> as well</li> <li>Shift and replace <code>photo1.jpg</code> with <code>Files</code> folder</li> </ol> Copy nodes <pre><code>from bigtree import list_to_tree, copy_nodes\n\nroot = list_to_tree(\n    [\"Downloads/Pictures\", \"Downloads/photo1.jpg\", \"Downloads/file1.doc\"]\n)\nroot.show()\n# Downloads\n# \u251c\u2500\u2500 Pictures\n# \u251c\u2500\u2500 photo1.jpg\n# \u2514\u2500\u2500 file1.doc\n\ncopy_nodes(\n   tree=root,\n   from_paths=[\"photo1.jpg\", \"Downloads/file1.doc\"],\n   to_paths=[\"Downloads/Pictures/photo1.jpg\", \"Downloads/Files/file1.doc\"],\n)\nroot.show()\n# Downloads\n# \u251c\u2500\u2500 Pictures\n# \u2502   \u2514\u2500\u2500 photo1.jpg (1)\n# \u251c\u2500\u2500 photo1.jpg (2)\n# \u251c\u2500\u2500 file1.doc (4)\n# \u2514\u2500\u2500 Files\n#     \u2514\u2500\u2500 file1.doc (3)\n</code></pre> <ol> <li>The first copy to destination <code>Downloads/Pictures/photo1.jpg</code></li> <li>Original <code>photo1.jpg</code> still remains</li> <li>The second copy to destination <code>Downloads/Files/file1.doc</code>, this creates intermediate Node <code>Files</code> as well</li> <li>Original <code>file1.doc</code> still remains</li> </ol> Copy nodes between two trees <pre><code>from bigtree import (\n    Node,\n    copy_nodes_from_tree_to_tree,\n    copy_and_replace_nodes_from_tree_to_tree,\n    list_to_tree,\n)\n\nroot = list_to_tree(\n    [\"Downloads/Pictures\", \"Downloads/photo1.jpg\", \"Downloads/file1.doc\"]\n)\nroot.show()\n# Downloads\n# \u251c\u2500\u2500 Pictures\n# \u251c\u2500\u2500 photo1.jpg\n# \u2514\u2500\u2500 file1.doc\n\nroot_other = Node(\"Documents\")\ncopy_nodes_from_tree_to_tree(\n    from_tree=root,\n    to_tree=root_other,\n    from_paths=[\"Downloads/Pictures\", \"photo1.jpg\", \"file1.doc\"],\n    to_paths=[\n        \"Documents/Pictures\",\n        \"Documents/Pictures/photo1.jpg\",\n        \"Documents/Files/file1.doc\",\n    ],\n)\nroot_other.show()\n# Documents\n# \u251c\u2500\u2500 Pictures (1)\n# \u2502   \u2514\u2500\u2500 photo1.jpg (2)\n# \u2514\u2500\u2500 Files\n#     \u2514\u2500\u2500 file1.doc (3)\n\nroot_other = Node(\"Documents\")\npicture_folder = Node(\"Pictures\", parent=root_other)\nphoto2 = Node(\"photo2.jpg\", parent=picture_folder)\nfile2 = Node(\"file2.doc\", parent=root_other)\nroot_other.show()\n# Documents\n# \u251c\u2500\u2500 Pictures\n# \u2502   \u2514\u2500\u2500 photo2.jpg\n# \u2514\u2500\u2500 file2.doc\n\ncopy_and_replace_nodes_from_tree_to_tree(\n    from_tree=root,\n    to_tree=root_other,\n    from_paths=[\"Downloads/photo1.jpg\", \"Downloads/file1.doc\"],\n    to_paths=[\"Documents/Pictures/photo2.jpg\", \"Documents/file2.doc\"],\n)\nroot_other.show()\n# Documents\n# \u251c\u2500\u2500 Pictures\n# \u2502   \u2514\u2500\u2500 photo1.jpg (4)\n# \u2514\u2500\u2500 file1.doc (5)\n</code></pre> <ol> <li>The first copy to destination <code>Documents/Pictures</code></li> <li>The second copy to destination <code>Documents/Pictures/photo1.jpg</code></li> <li>The third copy to destination <code>Documents/Files/file1.doc</code>, this creates intermediate Node <code>Files</code> as well</li> <li>The first copy and replace of <code>Documents/Pictures/photo2.jpg</code> with <code>photo1.jpg</code></li> <li>The second copy and replace of <code>Documents/file2.doc</code> with <code>file1.doc</code></li> </ol>"},{"location":"demo/tree/#tree-search","title":"Tree Search","text":"<p>One or multiple nodes can be searched based on name, path, attribute value, or user-defined condition. It is also possible to search for one or more child node(s) based on attributes, this search will be faster as it does not require traversing the whole tree to find the node(s).</p> Find single nodeFind multiple nodesFind child nodes <pre><code>from bigtree import Node, find, find_name, find_path, find_relative_path, find_full_path, find_attr\nroot = Node(\"a\", age=90)\nb = Node(\"b\", age=65, parent=root)\nc = Node(\"c\", age=60, parent=root)\nd = Node(\"d\", age=40, parent=c)\nroot.show(attr_list=[\"age\"])\n# a [age=90]\n# \u251c\u2500\u2500 b [age=65]\n# \u2514\u2500\u2500 c [age=60]\n#     \u2514\u2500\u2500 d [age=40]\n\nfind(root, lambda node: node.age == 60)\n# Node(/a/c, age=60)\n\nfind_name(root, \"d\")\n# Node(/a/c/d, age=40)\n\nfind_relative_path(c, \"../b\")  # relative path\n# (Node(/a/b, age=65),)\n\nfind_path(root, \"/c/d\")  # partial path\n# Node(/a/c/d, age=40)\n\nfind_full_path(root, \"a/c/d\")  # full path\n# Node(/a/c/d, age=40)\n\nfind_attr(root, \"age\", 40)\n# Node(/a/c/d, age=40)\n</code></pre> <pre><code>from bigtree import Node, findall, find_names, find_relative_path, find_paths, find_attrs\nroot = Node(\"a\", age=90)\nb = Node(\"b\", age=65, parent=root)\nc = Node(\"c\", age=60, parent=root)\nd = Node(\"c\", age=40, parent=c)\nroot.show(attr_list=[\"age\"])\n# a [age=90]\n# \u251c\u2500\u2500 b [age=65]\n# \u2514\u2500\u2500 c [age=60]\n#     \u2514\u2500\u2500 c [age=40]\n\nfindall(root, lambda node: node.age &gt;= 65)\n# (Node(/a, age=90), Node(/a/b, age=65))\n\nfind_names(root, \"c\")\n# (Node(/a/c, age=60), Node(/a/c/c, age=40))\n\nfind_relative_path(c, \"../*\")  # relative path\n# (Node(/a/b, age=65), Node(/a/c, age=60))\n\nfind_paths(root, \"/c\")  # partial path\n# (Node(/a/c, age=60), Node(/a/c/c, age=40))\n\nfind_attrs(root, \"age\", 40)\n# (Node(/a/c/c, age=40),)\n</code></pre> <pre><code>from bigtree import Node, find_children, find_child, find_child_by_name\nroot = Node(\"a\", age=90)\nb = Node(\"b\", age=65, parent=root)\nc = Node(\"c\", age=60, parent=root)\nd = Node(\"c\", age=40, parent=c)\nroot.show(attr_list=[\"age\"])\n# a [age=90]\n# \u251c\u2500\u2500 b [age=65]\n# \u2514\u2500\u2500 c [age=60]\n#     \u2514\u2500\u2500 c [age=40]\n\nfind_children(root, lambda node: node.age &gt;= 60)\n# (Node(/a/b, age=65), Node(/a/c, age=60))\n\nfind_child(root, lambda node: node.name == \"c\")\n# Node(/a/c, age=60)\n\nfind_child_by_name(root, \"c\")\n# Node(/a/c, age=60)\n\nfind_child_by_name(c, \"c\")\n# Node(/a/c/c, age=40)\n</code></pre>"},{"location":"demo/tree/#helper-utility","title":"Helper Utility","text":"<p>There following are helper functions for</p>"},{"location":"demo/tree/#1-cloning-tree-to-another-node-type","title":"1. Cloning tree to another Node type","text":"<pre><code>from bigtree import BaseNode, Node, clone_tree\n\n# Cloning tree from `BaseNode` to `Node` type\nroot = BaseNode(name=\"a\")\nb = BaseNode(name=\"b\", parent=root)\nclone_tree(root, Node)\n# Node(/a, )\n</code></pre>"},{"location":"demo/tree/#2-getting-subtree-smaller-tree-with-different-root","title":"2. Getting subtree (smaller tree with different root)","text":"<pre><code>from bigtree import str_to_tree, get_subtree\n\nroot = str_to_tree(\"\"\"\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n\"\"\")\n\n# Getting subtree with root b\nroot_subtree = get_subtree(root, \"b\")\nroot_subtree.show()\n# b\n# \u251c\u2500\u2500 d\n# \u2514\u2500\u2500 e\n</code></pre>"},{"location":"demo/tree/#3-pruning-tree-smaller-tree-with-same-root","title":"3. Pruning tree (smaller tree with same root)","text":"<pre><code>from bigtree import str_to_tree, prune_tree\n\nroot = str_to_tree(\"\"\"\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n\"\"\")\n\n# Prune tree to only path a/b\nroot_pruned = prune_tree(root, \"a/b\")\nroot_pruned.show()\n# a\n# \u2514\u2500\u2500 b\n#     \u251c\u2500\u2500 d\n#     \u2514\u2500\u2500 e\n\n# Prune tree to exactly path a/b\nroot_pruned = prune_tree(root, \"a/b\", exact=True)\nroot_pruned.show()\n# a\n# \u2514\u2500\u2500 b\n</code></pre>"},{"location":"demo/tree/#4-getting-difference-between-two-trees","title":"4. Getting difference between two trees","text":"<pre><code>from bigtree import str_to_tree, get_tree_diff\n\nroot = str_to_tree(\"\"\"\na\n\u251c\u2500\u2500 b\n\u2502   \u251c\u2500\u2500 d\n\u2502   \u2514\u2500\u2500 e\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 f\n\"\"\")\n\n# Get difference between two trees\nroot_other = str_to_tree(\"\"\"\na\n\u251c\u2500\u2500 b\n\u2502   \u2514\u2500\u2500 d\n\u2514\u2500\u2500 c\n    \u2514\u2500\u2500 g\n\"\"\")\n\ntree_diff = get_tree_diff(root, root_other)\ntree_diff.show()\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u2514\u2500\u2500 e (-)\n# \u2514\u2500\u2500 c\n#     \u251c\u2500\u2500 f (-)\n#     \u2514\u2500\u2500 g (+)\n\ntree_diff = get_tree_diff(root, root_other, only_diff=False)\ntree_diff.show()\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u251c\u2500\u2500 d\n# \u2502   \u2514\u2500\u2500 e (-)\n# \u2514\u2500\u2500 c\n#     \u251c\u2500\u2500 f (-)\n#     \u2514\u2500\u2500 g (+)\n</code></pre>"},{"location":"demo/tree/#export-tree","title":"Export Tree","text":"<p>Tree can be exported to other data types:</p> <ol> <li>Newick string notation</li> <li>Nested dictionary (flat structure and recursive structure)</li> <li>pandas DataFrame</li> <li>polars DataFrame</li> <li>Dot (can save to .dot, .png, .svg, .jpeg files)</li> <li>Pillow (can save to .png, .jpg)</li> <li>Mermaid Flowchart (can display on .md)</li> </ol> <pre><code>from bigtree import Node\n\nroot = Node(\"a\", age=90)\nb = Node(\"b\", age=65, parent=root)\nc = Node(\"c\", age=60, parent=root)\nd = Node(\"d\", age=40, parent=b)\ne = Node(\"e\", age=35, parent=b)\nroot.show()\n# a\n# \u251c\u2500\u2500 b\n# \u2502   \u251c\u2500\u2500 d\n# \u2502   \u2514\u2500\u2500 e\n# \u2514\u2500\u2500 c\n</code></pre> Newick string notationDictionary (flat structure)Dictionary (recursive structure)pandas DataFramepolars DataFrameDotPillowMermaid Flowchart <pre><code>from bigtree import tree_to_newick\n\ntree_to_newick(root)\n# '((d,e)b,c)a'\n\ntree_to_newick(root, attr_list=[\"age\"])\n# '((d[&amp;&amp;NHX:age=40],e[&amp;&amp;NHX:age=35])b[&amp;&amp;NHX:age=65],c[&amp;&amp;NHX:age=60])a[&amp;&amp;NHX:age=90]'\n</code></pre> <pre><code>from bigtree import tree_to_dict\n\ntree_to_dict(\n   root,\n   name_key=\"name\",\n   parent_key=\"parent\",\n   attr_dict={\"age\": \"person age\"}\n)\n# {\n#    '/a': {'name': 'a', 'parent': None, 'person age': 90},\n#    '/a/b': {'name': 'b', 'parent': 'a', 'person age': 65},\n#    '/a/b/d': {'name': 'd', 'parent': 'b', 'person age': 40},\n#    '/a/b/e': {'name': 'e', 'parent': 'b', 'person age': 35},\n#    '/a/c': {'name': 'c', 'parent': 'a', 'person age': 60}\n# }\n</code></pre> <pre><code>from bigtree import tree_to_nested_dict\n\ntree_to_nested_dict(root, all_attrs=True)\n# {\n#    'name': 'a',\n#    'age': 90,\n#    'children': [\n#       {\n#          'name': 'b',\n#          'age': 65,\n#          'children': [\n#             {\n#                'name': 'd',\n#                'age': 40\n#             },\n#             {\n#                'name': 'e',\n#                'age': 35\n#             }\n#          ]\n#       },\n#       {\n#          'name': 'c',\n#          'age': 60\n#       }\n#    ]\n# }\n</code></pre> <pre><code>from bigtree import tree_to_dataframe\n\ntree_to_dataframe(\n   root,\n   name_col=\"name\",\n   parent_col=\"parent\",\n   path_col=\"path\",\n   attr_dict={\"age\": \"person age\"}\n)\n#      path name parent  person age\n# 0      /a    a   None          90\n# 1    /a/b    b      a          65\n# 2  /a/b/d    d      b          40\n# 3  /a/b/e    e      b          35\n# 4    /a/c    c      a          60\n</code></pre> <pre><code>from bigtree import tree_to_polars\n\ntree_to_polars(\n   root,\n   name_col=\"name\",\n   parent_col=\"parent\",\n   path_col=\"path\",\n   attr_dict={\"age\": \"person age\"}\n)\n# shape: (5, 4)\n# \u250c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2510\n# \u2502 path   \u2506 name \u2506 parent \u2506 person age \u2502\n# \u2502 ---    \u2506 ---  \u2506 ---    \u2506 ---        \u2502\n# \u2502 str    \u2506 str  \u2506 str    \u2506 i64        \u2502\n# \u255e\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u256a\u2550\u2550\u2550\u2550\u2550\u2550\u256a\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u256a\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2561\n# \u2502 /a     \u2506 a    \u2506 null   \u2506 90         \u2502\n# \u2502 /a/b   \u2506 b    \u2506 a      \u2506 65         \u2502\n# \u2502 /a/b/d \u2506 d    \u2506 b      \u2506 40         \u2502\n# \u2502 /a/b/e \u2506 e    \u2506 b      \u2506 35         \u2502\n# \u2502 /a/c   \u2506 c    \u2506 a      \u2506 60         \u2502\n# \u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2518\n</code></pre> <pre><code>from bigtree import tree_to_dot\n\ngraph = tree_to_dot(root, node_colour=\"gold\")\ngraph.write_png(\"assets/demo/dot.png\")\n</code></pre> <pre><code>from bigtree import tree_to_pillow\n\npillow_image = tree_to_pillow(root)\npillow_image.save(\"assets/demo/pillow.png\")\n</code></pre> <pre><code>from bigtree import tree_to_mermaid\n\nmermaid_md = tree_to_mermaid(root)\nprint(mermaid_md)\n</code></pre> <ul> <li>dot.png</li> </ul> <p></p> <ul> <li>pillow.png</li> </ul> <p></p> <ul> <li>Mermaid flowchart <pre><code>%%{ init: { 'flowchart': { 'curve': 'basis' } } }%%\nflowchart TB\n0(\"a\") --&gt; 0-0(\"b\")\n0-0 --&gt; 0-0-0(\"d\")\n0-0 --&gt; 0-0-1(\"e\")\n0(\"a\") --&gt; 0-1(\"c\")\nclassDef default stroke-width:1</code></pre></li> </ul>"},{"location":"demo/workflow/","title":"\ud83d\udccb Workflow Demonstration","text":"<p>There are existing implementations of workflows to showcase how <code>bigtree</code> can be used!</p>"},{"location":"demo/workflow/#to-do-application","title":"To Do Application","text":"<p>There are functions to:</p> <ul> <li>Add or remove list to To-Do application</li> <li>Add or remove item to list, default list is the 'General' list</li> <li>Prioritize a list/item by reordering them as first list/item</li> <li>Save and import To-Do application to and from an external JSON file</li> <li>Show To-Do application, which prints tree to console</li> </ul> <pre><code>from bigtree import AppToDo\n\napp = AppToDo(\"To Do App\")\napp.add_item(item_name=\"Homework 1\", list_name=\"School\")\napp.add_item(item_name=[\"Milk\", \"Bread\"], list_name=\"Groceries\", description=\"Urgent\")\napp.add_item(item_name=\"Cook\")\napp.show()\n# To Do App\n# \u251c\u2500\u2500 School\n# \u2502   \u2514\u2500\u2500 Homework 1\n# \u251c\u2500\u2500 Groceries\n# \u2502   \u251c\u2500\u2500 Milk [description=Urgent]\n# \u2502   \u2514\u2500\u2500 Bread [description=Urgent]\n# \u2514\u2500\u2500 General\n#     \u2514\u2500\u2500 Cook\n\napp.save(\"list.json\")\napp2 = AppToDo.load(\"list.json\")\n</code></pre>"},{"location":"demo/workflow/#calendar-application","title":"Calendar Application","text":"<p>There are functions to:</p> <ul> <li>Add or remove event from Calendar</li> <li>Find event by name, or name and date</li> <li>Display calendar, which prints events to console</li> <li>Export calendar to pandas DataFrame</li> </ul> <pre><code>import datetime as dt\nfrom bigtree import Calendar\n\ncalendar = Calendar(\"My Calendar\")\ncalendar.add_event(\"Gym\", \"2023-01-01 18:00\")\ncalendar.add_event(\"Dinner\", \"2023-01-01\", date_format=\"%Y-%m-%d\", budget=20)\ncalendar.add_event(\"Gym\", \"2023-01-02 18:00\")\ncalendar.show()\n# My Calendar\n# 2023-01-01 00:00:00 - Dinner (budget: 20)\n# 2023-01-01 18:00:00 - Gym\n# 2023-01-02 18:00:00 - Gym\n\ncalendar.find_event(\"Gym\")\n# 2023-01-01 18:00:00 - Gym\n# 2023-01-02 18:00:00 - Gym\n\ncalendar.delete_event(\"Gym\", dt.date(2023, 1, 1))\ncalendar.show()\n# My Calendar\n# 2023-01-01 00:00:00 - Dinner (budget: 20)\n# 2023-01-02 18:00:00 - Gym\n\ndata_calendar = calendar.to_dataframe()\ndata_calendar\n#                              path    name        date      time  budget\n# 0  /My Calendar/2023/01/01/Dinner  Dinner  2023-01-01  00:00:00    20.0\n# 1     /My Calendar/2023/01/02/Gym     Gym  2023-01-02  18:00:00     NaN\n</code></pre>"},{"location":"others/","title":"\ud83d\udca1 Tips and Tricks","text":""},{"location":"others/list_dir/","title":"List Directory","text":"<p>To list directories recursively using bigtree, we can use the <code>glob</code> built-in Python package to extract a list of paths.</p> <pre><code>import glob\nfrom bigtree import list_to_tree, print_tree\n\n# Get all directories recursively\npath_list = []\nfor f in glob.glob(\"./**/*.py\", recursive=True):\n    path_list.append(f)\n\n# Construct tree\nroot = list_to_tree(path_list)\n\n# View tree\nprint_tree(root, max_depth=3)\n</code></pre>"},{"location":"others/merging_trees/","title":"Merging Trees","text":"<p>To merge two separate trees into one, we can use the tree modify module.</p> <p>In this example, we are merging two trees that have similar node <code>Pictures</code>. Children of node <code>Pictures</code> from both trees are retained as long as <code>merge_children=True</code> is set. If only children of the other tree are desired, set <code>overriding=True</code> instead.</p> <pre><code>from bigtree import Node, copy_nodes_from_tree_to_tree\n\n# Construct trees\ndownloads_folder = Node(\"Downloads\")\npictures_folder = Node(\"Pictures\", parent=downloads_folder)\nphoto1 = Node(\"photo1.jpg\", parent=pictures_folder)\nfile1 = Node(\"file1.doc\", parent=downloads_folder)\n\ndocuments_folder = Node(\"Documents\")\npictures_folder = Node(\"Pictures\", parent=documents_folder)\nphoto2 = Node(\"photo2.jpg\", parent=pictures_folder)\n\n# Validate tree structure\ndownloads_folder.show()\n# Downloads\n# \u251c\u2500\u2500 Pictures\n# \u2502   \u2514\u2500\u2500 photo1.jpg\n# \u2514\u2500\u2500 file1.doc\n\ndocuments_folder.show()\n# Documents\n# \u2514\u2500\u2500 Pictures\n#     \u2514\u2500\u2500 photo2.jpg\n\n# Merge trees\ncopy_nodes_from_tree_to_tree(\n    from_tree=documents_folder,\n    to_tree=downloads_folder,\n    from_paths=[\"Documents/Pictures\"],\n    to_paths=[\"Downloads/Pictures\"],\n    merge_children=True,  # set overriding=True to override existing children\n)\n\n# Validate tree structure\ndownloads_folder.show()\n# Downloads\n# \u251c\u2500\u2500 Pictures\n# \u2502   \u251c\u2500\u2500 photo1.jpg\n# \u2502   \u2514\u2500\u2500 photo2.jpg\n# \u2514\u2500\u2500 file1.doc\n</code></pre>"},{"location":"others/nodes/","title":"Extending Nodes","text":"<p>Nodes can be extended from <code>BaseNode</code> or <code>Node</code> class to have extended functionalities or add pre-/post-assign checks.  - For example, <code>Node</code> class extends <code>BaseNode</code> and added the <code>name</code> functionality with pre-assign checks to ensure no duplicate path names.</p>"},{"location":"others/nodes/#population-node-add-functionalitymethodproperty","title":"Population Node (add functionality/method/property)","text":"<pre><code>from bigtree import Node, print_tree\n\n\nclass PopulationNode(Node):\n\n    def __init__(self, name: str, population: int = 0, **kwargs):\n        super().__init__(name, **kwargs)\n        self._population = population\n\n    @property\n    def population(self):\n        if self.is_leaf:\n            return self._population\n        return sum([child.population for child in self.children])\n\n    @property\n    def percentage(self):\n        if self.is_root:\n            return 1\n        return round(self.population / self.root.population, 2)\n\n\nroot = PopulationNode(\"World\")\nb1 = PopulationNode(\"Country A\", parent=root)\nc1 = PopulationNode(\"State A1\", 100, parent=b1)\nc2 = PopulationNode(\"State A2\", 50, parent=b1)\nb2 = PopulationNode(\"Country B\", 200, parent=root)\nb3 = PopulationNode(\"Country C\", 100, parent=root)\n\nprint_tree(root, attr_list=[\"population\", \"percentage\"])\n# World [population=450, percentage=1]\n# \u251c\u2500\u2500 Country A [population=150, percentage=0.33]\n# \u2502   \u251c\u2500\u2500 State A1 [population=100, percentage=0.22]\n# \u2502   \u2514\u2500\u2500 State A2 [population=50, percentage=0.11]\n# \u251c\u2500\u2500 Country B [population=200, percentage=0.44]\n# \u2514\u2500\u2500 Country C [population=100, percentage=0.22]\n</code></pre>"},{"location":"others/nodes/#read-only-node-add-pre-post-assign-checks","title":"Read-Only Node (add pre-/post-assign checks)","text":"<pre><code>import pytest\n\nfrom bigtree import Node\nfrom typing import List\n\n\nclass ReadOnlyNode(Node):\n\n    def __init__(self, *args, **kwargs):\n        self.__readonly = False\n        super().__init__(*args, **kwargs)\n        self.__readonly = True\n\n    def _Node__pre_assign_parent(self, new_parent: Node):\n        if self.__readonly:\n            raise RuntimeError(\"Nodes cannot be reassigned for ReadOnlyNode\")\n\n    def _Node__pre_assign_children(self, new_children: List[Node]):\n        if self.__readonly:\n            raise RuntimeError(\"Nodes cannot be reassigned for ReadOnlyNode\")\n\n\na = ReadOnlyNode(\"a\")\nb = ReadOnlyNode(\"b\", parent=a)\nc = ReadOnlyNode(\"c\", parent=a)\n\nwith pytest.raises(RuntimeError):\n    c.parent = b\n\nwith pytest.raises(RuntimeError):\n    a.children = [b, c]\n</code></pre>"},{"location":"others/remove_checks/","title":"Remove Tree Checks","text":"<p>Note</p> <p>Available from version 0.16.2 onwards</p> <p>When constructing trees, there are a few checks done that slow down performance. This slowness will be more apparent with very large trees. The checks are to</p> <ul> <li>Check parent/children data type</li> <li>Check for loops (expensive for trees that are deep as it checks the ancestors of node)</li> </ul> <p>These checks are enabled by default. To turn off these checks, you can set environment variable before importing <code>bigtree</code>.</p> <pre><code>import os\nos.environ[\"BIGTREE_CONF_ASSERTIONS\"] = \"\"\n\nimport bigtree\n</code></pre>"},{"location":"others/weighted_trees/","title":"Trees with Weighted Edges","text":"<p>Edge weights should be defined in the child node for the parent-child edge since each node can only have one parent.</p> <p>We can simply add <code>weight</code> attribute to the <code>Node</code> class. However, if we want to visualize the weighted tree, we can create a <code>WeightedNode</code> class to generate the edge attribute dictionary.</p> <pre><code>from bigtree import Node, tree_to_dot\n\nclass WeightedNode(Node):\n    def __init__(self, name, weight=0, **kwargs):\n        super().__init__(name, **kwargs)\n        self.weight = weight\n\n    @property\n    def edge_attr(self):\n        \"\"\"Edge attribute for pydot diagram\n        Label for edge label, penwidth for edge width\n        \"\"\"\n        return {\"label\": self.weight, \"penwidth\": self.weight}\n\n# Construct weighted tree\nroot = WeightedNode(\"a\")\nb = WeightedNode(\"b\", parent=root, weight=1)\nc = WeightedNode(\"c\", parent=root, weight=2)\nd = WeightedNode(\"d\", parent=b, weight=3)\n\ngraph = tree_to_dot(root, node_colour=\"gold\", edge_attr=\"edge_attr\")\ngraph.write_png(\"assets/docs/weighted_tree.png\")\n</code></pre> <p></p>"},{"location":"resources/articles/","title":"\ud83d\udcf0 Articles","text":"<ul> <li> Python Tree Implementation with BigTree <p>Integrating trees with Python lists, dictionaries, and pandas DataFrames</p> <p> Read article</p> </li> </ul> <ul> <li> The Reingold Tilford Algorithm Explained, with Walkthrough <p>Algorithm to Plot Tree Nodes with Numerical Examples and Python Code</p> <p> Read article</p> </li> </ul>"}]}
\ No newline at end of file
diff --git a/sitemap.xml b/sitemap.xml
index 4ff42cb8..3af31a2a 100644
--- a/sitemap.xml
+++ b/sitemap.xml
@@ -2,222 +2,212 @@
 <urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
     <url>
          <loc>https://kayjan.github.io/bigtree/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/benchmarks/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/binarytree/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/changelog/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/contributing/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/dag/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/home/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/install/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/tree/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/bigtree/binarytree/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/bigtree/binarytree/construct/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/bigtree/dag/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/bigtree/dag/construct/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/bigtree/dag/export/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/bigtree/node/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/bigtree/node/basenode/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/bigtree/node/binarynode/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/bigtree/node/dagnode/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/bigtree/node/node/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/bigtree/tree/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/bigtree/tree/construct/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/bigtree/tree/export/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/bigtree/tree/helper/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/bigtree/tree/modify/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/bigtree/tree/search/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/bigtree/utils/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/bigtree/utils/iterators/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/bigtree/utils/plot/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/bigtree/workflows/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/bigtree/workflows/app_calendar/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/bigtree/workflows/app_todo/</loc>
-         <lastmod>2024-04-25</lastmod>
-         <changefreq>daily</changefreq>
-    </url>
-    <url>
-         <loc>https://kayjan.github.io/bigtree/demo/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/demo/binarytree/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/demo/dag/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/demo/tree/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/demo/workflow/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/others/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/others/list_dir/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/others/merging_trees/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/others/nodes/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/others/remove_checks/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/others/weighted_trees/</loc>
-         <lastmod>2024-04-25</lastmod>
-         <changefreq>daily</changefreq>
-    </url>
-    <url>
-         <loc>https://kayjan.github.io/bigtree/resources/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
     <url>
          <loc>https://kayjan.github.io/bigtree/resources/articles/</loc>
-         <lastmod>2024-04-25</lastmod>
+         <lastmod>2024-05-28</lastmod>
          <changefreq>daily</changefreq>
     </url>
 </urlset>
\ No newline at end of file
diff --git a/sitemap.xml.gz b/sitemap.xml.gz
index 2cbfe1c1d2fa224425a30db513708034cbae08d5..2d59a9a1eeccd93303a4c740f55038125e4c852f 100644
GIT binary patch
literal 474
zcmV<00VVz)iwFoMFjZy(|8r?{Wo=<_E_iKh0M*#dj+-zL0O0#RMZ`Tgjaq42CG4$F
zuzQY-nP4}@LuZC%^Y%3)t#at8hsxsvKbA3{M)nwUc=;IO<{gLwrepP~-c=h&4!e;0
zWA*m>efwO!G*5?#B7<yl<HX0xi;UllndiCYATZdGYoy+=^ZAC&z0&OJuT}H3$z|!_
zcD0s6MAt06aPH<}uRm<6`yhU5>wu;Wy%2yon5Eg{Q<i1GuG#PQpSQa&+x>HHa<6-6
z=DbZkoC$t5oelANFb_31j``#HCs~_g<OfR^E*Tk;rEB4ly!98cFWHDmD72I0Nl`Gf
zvnA_14keGnkXUSt1q(}0iJG#`U$A+Sv(V&30lVy({;1RzRrnZ@G++~UpoQ65236iQ
zD`*nup{t3j#HwTwQ@4Dr2Q``Y_Vo&J1k$3-Zx83I7A=D%=M`x41~9T3XAmGONP5I$
zL=6dHM!K9M&aBF6$MNKBgw$D52N&$H<UcPkppK32DlL2axDqvl@%Iod*ooqy=mp>o
zjDh9U1u9=U0QDjDr=?CoV3(bi0w(48^bRNI!Ce$^X9&F)=!zc&1dJ28Y_uf7#s7g_
QPYlxh0&+UcXj~is0H^`&O#lD@

literal 476
zcmV<20VDn&iwFpM)G1~H|8r?{Wo=<_E_iKh0M*#Bj@vK{0MPxuBJdt74X!|2B)+X*
za5o3C%vfq<(Ix5g<?kyyX_28*heFhl#DXk85F%ye@bWRl%{veWOvma|y{k5m9Cjh~
z$Lj6%`}Rxq(mWj|iVU*JgA*SsFEV~JW}fGogTP=%u914f&gTm@_fE5`zgErDCbwmR
z+po19BD!Xoh4VBQd;MWk-3RegTL(04=!F2x!7Rfb@3JfdcFlgbf8Oq%xBJg|$i44j
znDaLEa3=WKbT-86!94WbIOdP%pJZ*0ksmBwxMXBVmac_I@-|<@zGNdNq0ml}lcHc|
zXG_+397<k?A+gvP3l^4M5;awwzhHBcv(V&30lVx>e^hFVDtwGc8n6jF(86pjgDUS@
z6*P(S($&OOVpXz<soTER4>gtc_Vx;K1k$3-PY>s-7A=D%=M`x40Wh)}XAmGONP5I$
zL=6RDM!K9M&aBF6$MNKBgw$D52N&$H<bPgZD4wU{T)s-nKHaWF4PpG9K?OTeJQTe@
z-GMQ%oVq~eO9!Anr2e$@DG2Ox5LCdVoKNp?avt180e6Pbdx5U_RY1TvkyB!{B*Df1
SfnC2Cr1=G|CRB2t9RL8oGU`wO

diff --git a/tree/index.html b/tree/index.html
index cb18bbc3..57dfe891 100644
--- a/tree/index.html
+++ b/tree/index.html
@@ -289,7 +289,7 @@
     
     
       <li class="md-tabs__item">
-        <a href="../demo/" class="md-tabs__link">
+        <a href="../demo/tree/" class="md-tabs__link">
           
   
     
@@ -1007,10 +1007,6 @@
   
     
     
-      
-        
-          
-        
       
         
       
@@ -1035,24 +1031,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_1" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../demo/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Demonstration
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_1" id="__nav_2_1_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_1_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_1">
@@ -1062,8 +1050,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -1165,10 +1151,6 @@
     
       
         
-          
-        
-      
-        
       
     
     
@@ -1185,24 +1167,16 @@
         <input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_2_2" >
         
           
-          
-          <div class="md-nav__link md-nav__container">
-            <a href="../resources/" class="md-nav__link ">
-              
+          <label class="md-nav__link" for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
+            
   
   <span class="md-ellipsis">
     Resources
   </span>
   
 
-            </a>
-            
-              
-              <label class="md-nav__link " for="__nav_2_2" id="__nav_2_2_label" tabindex="0">
-                <span class="md-nav__icon md-icon"></span>
-              </label>
-            
-          </div>
+            <span class="md-nav__icon md-icon"></span>
+          </label>
         
         <nav class="md-nav" data-md-level="2" aria-labelledby="__nav_2_2_label" aria-expanded="false">
           <label class="md-nav__title" for="__nav_2_2">
@@ -1212,8 +1186,6 @@
           <ul class="md-nav__list" data-md-scrollfix>
             
               
-            
-              
                 
   
   
@@ -2431,9 +2403,10 @@ <h2 id="constructing-tree"><a href="../bigtree/tree/construct/"><strong>✨ Cons
 <li>From <em>list</em>, using paths or parent-child tuples</li>
 <li>From <em>nested dictionary</em>, using path-attribute key-value pairs or recursive structure</li>
 <li>From <em>pandas DataFrame</em>, using paths or parent-child columns</li>
+<li>From <em>polars DataFrame</em>, using paths or parent-child columns</li>
 <li>Add nodes to existing tree using path string</li>
-<li>Add nodes and attributes to existing tree using <em>dictionary</em> or <em>pandas DataFrame</em>, using path</li>
-<li>Add only attributes to existing tree using <em>dictionary</em> or <em>pandas DataFrame</em>, using node name</li>
+<li>Add nodes and attributes to existing tree using <em>dictionary</em>, <em>pandas DataFrame</em>, or <em>polars DataFrame</em>, using path</li>
+<li>Add only attributes to existing tree using <em>dictionary</em>, <em>pandas DataFrame</em>, or <em>polars DataFrame</em>, using node name</li>
 </ul>
 <h2 id="traversing-tree"><a href="../bigtree/utils/iterators/"><strong>➰ Traversing Tree</strong></a></h2>
 <ul>
@@ -2473,7 +2446,7 @@ <h2 id="plotting-tree"><a href="../bigtree/utils/plot/"><strong>📊 Plotting Tr
 <h2 id="exporting-tree"><a href="../bigtree/tree/export/"><strong>🔨 Exporting Tree</strong></a></h2>
 <ul>
 <li>Print to console, in vertical or horizontal orientation</li>
-<li>Export to <em>Newick string notation</em>, <em>dictionary</em>, <em>nested dictionary</em>, or <em>pandas DataFrame</em></li>
+<li>Export to <em>Newick string notation</em>, <em>dictionary</em>, <em>nested dictionary</em>, <em>pandas DataFrame</em>, or <em>polars DataFrame</em></li>
 <li>Export tree to <em>dot</em> (can save to .dot, .png, .svg, .jpeg files)</li>
 <li>Export tree to <em>Pillow</em> (can save to .png, .jpg)</li>
 <li>Export tree to <em>Mermaid Flowchart</em> (can display on .md)</li>