Add a note about not including the parent node into the huffman coding.

This commit is contained in:
James Bowes 2012-09-05 12:40:18 -03:00
parent 48f963e143
commit 9ab0b0d2aa

View file

@ -129,7 +129,9 @@ path strings themselves (to avoid collision).
Next, we order the nodes from the above DAG by order of reference from other Next, we order the nodes from the above DAG by order of reference from other
nodes, from least to most references. This ensures the root of the DAG is nodes, from least to most references. This ensures the root of the DAG is
always first, as it has no references. Similar to the strings, we create a always first, as it has no references. Similar to the strings, we create a
huffman tree for the nodes. huffman tree for the nodes. The root node should not be included in the huffman
tree, as it is never referenced by any other nodes, so we don't need to use up
any potential address space on it.
We can then iterate over the node list, writing each one out to the binary We can then iterate over the node list, writing each one out to the binary
packing. Within each node, for each string and node pair that it references, we packing. Within each node, for each string and node pair that it references, we