algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-05 09:21:13 +08:00
Code Issues Packages Projects Releases Wiki Activity

psf/black code formatting (#1277)

Browse Source
This commit is contained in:
William Zhang
2019-10-05 01:14:13 -04:00
committed by Christian Clauss
parent 07f04a2e55
commit 9eac17a408
291 changed files with 6014 additions and 4571 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
compression/huffman.py
View File

@ -1,5 +1,6 @@
import sys
class Letter:
def __init__(self, letter, freq):
self.letter = letter
@ -7,7 +8,7 @@ class Letter:
self.bitstring = ""
def __repr__(self):
return f'{self.letter}:{self.freq}'
return f"{self.letter}:{self.freq}"
class TreeNode:
@ -31,6 +32,7 @@ def parse_file(file_path):
chars[c] = chars[c] + 1 if c in chars.keys() else 1
return sorted([Letter(c, f) for c, f in chars.items()], key=lambda l: l.freq)
def build_tree(letters):
"""
Run through the list of Letters and build the min heap
@ -45,6 +47,7 @@ def build_tree(letters):
letters.sort(key=lambda l: l.freq)
return letters[0]
def traverse_tree(root, bitstring):
"""
Recursively traverse the Huffman Tree to set each
@ -58,6 +61,7 @@ def traverse_tree(root, bitstring):
letters += traverse_tree(root.right, bitstring + "1")
return letters
def huffman(file_path):
"""
Parse the file, build the tree, then run through the file
@ -67,7 +71,7 @@ def huffman(file_path):
letters_list = parse_file(file_path)
root = build_tree(letters_list)
letters = traverse_tree(root, "")
print(f'Huffman Coding of {file_path}: ')
print(f"Huffman Coding of {file_path}: ")
with open(file_path) as f:
while True:
c = f.read(1)
@ -77,6 +81,7 @@ def huffman(file_path):
print(le.bitstring, end=" ")
print()
if __name__ == "__main__":
# pass the file path to the huffman function
huffman(sys.argv[1])