-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathhuffmanCoding.js
More file actions
100 lines (76 loc) · 2.18 KB
/
Copy pathhuffmanCoding.js
File metadata and controls
100 lines (76 loc) · 2.18 KB
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
class HuffmanCoding {
encode(text) {
const frequencyTable = this._createFrequencyTable(text);
const huffmanTree = this._createHuffmanTree(frequencyTable);
const lookupTable = {};
this.createLookupTable(huffmanTree, "", lookupTable);
let encodedText = "";
for (let i = 0; i < text.length; i++) {
const char = text.charAt(i);
encodedText += lookupTable[char];
}
return { encodedText, huffmanTree };
}
decode(encodedText, huffmanTree) {
let decodedText = "";
let currentNode = huffmanTree;
for (let i = 0; i < encodedText.length; i++) {
const bit = encodedText.charAt(i);
if (bit === "0") {
currentNode = currentNode.left;
} else {
currentNode = currentNode.right;
}
if (currentNode.value !== "") {
decodedText += currentNode.value;
currentNode = huffmanTree;
}
}
return decodedText;
}
_createFrequencyTable(text) {
const frequencyTable = {};
for (let i = 0; i < text.length; i++) {
const char = text.charAt(i);
if (frequencyTable[char]) {
frequencyTable[char]++;
} else {
frequencyTable[char] = 1;
}
}
return frequencyTable;
}
_createHuffmanTree(frequencyTable) {
const queue = [];
for (const [char, freq] of Object.entries(frequencyTable)) {
queue.push(new HuffmanNode(char, freq, null, null));
}
while (queue.length > 1) {
queue.sort((a, b) => a.freq - b.freq);
const left = queue.shift();
const right = queue.shift();
const parent = new HuffmanNode("", left.freq + right.freq, left, right);
queue.push(parent);
}
return queue.shift();
}
createLookupTable(node, code, lookupTable) {
if (node == null) {
return;
}
if (node.value !== "") {
lookupTable[node.value] = code;
}
this.createLookupTable(node.left, code + "0", lookupTable);
this.createLookupTable(node.right, code + "1", lookupTable);
}
}
class HuffmanNode {
constructor(value, freq, left, right) {
this.value = value;
this.freq = freq;
this.left = left;
this.right = right;
}
}
module.exports = { HuffmanCoding, HuffmanNode };