图的BFS问题

2020-07-20 05:13:53 2.6k 阅读 AI 写同款 · GEO 优化AI 选题数据监测一键分发 ›

【5G全网建设】Option3X和Option2模式建安市、兴城市和四水市核心网、承载网网络设计与部署拓扑规划： Option 3X网络拓扑图规划 Option 2网络拓扑图规划设备部署：建安市核心网建安市承载中心机房建安市骨干汇聚机房建安市3区汇聚机房建安市C站点无线机房兴城市核心网兴城市承载中心机房兴城市骨干汇聚机房兴城市2区汇聚机房兴城市B站点无线机房数据配置：建安市核心网建安市承载中心机房建安市骨干汇聚机房建安市3区汇聚机房建安市C站点无线机房兴城市核心网兴城市承载中心机房兴城市骨干汇聚机房兴城市2区汇聚机房兴城市B站点无线机房业务调试阅读详情

#include<cstdio>

#include<queue>

#include<vector>

#include<memory.h>

#define MAX_N 1010

using namespace std;

int n, l;

vector<int> g[MAX_N];

int vertex_level[MAX_N];

bool visited[MAX_N];

int bfs(int node)

{

	memset(vertex_level, 0, MAX_N);

	memset(visited, false, MAX_N);

	queue<int> trav;

	trav.push(node);

	int count = 0;

	visited[node] = true;

	while (!trav.empty() && vertex_level[trav.front()] < l)

	{

		int f = trav.front();

		trav.pop();

		for (int i = 0; i < g[f].size(); ++i)

		{

			if (!visited[g[f][i]])

			{

				visited[g[f][i]] = true;

				vertex_level[g[f][i]] = vertex_level[f] + 1;

				trav.push(g[f][i]);

				++count;

			}

		}

	}

	return count;

}

int main(void)

{

	scanf("%d%d", &n, &l);

	for (int i = 1; i <= n; ++i)

	{

		int s;

		scanf("%d", &s);

		for (int j = 0; j < s; ++j)

		{

			int t;

			scanf("%d", &t);

			g[t].push_back(i);

		}

	}

	int s;

	scanf("%d", &s);

	for (int i = 0; i < s; ++i)

	{

		int t;

		scanf("%d", &t);

		printf("%d\n", bfs(t));

	}

}