广度优先是一种步步为营的策略,每次都从各个方向探索一步,将前线推进一步,图中的虚线就表示这个前线,队列中的元素总是由前线的点组成的,可见正是队列先进先出的性质使这个算法具有了广度优先的特点。广度优先搜索还有一个特点是可以找到从起点到终点的最短路径,而深度优先搜索找到的不一定是最短路径。
- #include <stdio.h>
- #define MAX_ROW 5
- #define MAX_COL 5
- struct point { int row, col, predecessor; } queue[512];
- int head = 0, tail = 0;
- void enqueue(struct point p)
- {
- queue[tail++] = p;
- }
- struct point dequeue(void)
- {
- return queue[head++];
- }
- int is_empty(void)
- {
- return head == tail;
- }
- int maze[MAX_ROW][MAX_COL] = {
- 0, 1, 0, 0, 0,
- 0, 1, 0, 1, 0,
- 0, 0, 0, 0, 0,
- 0, 1, 1, 1, 0,
- 0, 0, 0, 1, 0,
- };
- void print_maze(void)
- {
- int i, j;
- for (i = 0; i < MAX_ROW; i++) {
- for (j = 0; j < MAX_COL; j++)
- printf("%d ", maze[i][j]);
- putchar('\n');
- }
- printf("*********\n");
- }
- void visit(int row, int col)
- {
- struct point visit_point = { row, col, head-1 };
- maze[row][col] = 2;
- enqueue(visit_point);
- }
- int main(void)
- {
- struct point p = { 0, 0, -1 };
- maze[p.row][p.col] = 2;
- enqueue(p);
- while (!is_empty()) {
- p = dequeue();
- if (p.row == MAX_ROW - 1 /* goal */
- && p.col == MAX_COL - 1)
- break;
- if (p.col+1 < MAX_COL /* right */
- && maze[p.row][p.col+1] == 0)
- visit(p.row, p.col+1);
- if (p.row+1 < MAX_ROW /* down */
- && maze[p.row+1][p.col] == 0)
- visit(p.row+1, p.col);
- if (p.col-1 >= 0 /* left */
- && maze[p.row][p.col-1] == 0)
- visit(p.row, p.col-1);
- if (p.row-1 >= 0 /* up */
- && maze[p.row-1][p.col] == 0)
- visit(p.row-1, p.col);
- print_maze();
- }
- if (p.row == MAX_ROW - 1 && p.col == MAX_COL - 1)
- {
- printf("(%d, %d)\n", p.row, p.col);
- while (p.predecessor != -1) {
- p = queue[p.predecessor];
- printf("(%d, %d)\n", p.row, p.col);
- }
- } else
- printf("No path!\n");
- return 0;
- }