当前位置：首页 > 电商 > 正文

maxleaf（tonbridge）

电商
2022-05-05 02:36:58

摘要： 用c语言解决数据结构哈夫曼树问题 # include "字符串。h " # include " stdio。h " #定义最大值1000/*定义最大权值*/#...

用c语言解决数据结构哈夫曼树问题

# include "字符串。h " # include " stdio。h " #定义最大值1000/*定义最大权值*/#定义MAXLEAF 30 /*定义哈夫曼树叶结点个数*/#定义MAXNODE MAXLEAF * 2-1 #定义最大位30/*定义哈夫曼编码的最大长度*/typedef struct { int bit[max bit]；int start } HCODETYPEtypedef结构{ int weightnt parent int lchildint rchild } HNODETYPEchar * getcode 1(char * S1，char *s2，char *s3) /*首先去掉电文中的空格*/{ char temp[128]=" "，*p，* q；p=s1while ((q=strstr(p，s2))！=NULL){ * q=" \ 0 "；strcat(温度，p)；strcat(温度，S3)；p=q strlen(S2)；}strcat(temp，p)；strcpy(s1，temp)；返回S1；}/*再去掉重复出现的字符（即压缩电文),提取哈夫曼树叶结点*/char * get代码(char * S1){ char S2[26]，S5[26]；char temp[200]=" "，*p，*q，*r，* s3=int m，e，n=0；m=斯特伦(S1)；而(m0){ p=S1；S2[0]=S1[0]；S2[1]=" \ 0 "；r=s2e=0；while((q=strstr(p，r))！=NULL){ * q=" \ 0 "；strcat(温度，p)；strcat(温度，S3)；p=q strlen(S2)；e；} m-=e；strcat(温度，p)；strcpy(s1，temp)；S5[n]=S2[0]；n；strcpy(temp，" ")；} S5[n]=" \ 0 "；strcpy(s1，S5)；printf("压缩后的电文（即叶结点): %s\n "，S1)；返回S1；}HNODETYPE huffmantree(char *s2，char S3[]){ hnode type huffnode[MAXNODE]；HCODETYPE huffcode[MAXLEAF]，CD；int sum，I，j，n1，n2，x1，x2，p，k，c；char s1[26]={"a "，" b "，" c "，" d "，" e "，" f "，" g "，" h "，" I "，" j "，" k "，" l "，" m "，" n "，" o "，" p "，" q "，" r "，" s "，" t "，" u "，" v "，" w "，" x "，" y "，" z " }；char S5[MAXLEAF]；int ww[26]={0}，n=0；strcpy(中五，S2)；sum=strlen(S2)；for(I=0；i26i ) /*统计所有字符出现的频度*/for(j=0；j

用c语言解决数据结构哈夫曼树问题

赫夫曼树

注：第一题 huffman 树以及 huffman编码我将第二题与第三题与用邻接矩阵存储图相关的操作放在了一起完成第三题则是利用邻接表1.第一题#include#include#include#include#define LEN 8 #define MAXLEAF 6 //最大叶子结点数目 #define MAXNODE (MAXLEAF*2)-1typedef float ElemType;typedef struct /* this structure stores the information of code */{ int start; /* 存放编码的起始位置右至左（高位至低位）*/ int bit[LEN]; /* 存放 huffman编码 */}HCode;typedef HCode HuffCode[MAXLEAF];typedef struct /* huffman tree结点的结构 */{ int parent; int LChild; int RChild; ElemType weight;}HNode;typedef HNode Huffman[MAXLEAF*2-1]; void createHuffmanTree(Huffman h,int leaves,ElemType *weight){ int i,j; for(i=0;iparent=-1; (h+i)->LChild=-1; (h+i)->RChild=-1; (h+i)->weight=0; } for(i=0;iweight=*(weight+i); } /* 上一个循环叶子已经带权,下面这个循环用来生成新根 * 新根数量为n-1 */ for(i=0;iweightparent==-1) { m2=m1; m1=(h+j)->weight; m2_pos=m1_pos; m1_pos=j; }else if((h+j)->weightparent==-1) { m2=(h+j)->weight; m2_pos=j; } } (h+leaves+i)->parent=-1; //生成新根，无双亲-1 (h+leaves+i)->LChild=m1_pos; //新根左孩子在数组中的下标 (h+leaves+i)->RChild=m2_pos; //新根右孩子在数组中的下标 (h+m1_pos)->parent=leaves+i; //原根的父亲位置 (h+m2_pos)->parent=leaves+i; //原根的父亲位置 (h+leaves+i)->weight=m2+m1; }}void huffmancode(Huffman h,HuffCode code,int leaves){ int i,j,p,c; HCode hf; /*从叶子结点开始向上回溯从而计算出huffman code */ for(i=0;ib /\ | c首先输入顶点与弧的数目 3 2提示输入顶点abc输入弧（弧头弧尾）abca那些插入以及删除的操作已经放入主函数顾回车后可以看到进行相关操作后图的变化#include#include#define MAXVERT 10 //需要在图中进行插入操作所以设定一个最大值 #define INFINITE 32767#define ERROR -1#define FALSE 0#define OK 1typedef int ElemType;enum maritype{DG,UDG,DN,UDN};typedef struct{ char vertex[MAXVERT]; ElemType arc[MAXVERT][MAXVERT]; int ArcNum; int VertexNum;}adjacentMatrix;int locate(adjacentMatrix *G,char v){ int i, k=ERROR; for(i=0;iVertexNum;i++) { if(G->vertex[i]==v) { k=i; break; } } return(k);} void init(adjacentMatrix *G){ int i,j; for(i=0;iVertexNum;i++) { for(j=0;jVertexNum;j++) { G->arc[i][j]=0; } }}void createDN(adjacentMatrix *G){ int i,j,k; char v1,v2,blank; printf("请输入顶点与弧的数目 \n"); scanf("%d%d",&G-;>VertexNum,&G-;>ArcNum); init(G); printf("请输入顶点（用字母表示）:\n"); getchar(); for(i=0;iVertexNum;i++) { scanf("%c",&G-;>vertex[i]); } getchar(); for(i=0;iArcNum;i++) { printf("请输入弧%d的弧头与弧尾",i+1); scanf("%c%c",&v1;,&v2;); getchar(); j=locate(G,v1); k=locate(G,v2); G->arc[j][k]=1; }}int InsertVex(adjacentMatrix *G,char v) /* insert vertex */{ int i; if(G->VertexNum>MAXVERT-1) { return(FALSE); } G->vertex[G->VertexNum++]=v; for(i=0;iVertexNum;i++) { G->arc[i][G->VertexNum-1]=G->arc[G->VertexNum-1][i]=0; } return(OK);}int InsertAar(adjacentMatrix *G,char v,char w) //插入边{ int i,j; i=locate(G,v); j=locate(G,w); if(i==-1||j==-1) { return(FALSE); } G->arc[i][j]=1; return(OK);}int DeleteVex(adjacentMatrix *G,char v) //（删除顶点）{ int i, k; k=locate(G,v); if(k==-1) { printf("The vertex has not found\n"); return(FALSE); } for(i=k;iVertexNum;i++) { G->vertex[i]=G->vertex[i+1]; } --G->VertexNum; return(OK);}int DeleteArc(adjacentMatrix *G,char v,char w){ int i,j; i=locate(G,v); j=locate(G,w); if(i==-1||j==-1) { return(ERROR); } G->arc[i][j]=0; return(OK);}void degree(adjacentMatrix *G){ int i, j, odsum, idsum, zero=0; for(i=0;iVertexNum;i++) { odsum=0; idsum=0; for(j=0;jVertexNum;j++) { odsum+=G->arc[i][j]; idsum+=G->arc[j][i]; } if(!odsum) { ++zero; } printf("顶点 %c 的出度与入度是",G->vertex[i]); printf("%3d%3d\n",odsum,idsum); } printf("度为0的顶点 %d\n",zero);}void print(adjacentMatrix *G){ int i,j; for(i=0;iVertexNum;i++) { printf("%8c",G->vertex[i]); } printf("\n"); for(i=0;iVertexNum;i++) { for(j=0;jVertexNum;j++) { if(!j) { printf("%c",G->vertex[i]); } printf("%8d",G->arc[i][j]); } printf("\n"); }}int main(void){ int k; char v, w; adjacentMatrix G; createDN(&G;); print(&G;); //邻接矩阵打印 degree(&G;); //求所有顶点出度入度及度为0的点 InsertVex(&G;,"f"); //插入顶点f InsertAar(&G;,"f","c"); //插入边 fc degree(&G;); //观察插入边顶点后度的变化 print(&G;); //邻接矩阵打印 DeleteArc(&G;,"f","c"); //删除边 fc print(&G;); //邻接矩阵打印观察变化 DeleteVex(&G;,"a"); //删除顶点a print(&G;); //邻接矩阵打印观察删除顶点a后变化 system("pause"); return(0);}3.使用同上示例图也如上所画使用方式也基本一直按你的要求只输出顶点的出度入度以及度为0的顶点#include#include#define MAX_VERTEX_NUM 10#define ERROR -1#define FALSE 0#define OK 1typedef char VertexType;typedef struct ArcNode //边表的结构 { int adjvex; //与顶点相邻接的顶点在表头结点表（图中）的位置 struct ArcNode *nextarc;}ArcNode;typedef struct VertexNode //表头结点表的结构 { VertexType data; ArcNode *firstarc;}VertexNode;typedef struct //存放图信息的结构 { int vexnum, arcnum; //顶点与弧的数目 VertexNode vertex[MAX_VERTEX_NUM];}Adjlist;int locate(Adjlist *G,char v){ int i, k=ERROR; for(i=0;ivexnum;i++) { if(G->vertex[i].data==v) { k=i; break; } } return(k);} void createDG(Adjlist *G){ int i, j, k; char v1, v2; ArcNode *s; printf("输入顶点与弧的数目 \n"); scanf("%d%d",&G-;>vexnum,&G-;>arcnum); getchar(); printf("请输入顶点（用字母表示）:"); for(i=0;ivexnum;i++) //生成表头结点表 { scanf("%c",&G-;>vertex[i].data); G->vertex[i].firstarc=NULL; } getchar(); for(i=0;iarcnum;i++) { printf("请输入第%d条边的信息弧尾与弧头:",i+1); scanf("%c%c",&v1;,&v2;); getchar(); j=locate(G,v1); k=locate(G,v2); s=(ArcNode *)malloc(sizeof(ArcNode)); s->adjvex=k; s->nextarc=G->vertex[j].firstarc; G->vertex[j].firstarc=s; } }void od(Adjlist *G){ int odsum, i; ArcNode *p; for(i=0;ivexnum;i++) //生成表头结点表 { odsum=0; p=G->vertex[i].firstarc; while(p) { ++odsum; p=p->nextarc; } printf("\n%c的出度是:%d\n ",G->vertex[i].data,odsum); }}void ind(Adjlist *G){ int insum, i, j, k; ArcNode *p; for(i=0;ivexnum;i++) //生成表头结点表 { insum=0; for(j=0;jvexnum;j++) { if(i==j) { continue; } p=G->vertex[j].firstarc; while(p) { if(p->adjvex==i) { ++insum; } p=p->nextarc; } } printf("\n%c的入度是:%d\n ",G->vertex[i].data,insum); }}int main(void){ Adjlist G; int i; createDG(&G;); od(&G;); ind(&G;); system("pause"); return(0);}

赫夫曼树

哈夫曼树及哈夫曼编码的C程序实现(数据结构题)

去年做的课程设计，有什么不合要求的自己改改 #include #include #include int m,s1,s2; typedef struct { unsigned int weight; unsigned int parent,lchild,rchild; }HTNode,*HuffmanTree; //动态分配数组存储哈夫曼树 typedef char *HuffmanCode; //动态分配数组存储哈夫曼编码表 void Select(HuffmanTree HT,int n) { int i,j; for(i = 1;i <= n;i++) if(!HT[i].parent){s1 = i;break;} for(j = i+1;j <= n;j++) if(!HT[j].parent){s2 = j;break;} for(i = 1;i <= n;i++) if((HT[s1].weight>HT[i].weight)&&(!HT[i].parent)&&(s2!=i))s1=i; for(j = 1;j <= n;j++) if((HT[s2].weight>HT[j].weight)&&(!HT[j].parent)&&(s1!=j))s2=j; } void HuffmanCoding(HuffmanTree &HT;, HuffmanCode HC[], int *w, int n) { //算法6.13 //w存放n个字符的权值(均>0)，构造哈夫曼树HT， //并求出n个字符的哈夫曼编码HC int i, j; char *cd; int p; int cdlen; if (n<=1) return; m = 2 * n - 1; HT = (HuffmanTree)malloc((m+1) * sizeof(HTNode)); //0号单元未用 for (i=1; i<=n; i++) { //初始化 HT[i].weight=w[i-1]; HT[i].parent=0; HT[i].lchild=0; HT[i].rchild=0; } for (i=n+1; i<=m; i++) { //初始化 HT[i].weight=0; HT[i].parent=0; HT[i].lchild=0; HT[i].rchild=0; } puts("\n哈夫曼树的构造过程如下所示："); printf("HT初态:\n 结点 weight parent lchild rchild"); for (i=1; i<=m; i++) printf("\n%4d%8d%8d%8d%8d",i,HT[i].weight, HT[i].parent,HT[i].lchild, HT[i].rchild); printf(" 按任意键，继续 ..."); getchar(); for (i=n+1; i<=m; i++) { //建哈夫曼树 //在HT[1..i-1]中选择parent为0且weight最小的两个结点， //其序号分别为s1和s2。 Select(HT, i-1); HT[s1].parent = i; HT[s2].parent = i; HT[i].lchild = s1; HT[i].rchild = s2; HT[i].weight = HT[s1].weight + HT[s2].weight; printf("\nselect: s1=%d s2=%d\n", s1, s2); printf(" 结点 weight parent lchild rchild"); for (j=1; j<=i; j++) printf("\n%4d%8d%8d%8d%8d",j,HT[j].weight, HT[j].parent,HT[j].lchild, HT[j].rchild); printf(" 按任意键，继续 ..."); getchar(); } //------无栈非递归遍历哈夫曼树，求哈夫曼编码 cd = (char *)malloc(n*sizeof(char)); //分配求编码的工作空间 p = m; cdlen = 0; for (i=1; i<=m; ++i) //遍历哈夫曼树时用作结点状态标志 HT[i].weight = 0; while (p) { if (HT[p].weight==0) { //向左 HT[p].weight = 1; if (HT[p].lchild != 0) { p = HT[p].lchild; cd[cdlen++] ="0"; } else if (HT[p].rchild == 0) { //登记叶子结点的字符的编码 HC[p] = (char *)malloc((cdlen+1) * sizeof(char)); cd[cdlen] ="\0"; strcpy(HC[p], cd); //复制编码(串) } } else if (HT[p].weight==1) { //向右 HT[p].weight = 2; if (HT[p].rchild != 0) { p = HT[p].rchild; cd[cdlen++] ="1"; } } else { //HT[p].weight==2，退回退到父结点，编码长度减1 HT[p].weight = 0; p = HT[p].parent; --cdlen; } } } //HuffmanCoding void main() { HuffmanTree HT;HuffmanCode *HC;int *w,n,i; puts("输入结点数:"); scanf("%d",&n;); HC = (HuffmanCode *)malloc(n*sizeof(HuffmanCode)); w = (int *)malloc(n*sizeof(int)); printf("输入%d个结点的权值\n",n); for(i = 0;i < n;i++) scanf("%d",&w;[i]); HuffmanCoding(HT,HC,w,n); puts("\n各结点的哈夫曼编码:"); for(i = 1;i <= n;i++) printf("%2d(%4d):%s\n",i,w[i-1],HC[i]); getchar(); }

哈夫曼树及哈夫曼编码的C程序实现(数据结构题)