[2018年最新整理]图的遍历(邻接表结构).docVIP

#include?? iostream?? #include?? malloc.h?? using?? namespace?? std;???? ? #define?? int_max?? 10000?? ? #define?? inf?? 9999???? ? #define?? max?? 20?? ? //…………………………………………邻接矩阵定义……………………?? ? typedef?? struct?? ArcCell?? ? {?? ??? int?? adj;?? ??? // char?? *info;?? ? }ArcCell,AdjMatrix[20][20];?? ? typedef?? struct???? ? {?? ??? char?? vexs[20];?? ??? AdjMatrix?? arcs;?? ??? int?? vexnum,arcnum;?? ? }MGraph_L;?? ? //^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^?? ? int?? localvex(MGraph_L?? G,char?? v)//返回V的位置?? ? {?? ??? int?? i=0;?? ??? while(G.vexs[i]!=v)?? ??? {?? ????? ++i;?? ??? }?? ??? return?? i;?? ? }?? ??? ? int?? creatMGraph_L(MGraph_L?? G)//创建图用邻接矩阵表示?? ? {?? ??? char?? v1,v2;?? ??? int?? i,j,w;?? ??? cout…………创建无向图…………endl请输入图G顶点和弧的个数:(4?? 6)不包括“()”endl;?? ??? cinG.vexnumG.arcnum;?? ??? for(i=0;i!=G.vexnum;++i)?? ??? {?? ????? cout输入顶点iendl;?? ????? cinG.vexs[i];?? ??? }?? ??? for(i=0;i!=G.vexnum;++i)?? ????? for(j=0;j!=G.vexnum;++j)?? ????? {???? ??????? G.arcs[i][j].adj=0;?? ??????? //G.arcs[i][j].info=NULL;?? ????? }?? ??? for(int?? k=0;k!=G.arcnum;++k)?? ????? {???? ??????? cout输入一条边依附的顶点和权:(a?? b?? 3)不包括“()”endl;?? ??????? cinv1v2w;//输入一条边依附的两点及权值?? ??????? i=localvex(G,v1);//确定顶点V1和V2在图中的位置?? ??????? j=localvex(G,v2);?? ??????G.arcs[i][j].adj=1；//G.arcs[i][j].adj=w;?? ???????G.arcs[j][i].adj=1；//G.arcs[j][i].adj=w;?? ????? }?? ?????? ????? return?? G.vexnum;?? ? }?? ? void?? ljjzprint(MGraph_L?? G)??//输出图的邻接矩阵 ? {?? ??? int?? i,j;?? ??? for(i=0;i!=G.vexnum;++i)?? ????? {?? ??????? for(j=0;j!=G.vexnum;++j)?? ????????? coutG.arcs[i][j].adj?? ;?? ??????? coutendl;?? ????? }?? ? }?? ? int?? visited[max];//访问标记?? ? int?? we;?? ? typedef?? struct?? arcnode//弧结点?? ? {?? ??? int?? adjvex;//该弧指向的顶点的位置?? ??? struct?? arcnode?? *nextarc;//弧尾相同的下一条弧?? ??? char?? *info;//该弧信息?? ? }arcnode;?? ? typedef?? struct?? vnode//邻接链表顶点头接点?? ? {?? ??? char?? data;//结点信息?? ??? arcnode?? *firstarc;//