Huffman Coding in C++

/*--------------------------HUFFMANCODEFORTEXTFILECOMPRESSION----/*--------------------------HUFFMANCODEFORT EXTFILECOMPRESSION-----------------------------*/ #include #include /*-------------------------------GLOBALVARIAB /*------------------------------GLOBALVARIABLESDECLARATION---------LESDECLARATION----------------------------------*/ #definemax20 intarray[max]; inti=0; ofstreammyfile("CODES.txt"); /*-----------------------------------NODESTRU /*----------------------------------NODESTRUCTURE-------------------CTURE--------------------------------------------*/ structnode { chardata; intfrequency; intcode[5]; node*next; node*left; node*right; }; structcodenode { intcode[10]; charalphabet; codenode*next; }; /*--------------------------------LINKEDLISTSTRUCTURE---------------/*--------------------------------LINKEDLIST STRUCTURE----------------------------------------*/ structlist { node*first; codenode*codefirst; voidinitialize() { first=NULL; codefirst=NULL; } /*-----------------------------------SORTEDIN /*----------------------------------SORTEDINSERTION-----------------SERTION--------------------------------------------*/ voidinsert(intval,charalphabet) { node*p; p=newnode; p->frequency=val; p->data=alphabet; p->next=NULL; p->left=NULL;

p->right=NULL; if(first==NULL) { first=p; } else { node*curr; node*prev; curr=first; if(curr->next==NULL) {  if(curr->frequency>=val) { p->next=curr; first=p; }  if(curr->frequencynext=p; } } elseif(first->next!=NULL) { curr=first;  if(p->frequency<=curr->frequency) { p->next=curr; first=p; } if(p->frequency>curr->frequency) { curr=first->next; prev=first; while(curr->frequencyfrequency&&curr->next!=NULL) { curr=curr->next; prev=prev->next; } if(p->frequency<=curr->frequency) { p->next=prev->next; prev->next=p; } elseif(curr->next==NULL) { curr->next=p;} } }

} } /*-----------------------------------CODEINSERTION------------------------------------*/ voidcodeinsertion(charletter,intencode[]) { codenode*p; p=newcodenode; p->next=NULL; p->alphabet=letter; for(inti=0;i<10;i++) { if(encode[i]==0||encode[i]==1) p->code[i]=encode[i]; else break; } if(codefirst==NULL) { codefirst=p; } else { codenode*search; search=codefirst; while(search->next!=NULL) { search=search->next; } search->next=p; } } voidcodetraverse() { codenode*print; print=codefirst; while(print!=NULL) { cout<<"Alphabet="<alphabet<code[k]==0||print->code[k]==1) { cout<code[k]; } else break; } print=print->next; cout<
} /*-----------------------------------DELFIRSTCASE------------------------------------*/ boolisemptydelfirst(int&frequency,char&character) { node*del1; if(first==NULL) { cout<<"emptylist"<frequency; character=del1->data; first=first->next; deletedel1; returnfalse; } } /*--------------------------INSERTIONFROMLINKEDLISTTOQ-------------------------------*/ voidgivetoQ() { node*print; print=first; while(print->next!=NULL) { cout<data<<"=="<frequency<next; } cout<data<<"=="<frequency<
}; /*-----------------------------------------QUEUE-------------------------------------------*/ structQueue { node*front; node*rear;

voidinitial() { rear=NULL; front=NULL; } boolisempty() { if(rear==NULL&&front==NULL) returntrue; else returnfalse; } /*-----------------------------------QUEUEINSERTION------------------------------------*/ voidinsert(charx) { node*p; p=newnode; p->data=x; p->frequency=1; p->next=NULL; p->left=NULL; p->right=NULL; if(rear==NULL) { rear=p; front=p; } else { if(duality(x)==false) { rear->next=p; rear=p; } } } /*-----------------------------------QUEUETRAVERSE------------------------------------*/ voidtraverse() { node*search; search=front; if(rear==NULL&&front==NULL) { cout<<"Empty"<
cout<data; cout<<""<frequency<next; } cout<data; cout<<""<frequency<
/*-----------------------------------DUALITYCHECKFORQ------------------------------------*/ boolduality(charinput) { node*search; search=front; intcount=0; while(search!=rear) { if(search->data==input) { count++; search->frequency++; } search=search->next; } if(search->data==input) { count++; search->frequency++; } if(count==0) returnfalse; else returntrue; } /*----------------------------------------REMOVE--------------------------------------------*/ voidremove(char&x,int&f) { node*temp; temp=front; x=temp->data; f=temp->frequency; if(temp->next!=NULL) { front=temp->next; deletetemp;  } if(temp->next==NULL) {

deletetemp; front=NULL; rear=NULL; } } /*-----------------------------------SECONDINSERTION------------------------------------*/ voidsimpleinsert(intf,charx) { node*p; p=newnode; p->data=x; p->frequency=f; p->next=NULL; p->left=NULL; p->right=NULL; if(rear==NULL) { rear=p; front=p; } rear->next=p; rear=p; } /*-----------------------------------MAKETREEFROMQUEUE------------------------------------*/ voidmaketree() { node*start; start=front; node*leftnode; node*rightnode; node*last; while(start->next->next!=NULL) { node*nyt; nyt=newnode; nyt->data='*'; leftnode=start; rightnode=start->next; nyt->left=leftnode; nyt->right=rightnode; nyt->frequency=leftnode->frequency+rightnode->frequency; cout<<"NYT"<frequency<<"contains:"<fr equency<frequency<next->next; cout<<"Start:"<data<next=NULL;

rightnode->next=NULL; cout<<"Start:"<data<frequency<next!=NULL) { cout<next->data<next->frequency< next!=NULL"<frequency>=start->next->frequency) { { cout<<"LoopWorked"<data<fre quency<next; cout<<"StartUpdated"<data<frequency<next==NULL) break; } } cout<<"NowStart:"<data<next=start->next; start->next=nyt; start=front; cout<<"ATTHEENDOFTHISSHOW:"<data<frequency<frequency<<"SIBLINGS:"<left->d ata<<""<right->data<data='*'; if(last->frequency>start->frequency) { nyt->right=last; nyt->left=start; } else { nyt->right=start; nyt->left=last; } nyt->frequency=last->frequency+start->frequency; front=rear=nyt; } /*-----------------------------------GENERATINGCODES------------------------------------*/

voidtreetraverse(node*root) { cout<<"Started:TheTraversal"<left); i--; codenode*p; p=newcodenode; for(intj=0;jcode[j]=array[j]; cout<<"p->code["<code[j]<data<alphabet=root->data; cout<data<right); i--;  } } /*-----------------------------------CREATEENCODEDFILE------------------------------------*/ voidencodefile() { } /*-----------------------------------DECODETREECREATION------------------------------------*/ voiddecodetree() { } };

voidmain() { charintake,m; char*buff;

intf; Queuek; listl; l.initialize(); k.initial(); ifstreammyfile("input.txt"); if(!myfile) { cout<<"can'tload"<>intake) //while(!myfile.eof()) { //myfile.read(buff,1); //k.insert((char)buff); k.insert(intake); } } while(k.isempty()!=true) { k.remove(m,f); cout<<"Char="<frequency,point->data); point=point->next; } node*tree; tree=k.front; k.traverse(); k.maketree(); cout<<"TREECREATED"<

Huffman Coding in C++

Recommend Documents