图的遍历的演示（c 语言 数据结构课程设计题） /*定义图*/ typedef struct{ int V[M] int R[M][M] int vexnum }Graph /*创建图*/ void creatgraph(Graph *g,int n) { int i,j,r1,r2 g->vexnum=n /*顶点用i表示*/ for(i=1 i<=n i++) { g->V[i]=i } /*初始化R*/ for(i=1 i<=n i++) for(j=1 j<=n j++) { g->R[i][j]=0 } /*输入R*/ printf("Please input R(0,0 END):\n") scanf("％d,％d",&r1,&r2) while(r1!=0&&r2!=0) { g->R[r1][r2]=1 g->R[r2][r1]=1 scanf("％d,％d",&r1,&r2) } } -graph traversal of the display (c language curriculum design data structures that)/* definition of the map*/typedef s truct V (int int [M] R [M] [M]) int vexnum Graph/* create map*/void creatgraph (Graph* g, int n) (int i, j, r1, r2 g--Graph traversal of the presentation (c language data structure, curriculum design issues) /* definition of map*/typedef struct (int V [M] int R [M] [M] int vexnum) Graph /* create the map*/void creatgraph (Graph* g, int n) (int i, j, r1, r2 g->　vexnum = n /* vertex with i said*/for (i = 1 i < = n i++) (g->　V [i] = i ) /* initialize the R*/for (i = 1 i < = n i++) for (j = 1 j < = n j++) (g->　R [i] [j] = 0) /* input R*/printf (" Please input R (0,0 END): \ n" ) scanf ("　 d,　d" , &　r1, &　r2) while (r1! = 0 &　&　r2! = 0) (g->　R [r1] [r2] = 1 g->　R [r2] [r1] = 1 scanf ("　 d,　d" , &　r1, &　r2)))-graph traversal of the display (c language curriculum design data structures that) /* definition of the map*/typedef s truct V (int int [M] R [M] [M]) int vexnum Graph /* create map*/void creatgraph (Graph* g, int n) (int i, j, r1 , r2 g-