实验五排序、邻接表、矩阵.pptVIP

* 试验五演示文稿 希尔排序 dataList.h Main.cpp templateclass typevoid Shellsort(DataListtype List) int gap=List.CurrentSize/2; while(gap) { Shellnsert(List,gap); gap=gap==2?1:(int)(gap/2); 开始 gap=List.CurrentSize/2 Shellnsert(List,gap) Gap!=0 Gap=1 Gap=2 结束 Gap=gap/2 N Y Y N 这里也可以没有这个判断语句 一次排序的过程 templateclass typevoid Shellnsert(DataListtype List,const int gap) for(int i=gap;iList.CurrentSize;i++) { Elementtype temp=List.Vector[i]; int j=i; while( j=gap temp.Getkey() List.Vector[j-gap].Getkey() ) { List.Vector[j]=List.Vector[j-gap]; j-=gap; } List.Vector[j]=temp; 从第gap处开始比较，用后面的与前面的比较 开始 i=gap i++ i List.CurrentSize temp=List.Vector[i] int j=i j=gap temp.Getkey() List.Vector[j-gap].Getkey() List.Vector[j]=List.Vector[j-gap] j-=gap List.Vector[j]=temp 结束 Y N 程序运行结果： 图的邻接表深度优先遍历 GraphB.h Main.cpp GraphBDef.h templateclass Nametype,class Disttype GraphNametype,Disttype::Graph(int sz=DifaultSize):NumVertices(0),MaxNumVertices(sz),NumEdges(0) int n,e,k,j; Nametype name,tail,head; Disttype weight; NodeTable= new VertexNametype,Disttype[MaxNumVertices]; coutPlease input the number of the vertices:; cinn; NumVertices=n; coutPlease input the names of the Vertex one by one:; for(int i=0;in;i++){cinname;InsertVertex(name);} coutplease input the number of the edges:; cine; coutplease input their tail,head weight one by one:\n; for(i=0;ie;i++) {cintailheadweight; k=GetVertexPos(tail); j=GetVertexPos(head); cout\nNext\n; InsertEdge(k,j,weight);} 开始 NodeTable= new Vertex Nametype,Disttype[MaxNumVertices INPUT NumVertices INPUT names of the vertices INPUT NumEdges INPUT data of the Edges 结束 templateclass Nametype,class Disttypevoid GraphNametype,Disttype::DFS() int *visited=new int[NumVertices]; for(int i=0;iNumVertices;i++) visited[i]=0; DFS(0,visited); delete[]visited; 开始 *visited=new int[NumVertices]; i=0 i++ iNumVertices visited[i]=0 DFS(0,visited) delete[]visited Y N 结束 初始化visit数组 利用递归过程来深度优先遍历图 结束visit的作用域 释放空间 templateclass Nametype,class Disttypevoid GraphNametype,Disttype::