Projects / n-ary Huffman Template Algo...

n-ary Huffman Template Algorithm

n-ary Huffman Template Algorithm allows any kind of weights (costs, frequencies), including non-numerical ones. The {0, 1, ..., n-1} alphabet is used to encode messages. The built tree is an n-ary one. The algorithm is based on a set of template classes: Cell(SYMBOL, WEIGHT), Node(SYMBOL, WEIGHT), InternalNode (SYMBOL, WEIGHT), TerminalNode(SYMBOL, WEIGHT), BasicHuffmanTree(SYMBOL, WEIGHT, ARY), LoadedHuffmanTree(SYMBOL, WEIGHT, ARITY), and DriedHuffmanTree(WEIGHT, ARITY).

Tags
Licenses
Operating Systems
Implementation

RSS Recent releases

  •  15 Nov 2002 11:16

No changes have been submitted for this release.

Screenshot

Project Spotlight

Fanurio

A time tracking and billing application for freelancers.

Screenshot

Project Spotlight

v4l-utils and libv4l

A collection of video4linux utilities and support libraries.