《邻接矩阵的算法》由会员分享，可在线阅读，更多相关《邻接矩阵的算法（4页珍藏版）》请在金锄头文库上搜索。
1、#include#include#includetypedef int VertexType;typedef int WeightType;const int MaxVertexNum=10;const WeightType MaxValue=1000;typedef VertexType vexlistMaxVertexNum;typedef int adjmatrixMaxVertexNumMaxVertexNum;/1.图的邻接矩阵存储的初始化算法void InitMaxtrix(adjmatrix GA,int k)int i,j;for(i=0;iMaxVertexNum;i+)fo
2、r(j=0;jc1;if(k1=0 & k2=0)dosinc1ic2jc3;GAij=GAji=1;sinc1;if(c1=) break;while(1);else if(k1=0 & k2!=0)do sinc1ic2jc3w;GAij=GAji=w;sinc1;if(c1=) break;while(1);else if(k1!=0 & k2=0)dosinc1ic2jc3;GAij=1;sinc1;if(c1=) break;while(1);else if(k1!=0 & k2!=0)do sinc1ic2jc3w;GAij=w;sinc1;if(c1=) break;while(
3、1);/3.根据图的邻接矩阵输出图的二元组表示（顶点和边集）的算法void PrintMaxtrix(adjmatrix GA,int n,int k1,int k2)int i,j;coutV=;for(i=0;in-1;i+) couti,;coutn-1endl;coutE=;if(k2=0)for(i=0;in;i+)for(j=0;jn;j+)if(GAij=1)if(k1=0)if(ij) cout(i,j),;elsecouti,j,;elsefor(i=0;in;i+)for(j=0;jn;j+)if(GAij!=0 & GAij!=MaxValue)if(k1=0)if(ij
4、) cout(i,j),;elsecouti,j,;coutendl;/4.图的深度优先搜索遍历void dfsMatrix(adjmatrix GA,int i,int n,bool*visited)couti ;visitedi=true;for(int j=0;jn;j+)if(GAij!=0 & GAij!=MaxValue & !visitedj)dfsMatrix(GA,j,n,visited);/5.图的广度优先搜索遍历void bfsMatrix(adjmatrix GA,int i,int n,bool*visited)const int MaxSize=30;int qMa
5、xSize=0;int front=0,rear=0;couti ;visitedi=true;q+rear=i;while(front!=rear)front=(front+1)%MaxSize;int k=qfront;for(int j=0;jn;j+)if(GAkj!=0 & GAkj!=MaxValue & !visitedj)coutj ;visitedj=true;rear=(rear+1)%MaxSize;qrear=j;/if end/for end/while end/end/主函数void main()int i,n,k1,k2;coutn;coutk1k2;bool*visited=new booln;adjmatrix ga;InitMaxtrix(ga,k2);couta;CreateMatrix(ga,n,a,k1,k2);cout按图的邻接矩阵得到深度优先遍历序列：endl;for(i=0;in;i+) visitedi=false;dfsMatrix(ga,0,n,visited);coutendl;cout按图的邻接矩阵得到的广度优先遍历序列：endl;for(i=0;in;i+) visitedi=false;bfsMatrix(ga,0,n,visited);coutendl;PrintMaxtrix(ga,n,k1,k2);
