C: Huffman Coding

 

HuffmanCoding.h
?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
/**
 * *****************************************************************************
 * @file        HuffmanCoding.h
 * @brief       Huffman Coding https://www.programiz.com/dsa/huffman-coding#google_vignette
 * IDE VSCODE    https://www.geeksforgeeks.org/huffman-coding-greedy-algo-3/
 * @author       (geovindu,Geovin Du,涂聚文)
 * @date        2023-09-27
 * @copyright   geovindu
 * *****************************************************************************
 */
 
#ifndef HUFFMANCODING_H
#define HUFFMANCODING_H
 
 
#include<stdio.h>
#include<stdbool.h>
 
#define MAX_TREE_HT 50
 
struct MinHNode {
  char item;
  unsigned freq;
  struct MinHNode *left, *right;
};
 
struct MinHeap {
  unsigned size;
  unsigned capacity;
  struct MinHNode **array;
};
 
/**
 * @brief       Create nodes
 *
 * @param       item
 * @param       freq
 * @return      struct MinHNode*
 */
struct MinHNode *newNode(char item, unsigned freq);
 
/**
 * @brief       Create a Min H object Create min heap
 *
 * @param       capacity
 * @return      struct MinHeap*
 */
struct MinHeap *createMinH(unsigned capacity);
 
 
/**
 * @brief       Function to swap
 *
 * @param       a
 * @param       b
 */
void swapMinHNode(struct MinHNode **a, struct MinHNode **b);
 
/**
 * @brief       Heapify
 *
 * @param       minHeap
 * @param       idx
 */
void minHeapify(struct MinHeap *minHeap, int idx);
 
 
/**
 * @brief       Check if size if 1
 *
 * @param       minHeap
 * @return      int
 */
int checkSizeOne(struct MinHeap *minHeap);
 
 
/**
 * @brief       Extract min
 *
 * @param       minHeap
 * @return      struct MinHNode*
 */
struct MinHNode *extractMin(struct MinHeap *minHeap);
 
 
/**
 * @brief       Insertion function
 *
 * @param       minHeap
 * @param       minHeapNode
 */
void insertMinHeap(struct MinHeap *minHeap, struct MinHNode *minHeapNode);
 
 
/**
 * @brief      
 *
 * @param       minHeap
 */
void buildMinHeap(struct MinHeap *minHeap);
 
/**
 * @brief      
 *
 * @param       root
 * @return      int
 */
int isLeaf(struct MinHNode *root);
 
 
/**
 * @brief       Create a And Build Min Heap object
 *
 * @param       item
 * @param       freq
 * @param       size
 * @return      struct MinHeap*
 */
struct MinHeap *createAndBuildMinHeap(char item[], int freq[], int size);
 
 
/**
 * @brief      
 *
 * @param       item
 * @param       freq
 * @param       size
 * @return      struct MinHNode*
 */
struct MinHNode *buildHuffmanTree(char item[], int freq[], int size);
 
 
/**
 * @brief      
 *
 * @param       root
 * @param       arr
 * @param       top
 */
void printHCodes(struct MinHNode *root, int arr[], int top);
 
 
/**
 * @brief       Wrapper function
 *
 * @param       item
 * @param       freq
 * @param       size
 */
void HuffmanCodes(char item[], int freq[], int size);
 
 
/**
 * @brief       Print the array
 *
 * @param       arr
 * @param       n
 */
void HuffmanPrintArray(int arr[], int n);
 
 
 
 
#endif

　　

HuffmanCoding.c
 
?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
/**
 * *****************************************************************************
 * @file        HuffmanCoding.c
 * @brief       Huffman Coding 霍夫曼编码
 * @author       (geovindu,Geovin Du,涂聚文)
 * @date        2023-09-27
 * @copyright   geovindu
 * *****************************************************************************
 */
 
#include<stdio.h>
#include<stdbool.h>
#include "include/HuffmanCoding.h"
 
 
/**
 * @brief       Create nodes
 *
 * @param       item
 * @param       freq
 * @return      struct MinHNode*
 */
struct MinHNode *newNode(char item, unsigned freq) {
  struct MinHNode *temp = (struct MinHNode *)malloc(sizeof(struct MinHNode));
 
  temp->left = temp->right = NULL;
  temp->item = item;
  temp->freq = freq;
 
  return temp;
}
 
/**
 * @brief       Create a Min H object Create min heap
 *
 * @param       capacity
 * @return      struct MinHeap*
 */
struct MinHeap *createMinH(unsigned capacity) {
  struct MinHeap *minHeap = (struct MinHeap *)malloc(sizeof(struct MinHeap));
 
  minHeap->size = 0;
 
  minHeap->capacity = capacity;
 
  minHeap->array = (struct MinHNode **)malloc(minHeap->capacity * sizeof(struct MinHNode *));
  return minHeap;
}
 
/**
 * @brief       Function to swap
 *
 * @param       a
 * @param       b
 */
void swapMinHNode(struct MinHNode **a, struct MinHNode **b) {
  struct MinHNode *t = *a;
  *a = *b;
  *b = t;
}
 
/**
 * @brief       Heapify
 *
 * @param       minHeap
 * @param       idx
 */
void minHeapify(struct MinHeap *minHeap, int idx) {
  int smallest = idx;
  int left = 2 * idx + 1;
  int right = 2 * idx + 2;
 
  if (left < minHeap->size && minHeap->array[left]->freq < minHeap->array[smallest]->freq)
    smallest = left;
 
  if (right < minHeap->size && minHeap->array[right]->freq < minHeap->array[smallest]->freq)
    smallest = right;
 
  if (smallest != idx) {
    swapMinHNode(&minHeap->array[smallest], &minHeap->array[idx]);
    minHeapify(minHeap, smallest);
  }
}
 
/**
 * @brief       Check if size if 1
 *
 * @param       minHeap
 * @return      int
 */
int checkSizeOne(struct MinHeap *minHeap) {
  return (minHeap->size == 1);
}
 
/**
 * @brief       Extract min
 *
 * @param       minHeap
 * @return      struct MinHNode*
 */
struct MinHNode *extractMin(struct MinHeap *minHeap) {
  struct MinHNode *temp = minHeap->array[0];
  minHeap->array[0] = minHeap->array[minHeap->size - 1];
 
  --minHeap->size;
  minHeapify(minHeap, 0);
 
  return temp;
}
 
/**
 * @brief       Insertion function
 *
 * @param       minHeap
 * @param       minHeapNode
 */
void insertMinHeap(struct MinHeap *minHeap, struct MinHNode *minHeapNode) {
  ++minHeap->size;
  int i = minHeap->size - 1;
 
  while (i && minHeapNode->freq < minHeap->array[(i - 1) / 2]->freq) {
    minHeap->array[i] = minHeap->array[(i - 1) / 2];
    i = (i - 1) / 2;
  }
  minHeap->array[i] = minHeapNode;
}
 
/**
 * @brief      
 *
 * @param       minHeap
 */
void buildMinHeap(struct MinHeap *minHeap) {
  int n = minHeap->size - 1;
  int i;
 
  for (i = (n - 1) / 2; i >= 0; --i)
    minHeapify(minHeap, i);
}
 
/**
 * @brief      
 *
 * @param       root
 * @return      int
 */
int isLeaf(struct MinHNode *root) {
  return !(root->left) && !(root->right);
}
 
/**
 * @brief       Create a And Build Min Heap object
 *
 * @param       item
 * @param       freq
 * @param       size
 * @return      struct MinHeap*
 */
struct MinHeap *createAndBuildMinHeap(char item[], int freq[], int size) {
  struct MinHeap *minHeap = createMinH(size);
 
  for (int i = 0; i < size; ++i)
    minHeap->array[i] = newNode(item[i], freq[i]);
 
  minHeap->size = size;
  buildMinHeap(minHeap);
 
  return minHeap;
}
 
/**
 * @brief      
 *
 * @param       item
 * @param       freq
 * @param       size
 * @return      struct MinHNode*
 */
struct MinHNode *buildHuffmanTree(char item[], int freq[], int size) {
  struct MinHNode *left, *right, *top;
  struct MinHeap *minHeap = createAndBuildMinHeap(item, freq, size);
 
  while (!checkSizeOne(minHeap)) {
    left = extractMin(minHeap);
    right = extractMin(minHeap);
 
    top = newNode('$', left->freq + right->freq);
 
    top->left = left;
    top->right = right;
 
    insertMinHeap(minHeap, top);
  }
  return extractMin(minHeap);
}
 
/**
 * @brief      
 *
 * @param       root
 * @param       arr
 * @param       top
 */
void printHCodes(struct MinHNode *root, int arr[], int top) {
  if (root->left) {
    arr[top] = 0;
    printHCodes(root->left, arr, top + 1);
  }
  if (root->right) {
    arr[top] = 1;
    printHCodes(root->right, arr, top + 1);
  }
  if (isLeaf(root)) {
    printf("  %c   | ", root->item);
    HuffmanPrintArray(arr, top);
  }
}
 
/**
 * @brief       Wrapper function
 *
 * @param       item
 * @param       freq
 * @param       size
 */
void HuffmanCodes(char item[], int freq[], int size) {
  struct MinHNode *root = buildHuffmanTree(item, freq, size);
 
  int arr[MAX_TREE_HT], top = 0;
 
  printHCodes(root, arr, top);
}
 
/**
 * @brief       Print the array
 *
 * @param       arr
 * @param       n
 */
void HuffmanPrintArray(int arr[], int n) {
 
  printf("Huffman Coding/n");
  int i;
  for (i = 0; i < n; ++i)
    printf("%d", arr[i]);
 
  printf("\n");
}

　　

调用：

?
1
2
3
4
5
6
7
8
9
10
//17. Huffman Coding
char Huffmanarr[] = {'A', 'B', 'C', 'D'};
int freq[] = {5, 1, 6, 3};
 
int Huffmansize = sizeof(arr) / sizeof(arr[0]);
 
printf(" 17.霍夫曼编码 Char | Huffman code ");
printf("\n--------------------\n");
 
HuffmanCodes(Huffmanarr, freq, Huffmansize);

　　

 

posted @   ®Geovin Du Dream Park™  阅读(5)  评论(0)  编辑  收藏  举报
相关博文：
·  python: Algorithms
·  python: heap Tree, hash Table
·  Huffman树构造 编码 移码
·  北邮数据结构：哈夫曼树
·  哈夫曼编码介绍与实现
阅读排行：
· 25岁的心里话
· 闲置电脑爆改个人服务器（超详细） #公网映射 #Vmware虚拟网络编辑器
· 基于 Docker 搭建 FRP 内网穿透开源项目（很简单哒）
· 零经验选手，Compose 一天开发一款小游戏！
· 一起来玩mcp_server_sqlite，让AI帮你做增删改查！！
历史上的今天：
2022-09-27 CSharp: Chain of Responsibility Pattern
2022-09-27 Java: Command Pattern
2022-09-27 CSharp: Proxy Pattern
2017-09-27 sql server: left join 重复数据
2015-09-27 sql: table,view,function, procedure created MS_Description in sql server
< 2025年3月 >
日 一 二 三 四 五 六
23 24 25 26 27 28 1
2 3 4 5 6 7 8
9 10 11 12 13 14 15
16 17 18 19 20 21 22
23 24 25 26 27 28 29
30 31 1 2 3 4 5
点击右上角即可分享
微信分享提示