数据结构算法集---C++语言实现
生活随笔
收集整理的這篇文章主要介紹了
数据结构算法集---C++语言实现
小編覺得挺不錯的,現(xiàn)在分享給大家,幫大家做個參考.
///
// //
// 堆棧數(shù)據(jù)結(jié)構(gòu) stack.h //
// //
/// #include<iostream.h> template<class Type>class Stack; template<class Type>
class StackNode
{ friend class Stack<Type>;
private: Type data; StackNode<Type> *link; StackNode(Type D=0,StackNode<Type> *L=NULL):link(L),data(D)...{}
}; template<class Type>
class Stack
{
public: Stack():top(NULL),NumItem(0)...{} void Push(Type item); Type Pop(); Type GetTop(); void MakeEmpty(); bool ISEmpty(); int GetNum();
private: int NumItem; StackNode<Type> *top;
}; template<class Type>
void Stack<Type>::Push(Type item)
{ top=new StackNode<Type>(item,top); NumItem++;
} template<class Type>
Type Stack<Type>::Pop()
{ StackNode<Type> *p; Type temp; temp=top->data; p=top; top=top->link; delete p; NumItem--; return temp;
} template<class Type>
Type Stack<Type>::GetTop()
{ return top->data;
} template<class Type>
bool Stack<Type>::ISEmpty()
{ return top==NULL;
} template<class Type>
void Stack<Type>::MakeEmpty()
{ delete top;
} template<class Type>
int Stack<Type>::GetNum()
{ return NumItem;
} // //
// 隊列數(shù)據(jù)結(jié)構(gòu) Queue.h //
// // #include<iostream.h> template<class Type> class Queue; template<class Type> class QueueNode
{ friend class Queue<Type>;
private: Type data; QueueNode<Type> *link; QueueNode(Type d=0,QueueNode *l=NULL):data(d),link(l)...{}
}; template <class Type> class Queue
{
public: Queue():rear(NULL),front(NULL)...{} ~Queue(); void EnQueue(Type item); Type DelQueue(); Type GetFront(); void MakeEmpty(); bool ISEmpty() ...{ return front==NULL; }
private: QueueNode<Type> *front,*rear;
}; template<class Type>
Queue<Type>::~Queue()
{ QueueNode<Type> *p; while(front!=NULL) { p=front; front=front->link; delete p; }
} template<class Type>
void Queue<Type>::EnQueue(Type item)
{ if(front==NULL) front=rear=new QueueNode<Type> (item,NULL); else rear=rear->link=new QueueNode<Type> (item,NULL);
} template<class Type>
Type Queue<Type>::DelQueue()
{ QueueNode<Type> *p=front; Type temp=p->data;; front=front->link; delete p; return temp;
} template<class Type>
Type Queue<Type>::GetFront()
{ return front->data;
} template<class Type>
void Queue<Type>::MakeEmpty()
{ QueueNode<Type> *p; while(front!=NULL) ...{ p=front; front=front->link; delete p; }
} // //
// 鏈表數(shù)據(jù)結(jié)構(gòu) list.h //
// //
// #include<iostream.h> template<class type>
class list; template<class type>
class listnode
{
public: friend class list<type>;
private: type data; listnode<type> * next;
}; template<class type>
class list
{
public: list(); ~list(); void insertend(type); //向鏈表尾部插入元素 bool insert(type,int); //向鏈表任意位置插入元素 void delnode(int i); //刪除元素 int find(type T); //查找元素 void makeempty(); //銷毀鏈表 bool print(); //打印鏈表 int getlen(); //得到鏈表長度
private: listnode<type> *first,*last; int length;
}; template<class type>
void initlist(type &tmp); template<class type>
void list_exit(list<type> &L,type tmp); void initation(); template<class type>
void list_insertend(list<type> &L,type tmp); template<class type> int list<type>::getlen()
{ return length;
} template<class type> void list<type>::makeempty()
{ listnode<type> *p1,*p2; p1=first->next; first->next=NULL; while(p1!=NULL) { p2=p1; p1=p1->next; delete p2; } length=0;
} template<class type> void list<type>::insertend(type t)
{ listnode<type> *p; p=new listnode<type>; p->data=t; p->next=NULL; last->next=p; last=p; length++;
} template<class type> bool list<type>::insert(type t,int i)
{ listnode<type> *p; p=first; int k=1; while(p!=NULL&&k<i) { p=p->next; k++; } if(p==NULL&&k!=i) return false; else { listnode<type> *tp; tp=new listnode<type>; tp->data=t; tp->next=p->next; p->next=tp; length++; return true; }
} template<class type> void list<type>::delnode(int i)
{ int k=1; listnode<type> *p,*t; p=first; while(p->next!=NULL&&k!=i) { p=p->next; k++; } t=p->next; cout<<"你已經(jīng)將數(shù)據(jù)項 "<<t->data<<"刪除"<<endl; p->next=p->next->next; length--; delete t;
} template<class type> bool list<type>::print()
{ listnode<type> *p=first->next; if(length==0) return false; else { cout<<"鏈表中有"<<length<<"項數(shù)據(jù): "<<endl; while(p) { cout<<p->data<<" "; p=p->next; } } cout<<endl; return true;
} template<class type> int list<type>::find(type T)
{ listnode<type> *p=first->next; int i=1; while(p&&p->data!=T) { p=p->next; i++; } if(p) return i; else return 0;
} template<class type> list<type>::~list()
{ delete first; cout<<"歡迎再次使用 (!^!) "<<endl;
} template<class type> list<type>::list()
{ listnode<type> *node=new listnode<type>; node->next=NULL; first=last=node; length=0;
} // //
// 圖數(shù)據(jù)結(jié)構(gòu) graph.h //
// //
/// #include<iostream.h>
#include"Queue.h" template<class NameType,class DisType>class Graph; template<class NameType,class DisType> struct Node
{ friend class Graph<NameType,DisType>; int num; DisType val; Node<NameType,DisType> *next;
}; template<class NameType,class DisType> struct GpNode
{ friend class Graph<NameType,DisType>; NameType data; Node<NameType,DisType> *link;
}; template<class NameType,class DisType>
class Graph
{
public: void Creat(); //創(chuàng)建圖 void PrintNode(); //打印圖中的各個數(shù)據(jù)項 void DFS(); //圖的深度優(yōu)先搜索,主過程 void DFS(int v,int visited[]); // 子過程 void BFS(); //圖的廣度優(yōu)先搜索，主過程 void BFS(int v,int visited[]); //子過程 void ShortPath(); //求最短路徑
private: GpNode<NameType,DisType> *table; Node<NameType,DisType> *p; int NumNode; //節(jié)點個數(shù)
}; template<class NameType,class DisType>
void Graph<NameType,DisType>::Creat()
{ do { cout<<"請輸入節(jié)點個數(shù): "; cin >> NumNode; }while(NumNode<=0); table=new GpNode<NameType,DisType>[NumNode]; cout<<"請輸入各節(jié)點數(shù)據(jù)項"<<endl; for(int i=0;i<NumNode;i++) { cin>>table[i].data; table[i].link=NULL; } cout<<"請輸入各邊的關(guān)系 (如: A B)"<<endl; i=1; NameType nodeA,nodeB; bool findA,findB; char ISExit; int m,n; do { findA=findB=false; cout<<"請輸入第"<<i<<"對邊的關(guān)系"<<endl; cin>>nodeA>>nodeB; for(m=0,n=0;m<NumNode&&n<NumNode&&!(findA & findB);) //查找邊的節(jié)點 { if(nodeA!=table[m].data) m++; else findA=true; if(nodeB!=table[n].data) n++; else findB=true; } if(!(findA & findB)) cout<<"輸入的節(jié)點數(shù)據(jù)項有錯誤"<<endl; else { p=new Node<NameType,DisType>; p->next=table[m].link; p->num=n; table[m].link=p; cout<<"請輸入該對邊的權(quán)值: "; cin>>p->val; i++; } cout<<"是否繼續(xù)輸入: y)繼續(xù),X)任意鍵退出 "; cin>>ISExit; if(ISExit!='y'&&ISExit!='Y') break; }while(true); } template<class NameType,class DisType>
void Graph<NameType,DisType>::PrintNode()
{ cout<<"圖中各節(jié)點數(shù)據(jù)項 : "; for(int i=0;i<NumNode;i++) cout<<table[i].data<<" "; cout<<endl;
} template<class NameType,class DisType>
void Graph<NameType,DisType>::DFS()
{ int *visited=new int[NumNode]; cout<<"圖的深度優(yōu)先搜索 : "; for(int i=0;i<NumNode;i++) visited[i]=0; for(i=1;i<NumNode;i++) //遍厲孤立節(jié)點 DFS(i,visited); delete []visited; cout<<endl;
} template<class NameType,class DisType>
void Graph<NameType,DisType>::DFS(int v,int visited[])
{ Node<NameType,DisType> *t; if(visited[v]==0) cout<<table[v].data<<" "; visited[v]=1; t=table[v].link; while(t!=NULL) { if(visited[t->num]==0) DFS(t->num,visited); t=t->next; }
} template<class NameType,class DisType>
void Graph<NameType,DisType>::BFS()
{ int *visited=new int[NumNode]; cout<<"圖的廣度優(yōu)先搜索 : "; for(int i=0;i<NumNode;i++) visited[i]=0; for( i=0;i<NumNode;i++) BFS(i,visited);
} template<class NameType,class DisType>
void Graph<NameType,DisType>::BFS(int v,int visited[])
{ Queue<int> q; int n; if(visited[v]==0) { visited[v]=1; cout<<table[v].data<<" "; q.EnQueue(v); while(!q.ISEmpty()) { n=q.DelQueue(); p=table[n].link; while(p!=NULL) { n=p->num; if(visited[n]==0) { cout<<table[n].data<<" "; visited[n]=1; } p=p->next; } } } } // //
// 排序算法數(shù)據(jù)結(jié)構(gòu) Compositor.h //
// //
/// #include<iostream.h> template<class Type>
class Compositor
{
public: Compositor():sort(NULL)...{} void Creat(); //創(chuàng)建排序數(shù)組 void Bubble(); //冒泡排序 void Insert(); //插入排序 //快速排序 void Quick(); void QSort(int,int); int Partition(int low,int high); //歸并排序 void Merge(Type SR[],Type TR[],int i,int m,int n); void Msort(Type SR[],Type TR1[],int s,int t); void MergeSort(); //選擇排序 void Select(); void Print(); //打印排序后的結(jié)果
protected: Type *sort; int leng;
}; template<class Type>
void Compositor<Type>::Creat()
{ cout<<"輸入你需要排序的數(shù)據(jù)個數(shù): "; cin>>leng; while(leng<=0) { cout<<"輸入數(shù)據(jù)有誤"; cin>>leng; } sort=new Type[leng]; cout<<"請輸入各數(shù)據(jù)項："; for(int i=0;i<leng;i++) cin>>sort[i];
} template<class Type>
void Compositor<Type>::Insert()
{ Creat(); Type temp; for(int i=1;i<leng;i++) { if(sort[i]<sort[i-1]) { temp=sort[i]; for(int j=i-1;temp<sort[j]&&j>=0;j--) { sort[j+1]=sort[j]; } sort[j+1]=temp; } } Print(); } template<class Type>
void Compositor<Type>::Bubble()
{ Creat(); Type temp; for(int i=leng-1;i>=0;i--) { for(int j=0;j<leng-1;j++) { if(sort[j]>sort[j+1]) { temp=sort[j]; sort[j]=sort[j+1]; sort[j+1]=temp; } } } Print();
} template<class Type>
void Compositor<Type>::Quick()
{ Creat(); QSort(0,leng-1); Print();
} template<class Type>
void Compositor<Type>::QSort(int s,int t)
{ if(s<t-1) { int pivotloc=Partition(s,t); QSort(s,pivotloc-1); QSort(pivotloc+1,t); }
} template<class Type>
int Compositor<Type>::Partition(int low,int high)
{ Type pivotkey=sort[low]; while(low < high) { while(low<high&&sort[high]>=pivotkey) --high; sort[low++]=sort[high]; while(low<high&&sort[low]<=pivotkey) ++low; sort[high--]=sort[low]; } sort[low]=pivotkey; return low;
} template<class Type>
void Compositor<Type>::MergeSort()
{ Creat(); Msort(sort,sort,0,leng-1); Print();
} template<class Type>
void Compositor<Type>::Msort(Type SR[],Type TR1[],int s,int t)
{ int m; Type *TR2=new Type[t-s]; if(s==t) TR1[s]=SR[s]; else { m=(t+s)/2; Msort(SR,TR2,s,m); Msort(SR,TR2,m+1,t); Merge(TR2,TR1,s,m,t); }
} template<class Type>
void Compositor<Type>::Merge(Type SR[],Type TR[],int i,int m,int n)
{ for(int j=m+1,k=i;i<=m&&j<=n;k++) { if(SR[i]<=SR[j]) TR[k]=SR[i++]; else TR[k]=SR[j++]; } while(i<=m) TR[k++]=SR[i++]; while(j<=n) TR[k++]=SR[j++];
} template<class Type>
void Compositor<Type>::Select()
{ Creat(); Type temp; int t; for(int i=0;i<leng;i++) { t=i; for(int j=i+1;j<leng;j++) { if(sort[t]>sort[j]) t=j; } if(t!=i) { temp=sort[t]; sort[t]=sort[i]; sort[i]=temp; } } Print();
} template<class Type>
void Compositor<Type>::Print()
{ cout<<"排序結(jié)果為: "; for(int i=0;i<leng;i++) cout<<sort[i]<<" "; cout<<endl;
} // //
// 二叉樹數(shù)據(jù)結(jié)構(gòu) BinTree.h //
// //
/// #include<iostream.h> template<class Type>class BinTree; template<class Type>
class TreeNode
{
protected: friend class BinTree<Type>; TreeNode():lchild(NULL),rchild(NULL)...{} Type data; TreeNode *lchild; //左，右子樹 TreeNode *rchild;
}; template<class Type>
class BinTree
{ friend void BinTree_PRE(BinTree<Type>& BinTreeOPP); //友元函數(shù) friend void BinTree_INO(BinTree<Type>& BinTreeOPP); friend void BinTree_POS(BinTree<Type>& BinTreeOPP); friend void BinTree_Destroy(BinTree<Type>& BinTreeOPP);
public: BinTree():root(NULL)...{} void CreatTree(); //創(chuàng)建二叉樹,主過程 void CreatTree(TreeNode<Type>* child,int k); //子過程 void PreTree(TreeNode<Type> *point); //先序遍歷二叉樹 void InoTree(TreeNode<Type> *point); //中序遍歷二叉樹 void PosTree(TreeNode<Type> *point); //后序遍歷二叉樹 void Destroy(TreeNode<Type> *point); //銷毀二叉樹 bool ISEmpty();
protected: TreeNode<Type>* root;
}; template<class Type>
void BinTree<Type>::CreatTree()
{ CreatTree(root,1);
} template<class Type>
void BinTree<Type>::CreatTree(TreeNode<Type>* child,int k)
{ TreeNode<Type>* point; point=new TreeNode<Type>; cout<<"輸入節(jié)點數(shù)據(jù)項 :"; cin>>point->data; switch(k) { case 1: root=point; break; case 2: child->lchild=point;break; case 3: child->rchild=point;break; } char temp; cout<<"該"<<point->data<<"節(jié)點是否有左子樹 Y / 任意鍵 :"; cin>>temp; if(temp=='y'||temp=='Y') { CreatTree(point,2); } cout<<"該"<<point->data<<"節(jié)點是否有右子樹 Y / 任意鍵 :"; cin>>temp; if(temp=='y'||temp=='Y') { CreatTree(point,3); }
} template<class Type>
void BinTree<Type>::PreTree(TreeNode<Type> *point)
{ if(point!=NULL) { cout<<" "<<point->data; PreTree(point->lchild); PreTree(point->rchild); }
} template<class Type>
void BinTree<Type>::InoTree(TreeNode<Type> *point)
{ if(point!=NULL) { InoTree(point->lchild); cout<<" "<<point->data; InoTree(point->rchild); }
} template<class Type>
void BinTree<Type>::PosTree(TreeNode<Type> *point)
{ if(point!=NULL) { PosTree(point->lchild); PosTree(point->rchild); cout<<" "<<point->data; }
} template<class Type>
bool BinTree<Type>::ISEmpty()
{ return root==NULL;
} template<class Type>
void BinTree<Type>::Destroy(TreeNode<Type> *point)
{ if(point!=NULL) { Destroy(point->lchild); Destroy(point->rchild); delete point; }
} ///
// //
// 基本功能函數(shù) BaseFun.h //
// //
/// void GRAPH();
void LIST();
void STACK();
void QUEUE();
void COMPOSITOR();
void BINTREE(); /
// //
// 堆棧功能函數(shù) Stack.cpp/ /
// // #include"Stack.h"
#include"iostream.h" const int INT =13;
const double FLOAT= 13.33;
const char CHAR ='a'; template<class Type>
void Stack_Push(Stack<Type> &StackOPP)
{ cout<<"請輸入要插入的數(shù)據(jù)項: "; Type item; cin>>item; StackOPP.Push(item);
} template<class Type>
void Stack_Pop(Stack<Type> &StackOPP)
{ if(!StackOPP.ISEmpty()) { cout<<"出棧數(shù)據(jù)項: "; cout<<StackOPP.Pop()<<endl; } else { cout<<"堆棧已經(jīng)為空!"<<endl; }
} template<class Type>
void Stack_ISEmpty(Stack<Type> &StackOPP)
{ if(!StackOPP.ISEmpty()) cout<<"堆棧不空,還有"<<StackOPP.GetNum()<<"數(shù)據(jù)項!"<<endl; else cout<<"堆棧為空!"<<endl; } template<class Type>
void Stack_GetTop(Stack<Type> &StackOPP)
{ if(!StackOPP.ISEmpty()) cout<<"棧頂元素為："<<StackOPP.GetTop()<<endl; else cout<<"堆棧為空!"<<endl;
} template<class Type>
void Stack_MakeEmpty(Stack<Type> &StackOPP)
{ if(!StackOPP.ISEmpty()) { StackOPP.MakeEmpty(); cout<<"堆棧已經(jīng)銷毀!"<<endl; } else { cout<<"銷毀失敗!"<<endl; }
} template<class Type>
void StackINI(Type temp)
{ Stack<Type> StackOPP; do { cout<<"堆棧的操作: "<<endl <<" 1) 插入堆棧"<<endl <<" 2) 出棧"<<endl <<" 3) 堆棧是否為空"<<endl <<" 4) 得棧頂數(shù)據(jù)項"<<endl <<" 5) 銷毀堆棧"<<endl <<" X) 退出堆棧操作"<<endl; int item; cin>>item; switch(item) { case 1: Stack_Push(StackOPP); break; case 2: Stack_Pop(StackOPP); break; case 3: Stack_ISEmpty(StackOPP); break; case 4: Stack_GetTop(StackOPP); break; case 5: Stack_MakeEmpty(StackOPP); break; default: return ; } }while(true); } void STACK()
{ int item; cout<<"清選擇數(shù)據(jù)類型: 1) 整型 2) 浮點型 3) 字符型 X) 退出: "; cin>>item; switch(item) { case 1: StackINI(INT); break; //根據(jù)不同的用戶需要選擇數(shù)據(jù)類型 case 2: StackINI(FLOAT); break; case 3: StackINI(CHAR); break; default: return ; break; }
} /
// //
// 隊列功能函數(shù) Queue.h //
// // #include"Queue.h" const int INT =13;
const double FLOAT= 13.33;
const char CHAR ='a'; template<class Type>
void Queue_Enter(Queue<Type> &QueueOPP)
{ cout<<"請輸入要插入隊列的數(shù)據(jù): "; Type item; cin>>item; QueueOPP.EnQueue(item);
} template<class Type>
void Queue_Del(Queue<Type> &QueueOPP)
{ if(!QueueOPP.ISEmpty()) { cout<<"出隊數(shù)據(jù):"<<QueueOPP.DelQueue()<<endl; } else { cout<<"隊列已為空!"<<endl; }
} template<class Type>
void Queue_ISEmpty(Queue<Type> &QueueOPP)
{ if(QueueOPP.ISEmpty()) { cout<<"隊列已空!"<<endl; } else { cout<<"隊列不空!"<<endl; }
} template<class Type>
void Queue_GetFront(Queue<Type> &QueueOPP)
{ if(!QueueOPP.ISEmpty()) { cout<<"隊頭元素為: "<<QueueOPP.GetFront()<<endl; } else { cout<<"隊列已空!"<<endl; }
} template<class Type>
void Queue_MakeEmpty(Queue<Type> &QueueOPP)
{ QueueOPP.MakeEmpty(); cout<<"隊列清空!"<<endl;
} template<class Type>
void QueueINI(Type temp)
{ Queue<Type> QueueOPP; do { cout<<"隊列的操作: "<<endl <<" 1) 插入隊列"<<endl <<" 2) 出隊"<<endl <<" 3) 隊列是否為空"<<endl <<" 4) 得隊頭數(shù)據(jù)項"<<endl <<" 5) 銷毀隊列"<<endl <<" X) 退出隊列操作"<<endl; int item; cin>>item; switch(item) { case 1: Queue_Enter(QueueOPP); break; case 2: Queue_Del(QueueOPP); break; case 3: Queue_ISEmpty(QueueOPP); break; case 4: Queue_GetFront(QueueOPP); break; case 5: Queue_MakeEmpty(QueueOPP); break; default: return ; } }while(true); } void QUEUE() //根據(jù)不同的用戶需要選擇數(shù)據(jù)類型
{ int item; cout<<"清選擇數(shù)據(jù)類型: 1) 整型 2) 浮點型 3) 字符型 X) 退出: "; cin>>item; switch(item) { case 1: QueueINI(INT); break; case 2: QueueINI(FLOAT); break; case 3: QueueINI(CHAR); break; default: return ; break; }
} /
// //
// 鏈表 List.h //
// // #include"list.h"
#include<iostream.h>
#include<stdlib.h> template<class type>
void initlist(type &tmp)
{ list<type> List; int n; while(true) { cout<<"請選擇你要對鏈表進(jìn)行的操作 "<<endl <<"1) 在末尾插入數(shù)據(jù)"<<endl <<"2) 在任意處插入數(shù)據(jù)"<<endl <<"3) 刪除數(shù)據(jù)項"<<endl <<"4) 刪除整個鏈表"<<endl <<"5) 打印鏈表"<<endl <<"6) 查找數(shù)據(jù)項"<<endl <<"7) 退出"<<endl; cout<<"> "; cin>>n; while(n<1||n>7) { cout<<"輸入有誤，請從新輸入!"<<endl; cout<<"> "; cin>>n; } switch(n) { case 1: list_insertend(List);break; case 2: list_insert(List);break; case 3: list_delnode(List);break; case 4: list_makeempty(List);break; case 5: list_print(List);break; case 6: list_find(List);break; case 7: return ;break; } } } void LIST()
{ int n; cout<<"請選擇你要構(gòu)造的鏈表的數(shù)據(jù)類型 1)整型，2)字符型,3)浮點型"<<endl; cout<<"> "; cin>>n; while(n<1||n>3) { cout<<"輸入有誤，請從新輸入!"<<endl; cout<<"> "; cin>>n; } char t_c='c'; int t_i=12; double t_f=23.3; switch(n) { case 1:initlist(t_i);break; case 2:initlist(t_c);break; case 3:initlist(t_f);break; }
} template<class type>
void list_insertend(list<type> &L)
{ type t; cout<<"請輸入插入數(shù)據(jù): >"; cin>>t; L.insertend(t);
} template<class type>
void list_find(list<type> &L)
{ type T; cout<<"請輸入你要查找的數(shù)據(jù)項：> "; cin>>T; int i; if(!(i=L.find(T))) cout<<"你要查找的數(shù)據(jù)項不存在!"<<endl; else cout<<"你要查找的數(shù)據(jù)項在第"<<i<<"個位置"<<endl;
} template<class type>
void list_insert(list<type> &L)
{ type t; cout<<"請輸入插入數(shù)據(jù): >"; cin>>t; int n; cout<<"請輸入插入位置: >"; cin>>n; if(L.insert(t,n)) cout<<"插入成功! 在"<<n<<"位置 插入"<<t<<endl; else cout<<"插入失敗! 插入位置不正確!"<<endl; } template<class type>
void list_delnode(list<type>& L)
{ int i; cout<<"請輸入要刪除數(shù)據(jù)項的位置: >"; cin>>i; while(i<1||i>L.getlen()) { cout<<"輸入有誤，可能大與鏈表長度,請從新輸入!"<<endl; cout<<"> "; cin>>i; } L.delnode(i);
}
template<class type>
void list_makeempty(list<type> &L)
{ L.makeempty();
} template<class type>
void list_print(list<type> &L)
{ if(!L.print()) cout<<"鏈表為空!"<<endl;
} /
// //
// 圖功能函數(shù) Graph.h //
// // #include"Graph.h" template<class NameType,class DisType>
void Graph_Creat(Graph<NameType,DisType> &GraphOPP)
{ GraphOPP.Creat();
} template<class NameType,class DisType>
void Graph_DFS(Graph<NameType,DisType> &GraphOPP)
{ GraphOPP.DFS();
} template<class NameType,class DisType>
void Graph_BFS(Graph<NameType,DisType> &GraphOPP)
{ GraphOPP.BFS();
} template<class NameType,class DisType>
void Graph_PRINT(Graph<NameType,DisType> &GraphOPP)
{ GraphOPP.PrintNode();
} void GRAPH()
{ Graph<char,int> GraphOPP; do { cout<<"圖的操作: "<<endl <<" 1) 建立圖"<<endl <<" 2) 圖的深度優(yōu)先搜索"<<endl <<" 3) 圖的廣度優(yōu)先搜索"<<endl <<" 4) 打印圖中各結(jié)點"<<endl <<" X) 退出排序操作"<<endl; int item; cin>>item; switch(item) { case 1: Graph_Creat(GraphOPP); break; case 2: Graph_DFS(GraphOPP); break; case 3: Graph_BFS(GraphOPP); break; case 4: Graph_PRINT(GraphOPP); break; default: return ; } }while(true); } /
// //
// 排序算法功能函數(shù) Compositor.cpp //
// // #include"Compositor.h" const int INT =13;
const double FLOAT= 13.33;
const char CHAR ='a'; template<class type>
void CompositorINI(type temp)
{ Compositor<type> CompositorOPP; do { cout<<"排序的操作: "<<endl <<" 1) 插入排序"<<endl <<" 2) 快速排序"<<endl <<" 3) 歸并排序"<<endl <<" 4) 冒泡排序"<<endl <<" 5) 選擇排序"<<endl <<" X) 退出排序操作"<<endl <<"請選擇相應(yīng)的操作: "; int item; cin>>item; switch(item) { case 1: Compositor_Insert(CompositorOPP); break; case 2: Compositor_Quick(CompositorOPP); break; case 3: Compositor_Merge(CompositorOPP); break; case 4: Compositor_Bubble(CompositorOPP); break; case 5: Compositor_Select(CompositorOPP); break; default: return ; } }while(true); } void COMPOSITOR()//根據(jù)不同的用戶需要選擇數(shù)據(jù)類型
{ int item; cout<<"清選擇數(shù)據(jù)類型: 1) 整型 2) 浮點型 3) 字符型 X) 退出: "; cin>>item; switch(item) { case 1: CompositorINI(INT); break; case 2: CompositorINI(FLOAT); break; case 3: CompositorINI(CHAR); break; default: return ; break; }
} template<class type>
void Compositor_Insert(Compositor<type> CompositorOPP)
{ CompositorOPP.Insert();
} template<class type>
void Compositor_Quick(Compositor<type> CompositorOPP)
{ CompositorOPP.Quick();
} template<class type>
void Compositor_Select(Compositor<type> CompositorOPP)
{ CompositorOPP.Select();
} template<class type>
void Compositor_Merge(Compositor<type> CompositorOPP)
{ CompositorOPP.MergeSort();
} template<class type>
void Compositor_Bubble(Compositor<type> CompositorOPP)
{ CompositorOPP.Bubble();
} /
// //
// 二叉樹功能函數(shù) BinTree.cpp//
// // #include<iostream.h>
#include"BinTree.h" const int INT =13;
const double FLOAT= 13.33;
const char CHAR ='a'; template<class Type>
void BinTree_CREAT(BinTree<Type>& BinTreeOPP)
{ BinTreeOPP. CreatTree();
} template<class Type>
void BinTree_PRE(BinTree<Type>& BinTreeOPP)
{ if(!BinTreeOPP.ISEmpty()) { cout<<"先序遍歷二叉樹 : "; BinTreeOPP. PreTree(BinTreeOPP.root); } else { cout<<"二叉樹已經(jīng)為空!"<<endl; }
} template<class Type>
void BinTree_INO(BinTree<Type>& BinTreeOPP)
{ if(!BinTreeOPP.ISEmpty()) { cout<<"中序遍歷二叉樹 : "; BinTreeOPP. InoTree(BinTreeOPP.root); } else { cout<<"二叉樹已經(jīng)為空!"<<endl; } } template<class Type>
void BinTree_POS(BinTree<Type>& BinTreeOPP)
{ if(!BinTreeOPP.ISEmpty()) { cout<<"后序遍歷二叉樹 : "; BinTreeOPP. PosTree(BinTreeOPP.root); } else { cout<<"二叉樹已經(jīng)為空!"<<endl; }
} template<class Type>
void BinTree_Destroy(BinTree<Type>& BinTreeOPP)
{ BinTreeOPP.Destroy(BinTreeOPP.root); BinTreeOPP.root=NULL; cout<<"二叉樹已經(jīng)銷毀!"<<endl;
} template<class Type>
void BinTree_THREAD(BinTree<Type>& BinTreeOPP)
{ if(BinTreeOPP.ISThread()) { cout<<"該二叉樹已經(jīng)線索化!!"<<endl; } else { BinTreeOPP.ThreadTree(); }
} template<class Type>
void BinTree_THROUGH(BinTree<Type>& BinTreeOPP)
{ BinTreeOPP.Through();
} template<class Type>
void BinTreeINI(Type temp)
{ BinTree<Type> BinTreeOPP; do { cout<<"樹的操作: "<<endl <<" 1) 構(gòu)造二叉數(shù)"<<endl <<" 2) 先序遍歷二叉樹"<<endl <<" 3) 中序遍歷二叉樹"<<endl <<" 4) 后序遍歷二叉樹"<<endl <<" 5) 銷毀二叉樹 "<<endl <<" X) 退出二叉樹操作"<<endl; int item; cin>>item; switch(item) { case 1: BinTree_CREAT(BinTreeOPP); break; //構(gòu)造二叉數(shù) case 2: BinTree_PRE(BinTreeOPP); break; //先序遍歷二叉樹 case 3: BinTree_INO(BinTreeOPP); break; //中序遍歷二叉樹 case 4: BinTree_POS(BinTreeOPP); break; //后序遍歷二叉樹 case 5: BinTree_Destroy(BinTreeOPP);break; //求樹的深度 default: return ; } }while(true); } void BINTREE()
{ int item; cout<<"清選擇數(shù)據(jù)類型: 1) 整型 2) 浮點型 3) 字符型 X) 退出: "; cin>>item; switch(item) { case 1: BinTreeINI(INT); break; //根據(jù)不同的用戶需要選擇數(shù)據(jù)類型 case 2: BinTreeINI(FLOAT); break; case 3: BinTreeINI(CHAR); break; default: return ; break; }
} /
// //
// 主函數(shù) index.cpp 用戶菜單 //
// // #include <iostream.h>
#include"BaseFun.h" void main()
{ //功能菜單 do { cout<<"歡迎使用數(shù)據(jù)結(jié)構(gòu)算法集"<<endl <<"1) 線性表 "<<endl <<"2) 堆棧 "<<endl <<"3) 隊列 "<<endl <<"4) 二叉樹 "<<endl <<"5) 圖 "<<endl <<"6) 排序算法 "<<endl <<"7) 字符串 "<<endl <<"X) 按任意鍵退出 "<<endl; cout<<" 請您選擇何種數(shù)據(jù)結(jié)構(gòu)的操作："<<endl; int kind; cin>>kind; switch(kind) { case 1: LIST(); break; case 2: STACK(); break; case 3: QUEUE(); break; case 4: BINTREE(); break; case 5: GRAPH(); break; case 6: COMPOSITOR(); break; default: return; } }while(true);
}
總結(jié)
以上是生活随笔為你收集整理的数据结构算法集---C++语言实现的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。
- 上一篇： C++标准库：使用std_list作为链
- 下一篇： LeetCode-Sort List 链