[HackerEarth] You are given a weighted undirected graph consisting of N nodes (numbered from 0 to N) and M edges. Print the weight of it's Minimum Spanning Tree. - 题解

暂无题解

题目信息
题号 P16838
标题 [HackerEarth] You are given a weighted undirected graph consisting of N nodes (numbered from 0 to N) and M edges. Print the weight of it's Minimum Spanning Tree.
难度 普及
返回题目