东北四省赛E-Minimum Spanning Tree-贡献求和

最新推荐文章于 2022-07-19 12:17:47 发布

云淡风轻jzl

最新推荐文章于 2022-07-19 12:17:47 发布

阅读量344

点赞数 2

分类专栏：思维图论文章标签： MinSpanningTree 东北省赛贡献

本文链接：https://blog.csdn.net/Nothing_but_Fight/article/details/113395022

版权

图论同时被 2 个专栏收录

28 篇文章 0 订阅

订阅专栏

思维

8 篇文章 0 订阅

订阅专栏

这篇博客介绍如何利用数学概念和算法在给定树G的基础上，找到其线图L(G)的最小生成树(MST)，并提供了一个程序实例来计算所有边的总权重。通过理解两个图之间的关系和MST的概念，读者将学会如何高效地解决这类图论问题。

摘要由CSDN通过智能技术生成

题目描述：

In the mathematical discipline of graph theory, the line graph of a simple undirected weighted graph G is another simple undirected weighted graph L(G) that represents the adjacency between every two edges in G.

Precisely speaking, for an undirected weighted graph G without loops or multiple edges, its line graph L(G) is a graph such that:

Each vertex of L(G) represents an edge of G.
Two vertices of L(G) are adjacent if and only if their corresponding edges share a common endpoint in G, and the weight of such edge between this two vertices is the sum of their corresponding edges’ weight.

在这里插入图片描述 A minimum spanning tree(MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. That is, it is a spanning tree whose sum of edge weights is as small as possible.

Given a tree G, please write a program to find the minimum spanning tree of L(G).

输入描述：

The first line of the input contains an integer T(1≤T≤1000), denoting the number of test cases.

In each test case, there is one integer n(2≤n≤100000) in the first line, denoting the number of vertices of G.

For the next n−1 lines, each line contains three integers u,v,w(1≤u,v≤n,u≠v,1≤w≤109), denoting a bidirectional edge between vertex u and v with weight w.

It is guaranteed that ∑n≤10⁶.

输出描述：

For each test case, print a single line containing an integer, denoting the sum of all the edges’ weight of MST(L(G)).

输入样例：

输出样例：

8
4

大概思路：

在图G中，对某个有m条边的结点i而言，可以贡献给L(G)的边数为m*(m-1)/2，而对于MST(L(G))，结点i的最小临边贡献m-1次，其他m-1条边各贡献一次。详见代码。

代码如下：

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=1e5+20;
ll a[N],c[N];
int main()
{
	int T;
	cin>>T;
	while(T--)
	{
		int n,u,v;
		ll w,sum=0;
		scanf("%d",&n);
		for(int i=1;i<=n;i++)
		{
			a[i]=1e10;
			c[i]=0;
		}
		for(int i=1;i<n;i++)
		{
			scanf("%d%d%lld",&u,&v,&w);
			sum+=w<<1;
			c[u]++;
			c[v]++;
			a[u]=min(a[u],w);
			a[v]=min(a[v],w);
		}
		for(int i=1;i<=n;i++)
			sum+=a[i]*(c[i]-2);
		printf("%lld\n",sum);
	}
	return 0;
}