Farthest Nodes in a Tree（树的直径）

Given a tree (a connected graph with no cycles), you have to find the farthest nodes in the tree. The edges of the tree are weighted and undirected. That means you have to find two nodes in the tree whose distance is maximum amongst all nodes.

Input
Input starts with an integer T (≤ 10), denoting the number of test cases.

Each case starts with an integer n (2 ≤ n ≤ 30000) denoting the total number of nodes in the tree. The nodes are numbered from 0 to n-1. Each of the next n-1 lines will contain three integers u v w (0 ≤ u, v < n, u ≠ v, 1 ≤ w ≤ 10000) denoting that node u and v are connected by an edge whose weight is w. You can assume that the input will form a valid tree.

Output
For each case, print the case number and the maximum distance.

Sample Input
2

4

0 1 20

1 2 30

2 3 50

5

0 2 20

2 1 10

0 3 29

0 4 50

Sample Output
Case 1: 100

Case 2: 80

裸的求树的直径
代码：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<queue>
#include<vector>
using namespace std;
const int N=30050;
typedef pair<int ,int> pii;
vector <pii > vt[N];
int ans;
int vis[N];
int dis[N];
int bfs(int x)
{
	int qp=0;
	memset(vis,0,sizeof(vis));
	memset(dis,0,sizeof(dis));
	ans=0;vis[x]=1;
	queue<int> q;
	q.push(x);
	while(!q.empty()){
		int t=q.front();
		q.pop();
		if(dis[t]>ans){
			ans=dis[t];
			qp=t;
		}
		for(int i=0;i<vt[t].size();i++){
			if(!vis[vt[t][i].first]){
				dis[vt[t][i].first]=dis[t]+vt[t][i].second;
				vis[vt[t][i].first]=1;
				q.push(vt[t][i].first);
			}
		}
	}
	return qp;
}
int main()
{
	int a,b,c;
	int t,k=1;
	cin>>t;
	while(t--){
		int n;
		cin>>n;
		for(int i=0;i<n;i++){
			if(!vt[i].empty())
				vt[i].clear();
		}
		for(int i=0;i<n-1;i++)
		{
			scanf("%d%d%d",&a,&b,&c);
			vt[a].push_back(make_pair(b,c));
			vt[b].push_back(make_pair(a,c));
		}
		bfs(bfs(0));
		printf("Case %d: %d\n",k++,ans);
	}
	return 0;
}