by alexvn
The algorithm allows any kind of weights (costs, frequencies), including non-numerical ones. The {0, 1, ..., n-1} alphabet is used to encode message. Built tree is n-ary one.The algorithm is based on a set of template classes : Cell(SYMBOL, WEIGHT), Node(
------------------------ 2004-11-08 : Release 3.0 ------------------------ n-ary Huffman Template Algorithm : Release 3.0 s now available at http://sourceforge.net/projects/huffman-ta/ Changes from 2.3 to 3.0 ----------------------- 1. The n-ary ...
Copyright © 2009 SourceForge, Inc. All rights reserved. Terms of Use