{"id":19081572,"url":"https://github.com/geekyharsh05/huffman-encoder","last_synced_at":"2026-05-14T01:39:43.292Z","repository":{"id":213341547,"uuid":"733611276","full_name":"geekyharsh05/Huffman-Encoder","owner":"geekyharsh05","description":"The algorithm assigns shorter codes to more frequent characters, optimizing the overall compression.","archived":false,"fork":false,"pushed_at":"2023-12-19T18:55:54.000Z","size":18,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-10-26T13:43:38.623Z","etag":null,"topics":["binarytree","huffman-algorithm","huffman-compression-algorithm","python"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/geekyharsh05.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-12-19T18:06:01.000Z","updated_at":"2024-08-09T20:00:53.000Z","dependencies_parsed_at":null,"dependency_job_id":"43b6b3ad-a661-41af-bb80-5699238b0e27","html_url":"https://github.com/geekyharsh05/Huffman-Encoder","commit_stats":null,"previous_names":["geekyharsh05/huffman-encoder"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/geekyharsh05/Huffman-Encoder","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/geekyharsh05%2FHuffman-Encoder","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/geekyharsh05%2FHuffman-Encoder/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/geekyharsh05%2FHuffman-Encoder/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/geekyharsh05%2FHuffman-Encoder/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/geekyharsh05","download_url":"https://codeload.github.com/geekyharsh05/Huffman-Encoder/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/geekyharsh05%2FHuffman-Encoder/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33006725,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-13T13:14:54.681Z","status":"ssl_error","status_checked_at":"2026-05-13T13:14:51.610Z","response_time":115,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["binarytree","huffman-algorithm","huffman-compression-algorithm","python"],"created_at":"2024-11-09T02:37:05.472Z","updated_at":"2026-05-14T01:39:43.276Z","avatar_url":"https://github.com/geekyharsh05.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Huffman Encoding Implementation\n\n## Overview\n\nThis Python implementation demonstrates the Huffman coding algorithm for text compression. The algorithm assigns shorter codes to more frequent characters, optimizing the overall compression.\n\n## Installation\n\nTo use the Huffman Encoder, follow these steps:\n\n1. Clone the repository:\n\n    ```bash\n    git clone git@github.com:geekyharsh05/Huffman-Encoder.git\n    ```\n\n2. Navigate to the project directory:\n\n    ```bash\n    cd Huffman-Encoder\n    ```\n\n## Visualization\n\nThe script generates a visual representation of the Huffman tree using the `graphviz` library. The visualization is saved as 'huffman_tree.png' in the current working directory.\n\nTo view the Huffman tree visualization, follow these steps:\n\n1. After running the script, check the current working directory for the generated 'huffman_tree.png' file.\n\n2. Open the 'huffman_tree.png' file using an image viewer of your choice.\n\nThe visualization provides a graphical representation of the Huffman tree structure, showing the relationships between nodes and their frequencies.\n\nFeel free to explore and analyze the generated Huffman tree to gain insights into the encoding structure of the input text.\n\n## Example\n\n```bash\npython src/main.py\n```\n\n## User Input Example\n\n```bash\nEnter the text you want to encode: HELLO\n```\n\n## Expected Output\n\n```bash\nEncoded text:  00 01 11 11 10\nCodes: {'H': ' 00', 'E': ' 01', 'O': ' 10', 'L': ' 11'}\nHuffman Tree has been drawn and saved as 'huffman_tree.png'\n```\n\n\u003cp align=\"center\"\u003e\n    \u003cimg src=\"huffman_tree.png\" alt=\"Huffman Tree Visualization\"\u003e\n\u003c/p\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgeekyharsh05%2Fhuffman-encoder","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgeekyharsh05%2Fhuffman-encoder","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgeekyharsh05%2Fhuffman-encoder/lists"}