哈夫曼树（利用python实现）

程序

import numpy as np
import queue

image = np.array(
    [
        [3,1,2,4],
        [2,4,0,2],
        [2,2,3,3],
        [2,4,4,2],
    ]
)
hist=np.bincount(image.ravel(), minlength=5)
probabilities = hist/np.sum(hist)

def get2smallest(data):
    first=second =1;
    fid=sid =0
    for idx,element in enumerate(data):
        if(element<first):
            second = first
            sid = fid
            first = element
            fid - idx
        elif (element <second and element !=first):
            second = element
    return fid,first,sid,second



class Node:
    def __init__(self):
        self.prob = None
        self.code = None
        self.data = None
        self.left = None
        self.right = None
    def __lt__(self, other):
        if (self.prob< other.prob):
            return 1
        else:
            return 0
    def __ge__(self, other):
        if(self.prob>other.prob):
            return 1
        else:
            return 0



def tree(probabilities):
    prq = queue.PriorityQueue()
    for color,probability in enumerate(probabilities):
        leaf = Node()
        leaf.data = color
        leaf.prob = probability
        prq.put(leaf)
    while(prq.qsize()>1):
        newnode = Node()
        l = prq.get()
        r = prq.get()

        newnode.left = l
        newnode.right = r
        newprob = l.prob+r.prob
        newnode.prob = newprob
        prq.put(newnode)
    return prq.get()



def huffman_traversal (root_node, tmp_array, f):
    if (root_node.left is not None):
        tmp_array[huffman_traversal.count] = 1
        huffman_traversal.count +=1
        huffman_traversal(root_node.left, tmp_array, f)
        huffman_traversal.count -=1
    if (root_node.right is not None):
        tmp_array[huffman_traversal.count] = 0
        huffman_traversal.count +=1
        huffman_traversal(root_node.right, tmp_array, f)
        huffman_traversal.count -=1
    else:
        huffman_traversal.output_bits[
            root_node.data] = huffman_traversal.count
        bitstream = ''.join(str(cell) for cell in tmp_array
            [1:huffman_traversal.count])
        color = str(root_node.data)
        wr_str = color + ''+bitstream + '\n'
        f.write(wr_str)
    return


root_node = tree(probabilities)
tmp_array = np.ones([4], dtype=int)
huffman_traversal.output_bits = np.empty(5, dtype=int)
huffman_traversal.count = 0
f = open('codes.txt', 'w')
huffman_traversal(root_node, tmp_array, f)

结果

后续

如果想了解更多物联网、智能家居项目知识，可以关注我的项目实战专栏。
或者关注公众号。

编写不易，感谢支持。