树的直径 (通过两次dfs或者bfs)

树的直径定义：一棵树中距离最远的两个点之间的距离就是树的直径

算法：

首先以任意一个点为起点，通过dfs或bfs求出源点到所有点的路径长度，从中选择长度最长的路径到达的点，再次以这个点为源点重复上述步骤，得到的第二个最长的路径连接的两个点就是树的直径。

code：

//求树的直径
#include<bits/stdc++.h>
using namespace std;
const int N = 510;
int cnt, head[N], nex[N];
struct p{
    int to, dist;
    p(){}
    p(int to, int dist){
        this->to = to;
        this->dist = dist;
    }
};
p g[N];
int dist[N];
void pre_work(){
    memset(head, 0, sizeof head);
    memset(nex, 0, sizeof nex);
    cnt = 1;
}
void dfs(int point, int father){
    for (int i = head[point]; i; i = nex[i]){
        p t = g[i];
        if(father == t.to)continue;
        dist[t.to] = dist[point] + t.dist;
        dfs(t.to, point);
    }
}
void add(int a, int b, int c){
    g[cnt].to = b;
    g[cnt].dist = c;
    nex[cnt] = head[a];
    head[a] = cnt++;
}
int main()
{
    freopen("in.in", "r", stdin);
    pre_work();
    int n;
    scanf("%d", &n);
    for (int i = 1; i < n; i++){
        int a, b, c;
        scanf("%d %d %d", &a, &b, &c);
        add(a, b, c);
        add(b, a, c);
    }
    //puts("OK1");
    dist[1] = 0;
    dfs(1, -1);
    //puts("OK2");
    int point = -1, mx = -1;
    for (int i = 1; i <= n; i++)if(dist[i] > mx){
        mx = dist[i];
        point = i;
    }
    //puts("OK3");
    memset(dist, 0, sizeof dist);
    dist[point] = 0;
    dfs(point, -1);
    mx = -1;
    //puts("OK4");
    int point2 = -1;
    for (int i = 1; i <= n; i++){
        if(mx < dist[i]){
            mx = dist[i];
            point2 = i;
        }
    }
    printf("%d -> %d\n", point, point2);
    return 0;
}