/**
*2018.9.24 20.00
*广度优先搜索(Broaden First Search)
*1.先将当前顶点访问,将其序号进队
*2.判断队列是否为空
*3.不为空:队顶序号出队,访问其未被访问的邻接点,
* 然后将其邻接点(当前未被访问到被访问的顶点)序号入队
*4.3中顶点的邻接点访问完成以后进入下一次出队访问中,直到队空
*
*tips:队列中保存的是已被访问过的顶点的序号(是从未访问到被访问的状态的转变的顶点,在访问时
已被访问的顶点不算,访问时已被访问的顶点表明它的邻接点已经被访问过了)
* 先被访问的顶点的邻接点先于后被访问的顶点的邻接点先访问
* 这是因为先被访问的顶点先进入队列,而队列属于FIFO的数据结构
*/
#include<stdio.h>
#define MAX 100
typedef struct Arc {
int vno, weight;
struct Arc *nextArc;
}Arc;
typedef struct Vertex{
char e;
Arc *firstArc;
}Vertex;
typedef struct Graph{
Vertex VNode[MAX];
int v_num, a_num;
}Graph;
void BFSTraverse(Graph *g);
void BFS(Graph *g, int v, int visited[]);
void visit(Graph *g, int v);
int main(void) {
putchar('\n');
system("pause");
return 0;
}
void BFSTraverse(Graph *g) {
int visited[MAX] = {0};
for (int i = 0; i < g->v_num; ++i)
if (visited[i] == 0)
BFS(g, i, visited);
}
//假设队列不会满
void BFS(Graph *g, int v, int visited[]) {
if (v <= g->v_num) {
int queue[MAX], front, rear;
Arc *arc;
for (int i = 0; i < g->v_num; ++i)
visited[i] = 0;
front = rear = 0;
visit(g, v);
visited[v] = 1;
rear = (rear + 1) % MAX;
queue[rear] = v;
while (rear != front) {
front = (front + 1) % MAX;
v = queue[front];
arc = g->VNode[v].firstArc;
while (arc != NULL) {
if (visited[arc->vno] == 0) {
visit(g, arc->vno);
visited[arc->vno] = 1;
rear = (rear + 1) % MAX;
queue[rear] = arc->vno;
}
arc = arc->nextArc;
}
}
}
}
void visit(Graph *g, int v) {
printf("%c", g->VNode[v].e);
}
广度优先搜索
最新推荐文章于 2023-07-15 19:08:51 发布