图论学习笔记2

#include <iostream>
using namespace std;
#include <vector>
#include <queue>

int dir[4][2] = { 0,1,1,0,-1,0,0,-1 };
void bfs(vector<vector<int>>& grid, vector<vector<bool>>& visited, int x, int y, int& count)
{
	queue<pair<int, int>> q;
	q.push({ x,y });
	visited[x][y] = true;
	count++;

	while (!q.empty())
	{
		pair<int, int> cur = q.front();
		q.pop();
		int curx = cur.first;
		int cury = cur.second;
		for (int i = 0; i < 4; i++)
		{
			int nextx = curx + dir[i][0];
			int nexty = cury + dir[i][1];
			if (nextx < 0 || nextx >= grid.size() || nexty < 0 || nexty >= grid[0].size()) continue;
			if (visited[nextx][nexty] == false && grid[nextx][nexty] == 1)
			{
				q.push({ nextx,nexty });
				visited[nextx][nexty] = true;
				count++;
			}
		}
	}
}

int main()
{
	int n, m;
	cin >> n >> m;

	vector<vector<int>> grid(n, vector<int>(m, 0));
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			cin >> grid[i][j];
		}
	}

	vector<vector<bool>> visited(n, vector<bool>(m, false));

	int result = 0;
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			if (visited[i][j] == false && grid[i][j] == 1)
			{
				int count = 0;
				bfs(grid, visited, i, j, count);
				result = max(result, count);
			}
		}
	}

	cout << result << endl;

	system("pause");
	return 0;
}