數(shù)據(jù)結(jié)構(gòu)C語(yǔ)言實(shí)現(xiàn)圖的建立,圖的廣度,深度遍歷

1、圖的建立，圖的廣度，深度遍歷#include "stdio.h"#define maxsize 1000 # define n 100 typedef struct char vexsn ; int arcsnn ; int num ; G;typedef struct int datamaxsize; int front,rear; V;void GInit(G *L) L->num=0;int GVexs(G *L) return(L->num);void GCreate(G *L) int i,j; GInit(L); printf("請(qǐng)輸入頂點(diǎn)

2、數(shù)目：n"); scanf("%d",&L->num); printf("請(qǐng)輸入各頂點(diǎn)：n"); for(i=0;i<L->num;i+) fflush(stdin); scanf("%c",&L->vexsi); printf("請(qǐng)輸入各頂點(diǎn)邊的關(guān)系（1是有關(guān)0是無(wú)關(guān)）：n"); for(i=0;i<L->num;i+) for(j=0;j<L->num;j+) scanf("%d",&L->arcsij)

3、; void GOut(G L) int i,j; printf("n圖的頂點(diǎn)數(shù)目為：%d",L.num); printf("n圖的各頂點(diǎn)的信息為：n"); for(i=0;i<L.num;i+) printf("%7c",L.vexsi); printf("n"); for(i=0;i<L.num;i+) for(j=0;j<L.num;j+) printf("%7d ",L.arcsij); printf("n"); void DFS(G g,int q

4、idian,int mark) int v1; markqidian=1; printf("%c ",g.vexsqidian); for(v1=0;v1<g.num;v1+) if(g.arcsqidianv1!=0&&markv1=0) DFS(g,v1,mark); void GDFS(G g) int qidian,v,v1,markmaxsize; printf("n深度遍歷："); printf("n請(qǐng)輸入起點(diǎn)的下標(biāo)："); scanf("%d",&qidian); get

5、char(); for(v=0;v<g.num;v+) markv=0; for(v=qidian;v<g.num+qidian;v+) v1=v%g.num; if(markv1=0) DFS(g,v1,mark); void QueueInit(V *sq) sq->front=0; sq->rear=0;int QueueIsEmpty(V sq) if (sq.rear=sq.front) return(1); else return(0); int QueueFront(V sq, int *e) if (QueueIsEmpty(sq) printf(&qu

6、ot;queue is empty!n");return 0; else *e=sq.data(sq.front); return 1;int QueueIn (V *sq, int x)/ if (sq->front=(sq->rear+1)%maxsize) printf("queue is full!n"); return 0; else sq->datasq->rear=x; sq->rear=(sq->rear+1)%maxsize; return(1); int QueueOut(V *sq) if (QueueIs

7、Empty(*sq) printf("queue is empty!n"); return 0; else sq->front=(sq->front+1)%maxsize; return 1; void BFS(G g,int v,int mark) int v1,v2; V q; QueueInit(&q); QueueIn(&q,v); markv=1; printf("%c ",g.vexsv); while(QueueIsEmpty(q)=0) QueueFront(q,&v1); QueueOut(&

8、q); for(v2=0;v2<g.num;v2+) if(g.arcsv1v2!=0&&markv2=0) QueueIn(&q,v2); markv2=1; printf("%c ",g.vexsv2); void GBFS(G g) int qidian,v,v1,markmaxsize; printf("n廣度遍歷："); printf("n"); scanf("%d",&qidian); for(v=0;v<g.num;v+) markv=0; for(v=qidian;v&