用DFS求连通块

最新推荐文章于 2024-08-05 11:36:30 发布

林伏案

最新推荐文章于 2024-08-05 11:36:30 发布

阅读量721

点赞数

分类专栏： =====图===== uva OJ

本文链接：https://blog.csdn.net/qq_29169749/article/details/51058003

版权

uva OJ 同时被 2 个专栏收录

75 篇文章 1 订阅

订阅专栏

=====图=====

56 篇文章 0 订阅

订阅专栏

这是一篇关于如何利用深度优先搜索(DFS)算法来分析土地网格中石油沉积物的连通区域的问题。GeoSurvComp公司负责检测地下石油沉积，将土地划分为小正方形地块，如果相邻地块都含有石油，则它们属于同一油藏。任务是确定在给定的网格中有多少个不同的石油沉积区块。

摘要由CSDN通过智能技术生成

uva572: Oil Deposits

The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides the land into numerous square plots. It then analyzes each plot separately, using sensing equipment to determine whether or not the plot contains oil.

A plot containing oil is called a pocket. If two pockets are adjacent, then they are part of the same oil deposit. Oil deposits can be quite large and may contain numerous pockets. Your job is to determine how many different oil deposits are contained in a grid.

Input

The input file contains one or more grids. Each grid begins with a line containing m and n, the number of rows and columns in the grid, separated by a single space. If m = 0 it signals the end of the input; otherwise $1 \le m \le 100$ and $1 \le n \le 100$ . Following this are m lines of n characters each (not counting the end-of-line characters). Each character corresponds to one plot, and is either ` *', representing the absence of oil, or ` @', representing an oil pocket.

Output

For each grid, output the number of distinct oil deposits. Two different pockets are part of the same oil deposit if they are adjacent horizontally, vertically, or diagonally. An oil deposit will not contain more than 100 pockets.

Sample Input

1 1
*
3 5
*@*@*
**@**
*@*@*
1 8
@@****@*
5 5
****@
*@@*@
*@**@
@@@*@
@@**@
0 0

Sample Output

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;
const int maxn = 100 + 10;

char dep[maxn][maxn];
int id[maxn][maxn]; //标记联通量id
int row, col;

void dfs(int r, int c, int num) {
    if(r >= row || r < 0 || c >= col || c < 0)  return;     //越界返回
    if(dep[r][c] != '@' || id[r][c] != 0)   return; //被访问过或者不是油田
    id[r][c] = num;

    for(int i = -1; i <= 1; i++)
        for(int j = -1; j <= 1; j++)
            if(i != 0 || j != 0)    dfs(r + i, c + j, num);     //向周围8个方向深搜，注意if()中的条件，不遍历自己，否则就无限循环下去
}

int main()
{
    while(scanf("%d%d", &row, &col) == 2 && row && col) {
        for(int i = 0; i < row; i++)
            scanf("%s", dep[i]);

        int num = 0;
        memset(id, 0, sizeof(id));
        for(int i = 0; i < row; i++)
        for(int j = 0; j < col; j ++) {
            if(id[i][j] == 0 && dep[i][j] == '@')   dfs(i, j, ++num);
        }
        printf("%d\n", num);
    }
    return 0;
}

备注：对多维数组求联通块的过程也称之为“种子填充”。附上维基百科里面对于“种子填充”的介绍，动画很不错！https://en.wikipedia.org/wiki/Flood_fill