<story><title>Algorithm for Drawing Trees</title><url>https://rachel53461.wordpress.com/2014/04/20/algorithm-for-drawing-trees/</url></story><parent_chain></parent_chain><comment><author>slavik81</author><text>&amp;gt; I recently wanted to take a hierarchy of items and draw them in a nice tree structure. For example, a Family Tree.&lt;p&gt;In general, a family tree is a directed acyclic graph. Branches of the tree will always join back together if you follow the history far enough.&lt;p&gt;The number of ancestors in a generation is 2^N, with N being the number of generations back you&amp;#x27;re looking. There were only 100 billion people that ever lived, so by the time you get about a thousand years back, it becomes literally impossible for all your ancestors to appear only once.&lt;p&gt;Of course, that&amp;#x27;s just an easy upper bound to make the point that becoming a graph is unavoidable. In practice, branches will come together a lot sooner than that.</text></comment>
<story><title>Algorithm for Drawing Trees</title><url>https://rachel53461.wordpress.com/2014/04/20/algorithm-for-drawing-trees/</url></story><parent_chain></parent_chain><comment><author>tejtm</author><text>Was thinking was going to get some nice L-system eye candy 
[0] &lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;en.wikipedia.org&amp;#x2F;wiki&amp;#x2F;L-system&quot; rel=&quot;nofollow&quot;&gt;https:&amp;#x2F;&amp;#x2F;en.wikipedia.org&amp;#x2F;wiki&amp;#x2F;L-system&lt;/a&gt;</text></comment>