DFS对矩阵分类

 通过DFS找到矩阵中相邻的‘o'，并将其分为一类

输入：5 5
          X O O X O
          X X O O X
          O X O X O
           X X X X O
          O X X X O

输出：
0 1 1 0 2
0 0 1 1 0
3 0 1 0 4
0 0 0 0 4
5 0 0 0 4

#include "pch.h"
#include <iostream>

using namespace std;
int dir[4][2] = { { 0, 1 },{ 0, -1 },{ 1, 0 },{ -1, 0 } };

void DFS(int i, int j, int N, int M, int cnt, vector<vector<int>>&Flag, vector<vector<char>>&Data)
{
	Flag[i][j] = cnt;
	for (int k = 0; k < 4; k++)
	{
		int x = i + dir[k][0];
		int y = j + dir[k][1];
		if (x >= 0 && y >= 0 && x < N && y < M && Flag[x][y] == 0 && Data[x][y] == 'O')
		{
			DFS(x, y , N, M, cnt, Flag, Data);
		}
	}
}
int main()
{
	int i, j, N, M;
	int cnt = 1;
	cin >> N >> M;
	vector<vector<int>>Flag(N, vector<int>(M));
	vector<vector<char>>Data(N, vector<char>(M));
	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < M; j++)
		{
			Flag[i][j] = 0;
			cin >> Data[i][j];
		}
	}
	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < M; j++)
		{
			if (Flag[i][j] == 0 && Data[i][j] == 'O')
			{
	/*			cout << i << " " << j << " "<<cnt<<endl;*/
				DFS(i, j, N, M, cnt, Flag, Data);
				cnt = cnt + 1;
			}
		}
	}

	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < M; j++)
		{
			cout << Flag[i][j] << ' ';
		}
		cout << endl;
	}

	return 0;
}