This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
promiscuous_pipelines_day5 [2015-09-05 13:08] nikpromiscuous_pipelines_day5 [2015-09-05 14:32] (current) nik
Line 3: Line 3:
 notes from the fifth day of the [[promiscuous_pipelines]] workshop notes from the fifth day of the [[promiscuous_pipelines]] workshop
 +====Generating all Trees====
 +"(Pruning and grafting.) Representing binary trees as in Algorithm B, design an algorithm that visits all link tables l1...ln and r1...rn in such a way that, between visits, exactly one link changes from j to 0 and another from 0 to j, for some index j. (In other words, every step removes some subtree j from the binary tree and places it elsewhere, preserving preorder)."
 +--Knuth, Generating All Trees: History of Combinatorial Generation. 
  • promiscuous_pipelines_day5.txt
  • Last modified: 2015-09-05 14:32
  • by nik