邻接多重表的实现.docx

韩山师范学院实验题目：邻接多重表算法实现班级：2015级软工班作者：黄俊聪#includeusing namespace std;#define MAX_VERTEX_NUM 20#define OK 1#define ERROR 0typedef char InfoType;typedef int Status;typedef char VertexType;typedef enumunvisited,visitedVisitIf;typedef struct EBoxVisitIf mark;int ivex,jvex;struct EBox *ilink,*jlink;InfoType *info; EBox; typedef struct VexBox VertexType data; EBox* firstedge;VexBox;typedef struct VexBox adjmulistMAX_VERTEX_NUM; int vexnum,edgenum;AMLGraph;Status LocateVex(AMLGraph G,char v)int i;for(int i=0;iG.vexnum;i+)if(G.adjmulisti.data=v)return i;return ERROR; Status CreateAMLG(AMLGraph& G)EBox* p;char v1,v2;int i,j;cout输入总顶点数和总边数：G.vexnumG.edgenum;/输入总顶点数和总边数 cout输入各点，构造表头结点表：endl; for(int i=0;iG.adjmulisti.data; G.adjmulisti.firstedge=NULL; cout输入各边，构造邻接多重表：endl; for(int k=0;kv1v2; i=LocateVex(G,v1); j=LocateVex(G,v2); p=new EBox; p-ivex=i; p-ilink=G.adjmulisti.firstedge; p-jvex=j; p-jlink=G.adjmulisti.firstedge; p-info=NULL; p-mark=unvisited; G.adjmulistj.firstedge=p; G.adjmulisti.firstedge=p; return OK;void PrintAMLGraph(AMLGraph G)EBox* p1,*p2;for(int k=0;kilink)if(p1-mark=visited)p1-mark=unvisited;for(p2=G.adjmulistk.firstedge;p2!=NULL;p2=p2-jlink)if(p2-mark=visited)p2-mark=unvisited;for(int i=0;iG.vexnum;i+)coutilink)if(p1-mark=unvisited)cout; coutivex jvex; p1-mark=visited;for(p2=G.adjmulisti.firstedge;p2!=NULL;p2=p2-jlink)if(p2-mark=unvisited)cout; coutivex jvex; p2-mark=visit