poj 1985 树的直径

题意：求树的直径。树的直径即树上距离最远的两个点之间的距离

思路：以任意点开始深搜，得到距离其最远的点；再以求得的点开始深搜，再次搜得的最远距离即为树的直径

#include <stdio.h>
#include <string.h>
#define N 100005
struct edge{
	int y,w,next;
}e[N*2];
int first[N],flag[N],top,max;
int n,m;
void init(){
	top = 0;
	max = 1;
	memset(first,-1,sizeof(first));
	memset(flag,0,sizeof(flag));
}
void add(int x,int y,int w){
	e[top].y = y;
	e[top].w = w;
	e[top].next = first[x];
	first[x] = top++;
}
void dfs(int i){
	int j;
	for(j = first[i];j!=-1;j=e[j].next)
		if(!flag[e[j].y]){
			flag[e[j].y] = flag[i]+e[j].w;
			dfs(e[j].y);
		}
}
int main(){
	freopen("a.txt","r",stdin);
	while(scanf("%d %d",&n,&m)!=EOF){
		int i,a,b,c;
		char ch;
		init();
		while(m--){
			scanf("%d %d %d %c",&a,&b,&c,&ch);
			add(a,b,c);
			add(b,a,c);
		}
		dfs(1);
		for(i = 2;i<=n;i++)
			if(flag[i] > flag[max])
				max = i;
		memset(flag,0,sizeof(flag));
		dfs(max);
		max = 1;
		for(i = 2;i<=n;i++)
			if(flag[i] > flag[max])
				max = i;
		printf("%d\n",flag[max]);
	}
	return 0;
}