創(chuàng)意小制作算法圖廣度優(yōu)先法bfs

1、17623845#include #define MAX 10front=-1,rear=-1; struct nodevalue;struct node *next;typedef struct node node; typedef node *link; struct graph_linklink;/隊頭指針link last;/隊尾指針;run9=0;queueMAX;struct graph_link head9;void pr(struct graph_link temp)link current=temp.;while (current!=NULL)prf(%d ,current-

2、value); current=current-next;phar(n);void insert(struct graph_link *temp,x)/鄰接表法頂點link new_node; new_node=new node; new_node-value=x;new_node-next=NULL;if (temp-temp-=NULL)=new_node;/新隊頭/當(dāng)前尾指向頭temp-last=new_node;elsetemp-last-next=new_node;/原隊尾的結(jié)點接上新結(jié)點 temp-last=new_node;/將隊尾結(jié)點指向新結(jié)點void enqueue(valu

3、e)/入隊if (rear=MAX) return;queuerear+=value;dequeue()/出隊if (front=rear) return -1; front+;return queuefront;void bfs(current)/廣度優(yōu)先link tempnode; enqueue(current);/入隊 runcurrent=1;prf(%d ,current);while(front!=rear)/判斷是否為空隊列current=dequeue();/出隊tempnode=headcurrent.;/與 i 個頂點的鏈表頭指針while (tempnode!=NULL

4、)if (runtempnode-value=0)enqueue(tempnode-value); runtempnode-value=1;/判斷以 i 個頂點連接的頂點是否被過/入隊/標(biāo)記已過prf(%d ,tempnode-value);tempnode=tempnode-next;void main()data202=1,2,2,1,1,3,3,1,2,4,4,2,2,5,5,2,3,6,6,3,3,7,7,3,4,5,5,4,6,7,7,6,5,8,8,5,6,8,8,6;data_num,i,j; for (i=1; i9; i+)headi.=NULL;headi.last=NULL; for (j=0; j20; j+)if (dataj0=i)data_num=dataj1; insert(&headi,data_num);prf(Imgae Data:n); for (i=1; i ,i);link ptr=headi. while (ptr!