BFS遍历
例题pat 1076 Forwards on Weibo (30 分)
Weibo is known as the Chinese version of Twitter. One user on Weibo may have many followers, and may follow many other users as well. Hence a social network is formed with followers relations. When a user makes a post on Weibo, all his/her followers can view and forward his/her post, which can then be forwarded again by their followers. Now given a social network, you are supposed to calculate the maximum potential amount of forwards for any specific user, assuming that only L levels of indirect followers are counted.
Input Specification:
Each input file contains one test case. For each case, the first line contains 2 positive integers: N (≤1000), the number of users; and L (≤6), the number of levels of indirect followers that are counted. Hence it is assumed that all the users are numbered from 1 to N. Then N lines follow, each in the format:
M[i] user_list[i]
where M[i] (≤100) is the total number of people that user[i] follows; and user_list[i] is a list of the M[i] users that followed by user[i]. It is guaranteed that no one can follow oneself. All the numbers are separated by a space.
Then finally a positive K is given, followed by K UserID’s for query.
Output Specification:
For each UserID, you are supposed to print in one line the maximum potential amount of forwards this user can trigger, assuming that everyone who can view the initial post will forward it once, and that only L levels of indirect followers are counted.
Sample Input:
7 3
3 2 3 4
0
2 5 6
2 3 1
2 3 4
1 4
1 5
2 2 6
Sample Output:
4
5
//BFS遍历图
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;
const int maxx=1000; //最大顶点数
const int inf =1e9; //无连通的边
int n,l,num;
bool inq[maxx]={false}; //记录该点是否入过队
struct node
{
int id; //节点编号
int cent; //节点层号
};
vector<node>adj[maxx];
int BFS(int s) //遍历u所在的连通块
{
int numfoward=0; //转发数
queue<node>q; //建队
node start; //起始节点
start.id=s,start.cent=0; //起始节点编号以及层号
q.push(start); //将起始节点压入队列
inq[start.id]=true; // 标记
while(!q.empty())
{
node p=q.front(); //取出队首
q.pop(); //删
for(int i=0;i<adj[p.id].size();i++) //遍历从p.id能到的节点
{
node neww=adj[p.id][i];
neww.cent=p.cent+1; //层号加1
if(inq[neww.id]==false&&neww.cent<=l) //如果未曾入队且层数不超过l,则入队
{
q.push(neww);
inq[neww.id]=true; //标记入过队
numfoward++; //转发数加1
}
}
}
return numfoward;
}
int main()
{
node user;
cin>>n>>l;
for(int i=1;i<=n;i++)
{
user.id=i;
int m;
cin>>num;
for(int j=0;j<num;j++)
{
cin>>m;
adj[m].push_back(user);
}
}
int flag,mb;
cin>>flag;
while(flag--)
{
memset(inq,false,sizeof(inq));
cin>>mb;
cout<<BFS(mb)<<endl;
}
return 0;
}