数据结构图基本算代码

数据结构图基本算代码————————————————————————————————作者：————————————————————————————————日期：#include"iostream"#include"LGraph.h"#include"seqqueue.h"#include"MGraph.h"#define INFTY 1000template<class T>struct ENode{ENode(){nextArc=NULL;}ENode(int vertex,T weight,ENode *next){adjVex=vertex;w=weight;nextArc=next;}int adjVex;T w;ENode* nextArc;};template<class T>class ExtLGraph:public LGraph<T>{public:ExtLGraph(int mSize):LGraph<T>(mSize){} void DFS();void BFS();void TopoSort(int *order);private:void CalInDegree(int *InDegree);void DFS(int v,bool *visited);void BFS(int v,bool *visited);};template<class T>void ExtLGraph<T>::DFS(){bool *visited=new bool[n];for(int i=0;i<n;i++)visited[i]=false;for(i=0;i<n;i++)if(!visited[i]) DFS(i,visited);delete []visited;}template<class T>void ExtLGraph<T>::DFS(int v,bool *visited){visited[v]=true;cout<<" "<<v;for(ENode<T> *t=a[v];t;t=t->nextArc)if(!visited[t->adjVex])DFS(t->adjVex,visited);}template<class T>void ExtLGraph<T>::BFS(){bool *visited=new bool[n];for(int i=0;i<n;i++)visited[i]=false;for(i=0;i<n;i++)if(!visited[i]) BFS(i,visited);delete []visited;}template<class T>void ExtLGraph<T>::BFS(int v,bool *visited){SeqQueue<int>q(Vertices());visited[v]=true;cout<<" "<<v;q.EnQueue(v);while(!q.IsEmpty()){q.Front(v);q.DeQueue();for(ENode<T> *t=a[v];t;t=t->nextArc)if(!visited[t->adjVex]){visited[t->adjVex]=true;cout<<" "<<w->adjVex;}q.EnQueue(t->adjVex);}}template<class T>void ExtLGraph<T>::CalInDegree(int *InDegree) //计算所有顶点的入度for(int i=0;i<n;i++)InDegree[i]=0;for(i=0;i<n;i++)for(ENode<T>* p=a[i];p;p=p->nextArc)InDegree[p->adjVex]++;}template<class T>void ExtLGraph<T>::TopoSort(int *order){int *InDegree=new int[n];int i,j,k,top=-1;CalInDegree(InDegree);for(i=0;i<n;i++)if(!InDegree[i]){InDegree[i]=top;top=i;}for(i=0;i<n;i++){if(top==-1){cout<<"Has cycle!"<<endl;return;}else{j=top;top=InDegree[top];order[i]=j;cout<<j<<' ';for(ENode<T>* p=a[j];p;p=p->nextArc){k=p->adjVex;InDegree[k]--;if(!InDegree[k]){InDegree[k]=top;top=k;}}}}}template<class T>class ExtMGraph:public MGraph<T>{public:ExtMGraph(int mSize,const T&noedg):MGraph<T>(mSize,noedg){} void DFS();void BFS();void DFS(int v);void BFS(int v);int Choose(int *d,bool *s);void Dijkstra(int v,T *d,int *path);void ShowDijkstra(int v,int flag);void DijkstraForHomework(int v);//用于作业，该段代码与实验无关void Floyd(T **d,int **path);void FloydForHomework(int v);//用于作业，该段代码与实验无关private:void DFS(int v,bool *visited);void BFS(int v,bool *visited);};template<class T>void ExtMGraph<T>::DFS(int v){bool *visited=new bool[n];for(int i=0;i<n;i++)visited[i]=false;for(i=v;i<n;i++){if(!visited[i]) DFS(i,visited);}for(i=0;i<v;i++){if(!visited[i]) DFS(i,visited);}delete [] visited;}template<class T>void ExtMGraph<T>::DFS(){bool *visited=new bool[n];for(int i=0;i<n;i++)visited[i]=false;for(i=0;i<n;i++)if(!visited[i]) DFS(i,visited);delete []visited;}template<class T>void ExtMGraph<T>::DFS(int v,bool *visited) {visited[v]=true;cout<<" "<<v;for(int t=0;t<n;t++)if(a[v][t]!=noEdge&&!visited[t])DFS(t,visited);}template<class T>void ExtMGraph<T>::BFS(int v){bool *visited=new bool[n];for(int i=0;i<n;i++)visited[i]=false;for(i=v;i<n;i++)if(!visited[i]) BFS(i,visited);for(i=0;i<v;i++)if(!visited[i]) BFS(i,visited);delete [] visited;}template<class T>void ExtMGraph<T>::BFS(){bool *visited=new bool[n];for(int i=0;i<n;i++)visited[i]=false;for(i=0;i<n;i++)if(!visited[i]) BFS(i,visited);delete []visited;}template<class T>void ExtMGraph<T>::BFS(int v,bool *visited) {SeqQueue<int>q(Vertices());visited[v]=true;cout<<" "<<v;q.EnQueue(v);while(!q.IsEmpty()){q.Front(v);q.DeQueue();for(int j=0;j<n;j++)if(a[v][j]!=noEdge&&visited[j]!=true){cout<<" "<<j;visited[j]=true;q.EnQueue(j);}}}template<class T>int ExtMGraph<T>::Choose(int *d,bool *s){int i,minpos;T min;min=INFTY;minpos=-1;for(i=0;i<n;i++)if(d[i]<min&&!s[i]){min=d[i];minpos=i;}return minpos;}template<class T>void ExtMGraph<T>::Dijkstra(int v,T *d,int *path) {int i,k,w;if(v<0||v>n-1){cout<<"out of bounds!"<<endl;return;}bool *s=new bool[n];for(i=0;i<n;i++){s[i]=false;d[i]=a[v][i];if(i!=v&&d[i]<INFTY)path[i]=v;else path[i]=-1;}s[v]=true;d[v]=0;for(i=0;i<n;i++){k=Choose(d,s);if(k==-1) break; //若找不出下一个可连通的定点说明源点也无法到达别的定点，算法结束s[k]=true;for(w=0;w<n;w++)if(!s[w]&&d[k]+a[k][w]<d[w]){d[w]=d[k]+a[k][w];path[w]=k;}// showDandPath(k,n,d,path);}delete [] s;}template<class T>void showDandPath(int newS,int n,T *d,int *path)//用于作业，该段代码与实验无关{cout<<"--------S: "<<newS<<"-----------"<<endl;for(int i=0;i<n;i++)cout<<"d["<<i<<"]: "<<d[i]<<" | ";cout<<endl;for(i=0;i<n;i++)cout<<"path["<<i<<"]: "<<path[i]<<" | ";cout<<endl<<"---------------------------------"<<endl;}template<class T>void ExtMGraph<T>::DijkstraForHomework(int v)//用于作业，该段代码与实验无关{T *d=new T[n];int *path=new int[n];int i,k,w;if(v<0||v>n-1){cout<<"out of bounds!"<<endl;return;}bool *s=new bool[n];for(i=0;i<n;i++){s[i]=false;d[i]=a[v][i];if(i!=v&&d[i]<INFTY)path[i]=v;else path[i]=-1;}s[v]=true;d[v]=0;showDandPath(0,n,d,path);for(i=0;i<n;i++){k=Choose(d,s);if(k==-1) break; //若找不出下一个可连通的定点说明源点也无法到达别的定点，算法结束s[k]=true;for(w=0;w<n;w++)if(!s[w]&&d[k]+a[k][w]<d[w]){d[w]=d[k]+a[k][w];path[w]=k;}showDandPath(k,n,d,path);}delete []d;delete []path;}template<class T>void ExtMGraph<T>::ShowDijkstra(int v,int flag){T * dd=new T [n];int * ppath=new int [n];int temp;Dijkstra(v,dd,ppath);for(int ii=0;ii<n;ii++){cout<<ii<<": ";if(ii==v)cout<<"Source Point"<<endl;else{if(ppath[ii]==-1)cout<<"No path exist"<<endl;else{cout<<ii<<"<- ";temp=ppath[ii];while(ppath[temp]!=-1){cout<<temp<<"<- ";temp=ppath[temp];}if(flag==0)cout<<temp<<endl<<"----------total weight: "<<dd[ii]<<endl;else{if(flag==1)cout<<temp<<endl<<"----------change flight "<<dd[ii]-1<<" times"<<endl;elseif(flag==2)cout<<temp<<endl<<"----------change bus "<<dd[ii]-1<<" times"<<endl;}}}}delete []dd;delete []ppath;}template<class T>void ExtMGraph<T>::Floyd(T **d,int **path){int i,j,k;for(i=0;i<n;i++)for(j=0;j<n;j++){d[i][j]=a[i][j];if(i!=j&&a[i][j]<INFTY)path[i][j]=i;else path[i][j]=-1;}for(k=0;k<n;k++)for(i=0;i<n;i++)for(j=0;j<n;j++){d[i][j]=d[i][k]+d[k][j];path[i][j]=path[k][j];}}template<class T>void ExtMGraph<T>::FloydForHomework(int v)//用于作业，该段代码与实验无关{//初始化T **d=new T*[n];int **path=new int*[n];for(int i=0;i<n;i++){d[i]=new T[n];path[i]=new int[n];}//以下是Floyd算法，但是在“开始插入处”与“结束插入处”之间加入显示代码以写出二维树组d和path在执行算法的过程中各步的状态int k;for(i=0;i<n;i++)for(int t=0;t<n;t++){d[i][t]=a[i][t];if(i!=t&&a[i][t]<INFTY)path[i][t]=i;else path[i][t]=-1;}for(k=0;k<n;k++){//zzqfor(i=0;i<n;i++)for(int t=0;t<n;t++){d[i][t]=d[i][k]+d[k][t];path[i][t]=path[k][t];}//开始插入处cout<<"--------S: "<<k<<"-----------"<<endl;cout<<"d"<<k<<":"<<endl;for(i=0;i<n;i++){for(int j=0;j<n;j++){cout<<d[i][j]<<" ";}cout<<endl;}cout<<"------------------------------"<<endl;cout<<"path"<<k<<":"<<endl;for(i=0;i<n;i++){for(int j=0;j<n;j++){cout<<path[i][j]<<" ";}cout<<endl;}cout<<"------------------------------"<<endl;//结束插入处}//释放资源for(i=0;i<n;i++){delete []d[i];delete []path[i];}delete []d;delete []path;}void main(){int weight=3;int noEdge=1000;// Test of MGraph/* MGraph<int> mGraph(7,noEdge);int matrix[7][7]={0,1,0,0,0,0,1,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0};for(int i=0;i<7;i++){for(int j=0;j<7;j++)cout<<matrix[i][j]<<' ';cout<<endl;}mGraph.BuildforTest(*matrix,7,7);mGraph.OutputforTest(cout);mGraph.DeleteforTest();mGraph.OutputforTest(cout);showResultCode(mGraph.Insert(3,1,weight));showResultCode(mGraph.Insert(6,2,weight));mGraph.OutputforTest(cout);showResultCode(mGraph.Remove(3,1));*/// Test of LGraph and ExtLGraph/* LGraph<int> lGraph(7);int matrix[7][7]={0,1,0,0,0,0,1,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0};for(int i=0;i<7;i++){for(int j=0;j<7;j++)cout<<matrix[i][j]<<' ';cout<<endl;}lGraph.BuildforTest(*matrix,7,7);lGraph.OutputforTest(cout);lGraph.DeleteforTest();lGraph.OutputforTest(cout);showResultCode(lGraph.Insert(3,1,weight));showResultCode(lGraph.Insert(6,2,weight));lGraph.OutputforTest(cout);*//*// Test of DFS in ExtMGraphExtMGraph<int> extMGraph(8,noEdge);showResultCode(extMGraph.Insert(0,1,weight));showResultCode(extMGraph.Insert(0,6,weight));showResultCode(extMGraph.Insert(1,3,weight));showResultCode(extMGraph.Insert(1,4,weight));showResultCode(extMGraph.Insert(2,5,weight));showResultCode(extMGraph.Insert(6,2,weight));showResultCode(extMGraph.Insert(7,0,weight));cout<<"DFS"<<endl;extMGraph.DFS();cout<<endl;extMGraph.DFS(7);cout<<endl;extMGraph.DFS(6);cout<<endl;extMGraph.DFS(5);extMGraph.DFS(4);cout<<endl;extMGraph.DFS(3);cout<<endl;extMGraph.DFS(2);cout<<endl;extMGraph.DFS(1);cout<<endl;cout<<"BFS"<<endl;extMGraph.BFS();cout<<endl;extMGraph.BFS(7);cout<<endl;extMGraph.BFS(6);cout<<endl;extMGraph.BFS(5);cout<<endl;extMGraph.BFS(4);cout<<endl;extMGraph.BFS(3);cout<<endl;extMGraph.BFS(2);cout<<endl;extMGraph.BFS(1);cout<<endl;// Test of BFS in ExtMGraphExtMGraph<int> extMGraph2(8,noEdge); showResultCode(extMGraph2.Insert(0,2,weight)); showResultCode(extMGraph2.Insert(1,3,weight)); showResultCode(extMGraph2.Insert(2,4,weight)); showResultCode(extMGraph2.Insert(3,5,weight)); showResultCode(extMGraph2.Insert(5,6,weight)); showResultCode(extMGraph2.Insert(6,7,weight)); showResultCode(extMGraph2.Insert(7,0,weight)); cout<<"BFS"<<endl;extMGraph2.BFS();cout<<endl;extMGraph2.BFS(7);cout<<endl;extMGraph2.BFS(6);cout<<endl;extMGraph2.BFS(5);extMGraph2.BFS(4);cout<<endl;extMGraph2.BFS(3);cout<<endl;extMGraph2.BFS(2);cout<<endl;extMGraph2.BFS(1);cout<<endl;cout<<"DFS"<<endl;extMGraph2.DFS();cout<<endl;extMGraph2.DFS(7);cout<<endl;extMGraph2.DFS(6);cout<<endl;extMGraph2.DFS(5);cout<<endl;extMGraph2.DFS(4);cout<<endl;extMGraph2.DFS(3);cout<<endl;extMGraph2.DFS(2);cout<<endl;extMGraph2.DFS(1);cout<<endl;}。