图中度为0的节点之间最短距离

输入节点数目为n，存在n-1条路径，无向连通图。

思路：运用弗洛伊德算法计算多源最短路径，找到度为0的节点，计算两两之间的最短路径，并输出其中的最小值。

/**
 *Copyright @ 2019 Zhang Peng. All Right Reserved.
 *Filename:
 *Author: Zhang Peng
 *Date:
 *Version:
 *Description:
**/

#include<iostream>
#include<vector>
#include<map>
using namespace std;

int getlen(vector<vector<int>> & road, vector<vector<int>> & floyed, int start, int end)
{
	int sum = 0;
	int i = start, j = end;
	while (1)
	{
		int temp = floyed[i][j];
		sum += road[i][temp];
		i = temp;
		if (temp == end)
			break;
	}
	return sum;
}

int main()
{
	int num; 
	cin >> num;
	vector<vector<int >> road(num, vector<int>(num, pow(10,9)));
	map<int, int> m;
	vector<int> leaf;

	for (int i = 0; i < num - 1; i++)
	{
		int x, y, len;
		cin >> x >> y >> len;
		road[x - 1][y - 1] = len;
		road[y-1][x-1] = len;

		if (m.count(x-1) == 0)
			m[x-1] = 1;
		else
			m[x-1] += 1;

		if (m.count(y - 1) == 0)
			m[y - 1] = 1;
		else
			m[y - 1] += 1;
	}
	//确定度为0的节点
	map<int, int>::iterator it = m.begin();
	for (; it != m.end(); it++)
	{
		if (it->second == 1)
			leaf.push_back(it->first);
	}

	//弗洛伊德算法
	vector<vector<int >> floyed(num, vector<int>(num, 0));
	for (int i = 0; i < num;i++)
	for (int j = 0; j < num; j++)
		floyed[i][j] = j;

	for (int i = 0; i < num;i++)
	for (int j = 0; j < num;j++)
	for (int k = 0; k < num; k++)
	{
		long long  temp = road[i][k] + road[k][j];
		if (temp<road[i][j])
		{
			road[i][j] = temp;
			floyed[i][j] = k;
		}
			
	}

	//计算度为0的各节点之间的距离
	int length = INT_MAX;
	for (int i = 0; i < leaf.size();i++)
	for (int j = i+1; j < leaf.size(); j++)
	{
		int l = getlen(road, floyed, leaf[i], leaf[j]);
		if (l < length)
			length = l;
	}
	cout << length << endl;

    system("pause");
    return 0;
}