I've just released an 1.2 version.
Excerpts from Ross Paterson's message of Tue Sep 23 05:03:29 -0700 2008:
> On Mon, Sep 22, 2008 at 11:15:36PM -0700, Nicolas Pouillard wrote:
> > Here is an Haskell implementation of an algorithm that builds a binary
> > tree with minimum weighted path length fro
On Mon, Sep 22, 2008 at 11:15:36PM -0700, Nicolas Pouillard wrote:
> Here is an Haskell implementation of an algorithm that 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
nicolas.pouillard:
> Hi All,
>
> Here is an Haskell implementation of an algorithm that 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 a
Hi All,
Here is an Haskell implementation of an algorithm that 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.
This module a direct tr
