[프로그래머스/C++]Lv3 네트워크 BFS

https://school.programmers.co.kr/learn/courses/30/lessons/43162

프로그래머스

소스코드

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

vector<vector<int>> board;
vector<vector<int>> board;

bool BFS(int start, vector<bool>& visited)
{
	queue<int> q;
	q.push(start);
	visited[start] = true;

	while (q.empty() == false)
	{
		int now = q.front();
		q.pop();

		for (int next = 0; next < board[0].size(); next++)
		{
			if (board[now][next] == 0)
				continue;

			if (visited[next])
				continue;

			q.push(next);
			visited[next] = true;
		}
	}
}

int solution(int n, vector<vector<int>> computers)
{
	int answer = 0;
	board = computers;

	vector<vector<int>> result;
	vector<bool> visited(n, false);

	for (int i = 0; i < n; i++)
	{
		if (visited[i] == false)
		{
			BFS(i, visited);
			answer++;
		}
	}

	return answer;
}