问题描述:一个连接图,将其转化为树,求以哪个点为根,使树的高度最高。
解题思路:以任意一点出发,得到最深的点都是最深的根,再以其中一个出发收集其他根(证明???),dfs与bfs都可以。
AC代码:
dfs:
#include<iostream>
#include<vector>
#include<set>
#include<cstring>
using namespace std;
#define MAX 10005
vector<int>graph[MAX];
set<int>arr,deepest;
bool vis[MAX];
int M=0;
void visit(int v,int deep)//访问节点
{
vis[v]=1;++deep;
for(int i=0;i<graph[v].size();++i){
if(!vis[graph[v][i]]){
visit(graph[v][i],deep);
}
}
//printf("%d %d\n",v,deep);
if(deep>M){
M=deep;deepest.clear();//这里会清除备选的点。
}
if(deep==M)deepest.insert(v);
}
int connect(int n)//连通图
{
int cnt=0;
memset(vis,0,n);//memset用vector会出错?????
for(int i=1;i<n;++i){
if(!vis[i]){
visit(i,0);
++cnt;
}
}
return cnt;
}
int main()
{
freopen("test.txt","r",stdin);
int x,N,a,b;
scanf("%d",&N);
x=N;++N;
while(--x){
scanf("%d%d",&a,&b);
graph[a].push_back(b);
graph[b].push_back(a);
}
x=connect(N);
if(x>1)printf("Error: %d components",x);
else{
set<int>::iterator it=deepest.begin();
x=*it;memset(vis,0,N);arr=deepest;//得到的备选点都是最深的根
visit(x,0);deepest.insert(arr.begin(),arr.end());
for(it=deepest.begin();it!=deepest.end();++it)printf("%d\n",*it);
}
return 0;
}
bfs:
#include<bits/stdc++.h>
using namespace std;
bool visited[10001]={0};
int level[10001]={0};
int maxlength=0;
map<int,vector<int> > tree;
queue<int >qu;
set<int>out;
void bfs(int v)
{
int a,i;
visited[v]=1;
level[v]=1;
qu.push(v);
while(!qu.empty()){
a=qu.front();
qu.pop();
for(i=0;i<tree[a].size();++i){
if(!visited[tree[a][i]]){
qu.push(tree[a][i]);
visited[tree[a][i]]=1;
level[tree[a][i]]=level[a]+1;
}
}
}
maxlength=level[a];
}
int main()
{
int N,i;
freopen("test.txt","r",stdin);
scanf("%d",&N);
for(i=1;i<N;++i){
int c1,c2;
scanf("%d %d",&c1,&c2);
tree[c1].push_back(c2);
tree[c2].push_back(c1);
}
bfs(1);
for(i=1;i<=N;i++){ //是否是一个棵树
if(!visited[i]){
int count=2;
bfs(i);
for(i=1;i<=N;++i){
if(!visited[i]){
bfs(i);++count;
}
}
printf("Error: %d components\n",count);
return 0;
}
}
for(i=1;i<=N;i++){
if(level[i]==maxlength) out.insert(i);
}
memset(visited,0,sizeof(visited));
memset(level,0,sizeof(level));
set<int>::iterator it=out.begin();
bfs(*it);
for(i=1;i<=N;i++){
if(level[i]==maxlength) out.insert(i);
}
for(it=out.begin();it!=out.end();++it)printf("%d\n",*it);
return 0;
}