Difference between revisions of "HuffmanView"
(Created page with "{{Entry |Name=HuffmanView |Short description=Visualizes the Huffman tree algorithm. |Full description='HuffmanView' is a small application to visualize the Huffman tree algorithm...") |
(Deletion candidate. Links broken. Email to maintainer broken.) |
||
Line 2: | Line 2: | ||
|Name=HuffmanView | |Name=HuffmanView | ||
|Short description=Visualizes the Huffman tree algorithm. | |Short description=Visualizes the Huffman tree algorithm. | ||
− | |Full description='HuffmanView' is a small application to visualize the Huffman tree algorithm. It may be useful for educational purposes. Huffman coding is a graph algorithm used for lossless variable length encoding resulting in a prefix-free code. | + | |Full description=[[Category:Candidates for deletion]] This is a candidate for deletion: Links broken. Email to maintainer broken. [[User:Poppy-one|Poppy-one]] ([[User talk:Poppy-one|talk]]) 17:54, 2 August 2018 (EDT) |
− | + | ||
− | + | 'HuffmanView' is a small application to visualize the Huffman tree algorithm. It may be useful for educational purposes. Huffman coding is a graph algorithm used for lossless variable length encoding resulting in a prefix-free code. | |
− | |||
|Homepage URL=http://www.susaska.de | |Homepage URL=http://www.susaska.de | ||
− | | | + | |Is High Priority Project=No |
|Computer languages=C++ | |Computer languages=C++ | ||
− | | | + | |Decommissioned or Obsolete=Yes |
− | | | + | |Decommissioned details=Links broken. Email to maintainer broken. |
− | |||
− | |||
− | |||
− | |||
|Keywords=lossless,tree,algorithm,Huffman,variable length,encoding prefix-free | |Keywords=lossless,tree,algorithm,Huffman,variable length,encoding prefix-free | ||
− | |||
− | |||
− | |||
− | |||
− | |||
|Version identifier=0.8 | |Version identifier=0.8 | ||
|Version date=2005-08-03 | |Version date=2005-08-03 | ||
|Version status=beta | |Version status=beta | ||
|Version download=http://www.susaska.de/download/HuffmanView.tar.gz | |Version download=http://www.susaska.de/download/HuffmanView.tar.gz | ||
+ | |Version comment=0.8 beta released 2005-08-03 | ||
+ | |Last review by=Craig Hutchinson | ||
+ | |Last review date=2018/08/03 | ||
+ | |Submitted by=Database conversion | ||
+ | |Submitted date=2011-04-01 | ||
+ | |User level=none | ||
+ | |Accepts cryptocurrency donations=No | ||
+ | |Test entry=No | ||
+ | |Is GNU=No | ||
+ | |License verified date=2005-08-03 | ||
+ | }} | ||
+ | {{Project license | ||
+ | |License=GPLv2 | ||
+ | |License verified by=Janet Casey | ||
|License verified date=2005-08-03 | |License verified date=2005-08-03 | ||
− | |||
}} | }} | ||
{{Person | {{Person | ||
+ | |Real name=Olaf Wendisch | ||
|Role=Maintainer | |Role=Maintainer | ||
− | |||
|Email=wendy@susaska.de | |Email=wendy@susaska.de | ||
− | |||
}} | }} | ||
{{Resource | {{Resource | ||
Line 43: | Line 45: | ||
|Science=scientific-visualization | |Science=scientific-visualization | ||
|Use=science | |Use=science | ||
− | |||
− | |||
− | |||
− | |||
− | |||
}} | }} | ||
{{Software prerequisite | {{Software prerequisite | ||
Line 53: | Line 50: | ||
|Prerequisite description=Qt4 | |Prerequisite description=Qt4 | ||
}} | }} | ||
+ | {{Featured}} |
Latest revision as of 17:54, 2 August 2018
HuffmanView
http://www.susaska.de
Visualizes the Huffman tree algorithm.
This is a candidate for deletion: Links broken. Email to maintainer broken. Poppy-one (talk) 17:54, 2 August 2018 (EDT)
'HuffmanView' is a small application to visualize the Huffman tree algorithm. It may be useful for educational purposes. Huffman coding is a graph algorithm used for lossless variable length encoding resulting in a prefix-free code.
Licensing
License
Verified by
Verified on
Notes
Leaders and contributors
Contact(s) | Role |
---|---|
Olaf Wendisch | Maintainer |
Resources and communication
Audience | Resource type | URI |
---|---|---|
Bug Tracking,Developer,Support | mailto:wendy@susaska.de |
Software prerequisites
Kind | Description |
---|---|
Required to build | Qt4 |
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.