Use out dot and comma protocol to describe the graph:
top.(Huff_tree_a,...Huff_tree_n,PIT)
The top node, top is simply the wrapper for the whole array, the owner can easily grab the whole thing.
The next nodes down is where precision starts with one or more Huffman trees hanging. It has subgraphs for each tree,plus a sub graph of all the singletons that have been jammed onto them queue at the bottom of the pit. This is what needs to bubble up asap.
So, if we want to iterate on the pit, say group them into fives by probability, then bubble one or more groups up to start the requantization.
How to find the pit?
Insert another anchor node, one that points you directly to the pit, and one there the iterator can bounce you along the queue until your finished. The iterator can also sort, though we want is to sort in place, a problem to be fixed. The site management bits will have a pit iterator and sorter. The mathematician can use these tools, and grouping algorithm short cut the normal Huffman traversals, the goal to get partially finished, the let the traders run, then ru the site bot,...etc.
No comments:
Post a Comment