代码搜索:haffmantree

找到约 33 项符合「haffmantree」的源代码

代码结果 33
www.eeworm.com/read/360110/10109275

c haffmantree.c

// HaffmanTree.c : Defines the entry point for the console application. // #include "stdafx.h" /*=================================================*/ /* 哈夫曼树编码 */ /*用
www.eeworm.com/read/276814/10706570

c haffmantree.c

#include #include #include #include "conio.h" #define ok 1 #define error 2 int m,s1,s2,n,k; typedef struct { unsigned int weight;
www.eeworm.com/read/271494/10992162

h haffmantree.h

struct HaffNode //哈夫曼树的结点结构 { char letter; int weight; //权值 int flag; //标记 int parent; //双亲结点下标 int leftChild; //左孩子下标 int rightChild; //右孩子下标 };
www.eeworm.com/read/469528/6929817

h haffmantree.h

const int MaxValue=10000; const int MaxBit=10; const int MaxN=10; struct HaffNode { int weight; int flag; int parent; int leftChild; int rightChild; }; struct Code { int bit[Max
www.eeworm.com/read/443015/7639398

cpp haffmantree.cpp

//哈夫曼树及其编码的实现 #include #include #include #include #include const int UINT_MAX=1000; typedef struct { int weight;
www.eeworm.com/read/399830/7832216

cpp haffmantree.cpp

//程序名:HaffmanTree.cpp //程序功能:实现哈弗曼树的编码和译码功能 //作者:黄秋旋 //日期:2008.12.4 //版本:1.0 //对应类头文件:hafuman.h //对应主程序:main.cpp #include"hafuman.h" ///////////////////////////////////////////////////////
www.eeworm.com/read/399828/7832304

cpp haffmantree.cpp

//程序名:HaffmanTree.cpp //程序功能:实现哈弗曼树的编码和译码功能 //作者:黄秋旋 //日期:2008.12.4 //版本:1.0 //对应类头文件:hafuman.h //对应主程序:main.cpp #include"hafuman.h" #include using namespace std; ////////////////
www.eeworm.com/read/242043/13097555

h haffmantree.h

struct HaffNode //哈夫曼树的结点结构 { int weight; //权值 int flag; //标记 int parent; //双亲结点下标 int leftChild; //左孩子下标 int rightChild; //右孩子下标 }; struct Code //存放哈
www.eeworm.com/read/242043/13097558

cpp haffmantree.cpp

#include #include const int MaxValue = 10000; //初始设定的权值最大值 const int MaxBit = 4; //初始设定的最大编码位数 const int MaxN = 10; //初始设定的最大结点个数 #include "HaffmanTree.h
www.eeworm.com/read/260582/11718571

java haffmantree.java

package haff; public class HaffmanTree //构造哈杜曼树和编码的类 { static final int maxValue=10000; private int nodeNum; public HaffmanTree(int n) { nodeNum=n; } public void haffman(int[] w