当前位置:首页 > 数据结构8647实现图的存储结构
#include
#define MAX_VERTEX_NUM 20
typedef struct ArcCell { int adj;
}ArcCell,AdjMatrix[MAX_VERTEX_NUM][MAX_VERTEX_NUM];
typedef struct { int vexs[MAX_VERTEX_NUM]; AdjMatrix arcs; int vexnum,arcnum; }MGraph;
int LocateVex(MGraph G,int u) { int i; for(i=0;i int CreateDG(MGraph &G) { int i,j,k,l,va1,vb1,va,vb; scanf(\ fflush(stdin); for(i=0;i if(va==G.vexs[l]) va1=1; if(vb==G.vexs[l]) vb1=1; } if(va1==0) { G.vexs[l]=va; if(vb1==0) G.vexs[l+1]=vb; } else if(vb1==0) G.vexs[l]=vb; } else { G.vexs[0]=va; G.vexs[1]=vb; } i=LocateVex(G,va); j=LocateVex(G,vb); G.arcs[i][j].adj=1; } return 1; } int print(MGraph G) { int i,j; for(i=0;i int main() { MGraph G; CreateDG(G); print(G); } return 0;
共分享92篇相关文档