A Functional Implementation of the Garsia-Wachs Algorithm
|Latest on Hackage:||1.2|
This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.
The Garsia-Wachs algorithm builds a binary tree with minimum
weighted path length from weighted leaf nodes given in symmetric order.
This can be used to build optimum search tables, to balance a
ropes data structure in an optimal way.