加入收藏 | 设为首页 | 会员中心 | 我要投稿 焦作站长网 (https://www.0391zz.com/)- 科技、建站、经验、云计算、5G、大数据,站长网!
当前位置: 首页 > 服务器 > 安全 > 正文

算法系列15天速成——第十三天 树操作【下】

发布时间:2020-03-14 19:11:13 所属栏目:安全 来源:站长网
导读:今天说下最后一种树,大家可否知道,文件压缩程序里面的核心结构,核心算法是什么?或许你知道,他就运用了赫夫曼树

namespace HuffmanTree
{
    class Program
    {
        static void Main(string[] args)
        {
            //有四个叶节点
            int leafNum = 4;

//赫夫曼树中的节点总数
            int huffmanNodes = 2 * leafNum - 1;

//各节点的权值
            int[] weight = { 5, 7, 2, 13 };

string[] alphabet = { "A", "B", "C", "D" };

string testCode = "DBDBDABDCDADBDADBDADACDBDBD";

//赫夫曼树用数组来保存,每个赫夫曼都作为一个实体存在
            HuffmanTree[] huffman = new HuffmanTree[huffmanNodes].Select(i => new HuffmanTree() { }).ToArray();

HuffmanTreeManager manager = new HuffmanTreeManager();

manager.CreateTree(huffman, leafNum, weight);

string[] huffmanCode = manager.HuffmanCoding(huffman, leafNum);

for (int i = 0; i < leafNum; i++)
            {
                Console.WriteLine("字符:{0},权重:{1},编码为:{2}", alphabet[i], huffman[i].weight, huffmanCode[i]);
            }

Console.WriteLine("原始的字符串为:" + testCode);

string encode = manager.Encode(huffmanCode, alphabet, testCode);

Console.WriteLine("被编码的字符串为:" + encode);

string decode = manager.Decode(huffman, huffmanNodes, alphabet, encode);

Console.WriteLine("解码后的字符串为:" + decode);
        }
    }

#region 赫夫曼树结构
    /// <summary>
/// 赫夫曼树结构
/// </summary>
    public class HuffmanTree
    {
        public int weight { get; set; }

public int parent { get; set; }

public int left { get; set; }

public int right { get; set; }
    }
    #endregion

/// <summary>
/// 赫夫曼树的操作类
/// </summary>
    public class HuffmanTreeManager
    {
        #region 赫夫曼树的创建
        /// <summary>
/// 赫夫曼树的创建
/// </summary>
/// <param>赫夫曼树</param>
/// <param>叶子节点</param>
/// <param>节点权重</param>
        public HuffmanTree[] CreateTree(HuffmanTree[] huffman, int leafNum, int[] weight)
        {
            //赫夫曼树的节点总数
            int huffmanNode = 2 * leafNum - 1;

//初始化节点,赋予叶子节点值
            for (int i = 0; i < huffmanNode; i++)
            {
                if (i < leafNum)
                {
                    huffman[i].weight = weight[i];
                }
            }

(编辑:焦作站长网)

【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容!

热点阅读