# HG changeset patch
# User Nathann Cohen <nathann.cohen@gmail.com>
# Date 1299151679 -3600
# Node ID c81f23649116b14014570a54b39fb3e62e3b5462
# Parent 9874dc07c1c07cc425ee2b285c1567b93ec3e9c7
trac 10864 - Minor corrections in the documentation of Huffman class
diff -r 9874dc07c1c0 -r c81f23649116 sage/coding/source_coding/huffman.py
a
|
b
|
|
105 | 105 | |
106 | 106 | - A dictionary that associates to each symbol of an alphabet a numeric |
107 | 107 | value. If we consider the frequency of each alphabetic symbol, then |
108 | | ``table`` is considered as the frequency table of the alphabet with |
| 108 | ``source`` is considered as the frequency table of the alphabet with |
109 | 109 | each numeric (non-negative integer) value being the number of |
110 | 110 | occurrences of a symbol. The numeric values can also represent weights |
111 | 111 | of the symbols. In that case, the numeric values are not necessarily |
112 | | integers, but can be real numbers. In general, we refer to ``table`` |
113 | | as a weight table. |
| 112 | integers, but can be real numbers. |
114 | 113 | |
115 | 114 | In order to construct a Huffman code for an alphabet, we use exactly one of |
116 | 115 | the following methods: |