forked from satnaing/astro-paper
-
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Affected files: .obsidian/workspace.json src/content/blog/counting-money-algorithm.md src/content/blog/huffan-encoding-algorithm.md
- Loading branch information
Showing
3 changed files
with
144 additions
and
8 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,124 @@ | ||
--- | ||
title: Huffman Encoding Algorithm | ||
pubDatetime: 2023-12-10T22:30:00Z | ||
featured: false | ||
draft: false | ||
tags: | ||
- Greedy | ||
- Algorithms | ||
- Computer-Science | ||
description: 허프만 알고리즘 | ||
--- | ||
|
||
## Table of contents | ||
|
||
## `python` 코드 | ||
|
||
```python | ||
from __future__ import annotations | ||
|
||
import sys | ||
|
||
|
||
class Letter: | ||
def __init__(self, letter: str, freq: int): | ||
self.letter: str = letter | ||
self.freq: int = freq | ||
self.bitstring: dict[str, str] = {} | ||
|
||
def __repr__(self) -> str: | ||
return f"{self.letter}:{self.freq}" | ||
|
||
|
||
class TreeNode: | ||
def __init__(self, freq: int, left: Letter | TreeNode, right: Letter | TreeNode): | ||
self.freq: int = freq | ||
self.left: Letter | TreeNode = left | ||
self.right: Letter | TreeNode = right | ||
|
||
|
||
def parse_file(file_path: str) -> list[Letter]: | ||
chars: dict[str, int] = {} | ||
with open(file_path) as f: | ||
while True: | ||
c = f.read(1) | ||
if not c: | ||
break | ||
chars[c] = chars[c] + 1 if c in chars else 1 | ||
return sorted((Letter(c, f) for c, f in chars.items()), key=lambda x: x.freq) | ||
|
||
|
||
def build_tree(letters: list[Letter]) -> Letter | TreeNode: | ||
response: list[Letter | TreeNode] = letters # type: ignore | ||
while len(response) > 1: | ||
left = response.pop(0) | ||
right = response.pop(0) | ||
total_freq = left.freq + right.freq | ||
node = TreeNode(total_freq, left, right) | ||
response.append(node) | ||
response.sort(key=lambda x: x.freq) | ||
return response[0] | ||
|
||
|
||
def traverse_tree(root: Letter | TreeNode, bitstring: str) -> list[Letter]: | ||
if isinstance(root, Letter): | ||
root.bitstring[root.letter] = bitstring | ||
return [root] | ||
treenode: TreeNode = root | ||
letters = [] | ||
letters += traverse_tree(treenode.left, bitstring + "0") | ||
letters += traverse_tree(treenode.right, bitstring + "1") | ||
return letters | ||
|
||
|
||
def huffman(file_path: str) -> None: | ||
letters_list = parse_file(file_path) | ||
root = build_tree(letters_list) | ||
letters = { | ||
k: v for letter in traverse_tree(root, "") for k, v in letter.bitstring.items() | ||
} | ||
print(f"Huffman Coding of {file_path}: ") | ||
with open(file_path) as f: | ||
while True: | ||
c = f.read(1) | ||
if not c: | ||
break | ||
print(letters[c], end=" ") | ||
print() | ||
|
||
|
||
if __name__ == "__main__": | ||
huffman(sys.argv[1]) | ||
|
||
``` | ||
|
||
## How to Run | ||
|
||
python version: `3.11.6` | ||
|
||
### Run `main.py` | ||
|
||
``` | ||
pip install pipenv | ||
pipenv --python 3.11.6 | ||
pipenv run python3 main.py input.txt | ||
``` | ||
|
||
### Input | ||
|
||
`input.txt`: | ||
|
||
``` | ||
She Sells Seashells by the Seashore | ||
``` | ||
|
||
### Output | ||
|
||
```zsh | ||
Huffman Coding of input.txt: | ||
001 010 111 110 001 111 011 011 100 110 001 111 0001 100 010 111 011 011 100 110 10100 10101 110 10110 010 111 110 001 111 0001 100 010 10111 0000 111 | ||
``` | ||
|
||
## Execution Image | ||
|
||
![](https://res.cloudinary.com/gyunseo-blog/image/upload/f_auto/v1702215088/image_xts0fs.png) |