MST  Minimum Spanning Tree
Find the minimum spanning tree of the graph.
Input
On the first line there will be two integers N  the number of nodes and M  the number of edges. (1 <= N <= 10000), (1 <= M <= 100000)
M lines follow with three integers i j k on each line representing an edge between node i and j with weight k. The IDs of the nodes are between 1 and n inclusive. The weight of each edge will be <= 1000000.
Output
Single number representing the total weight of the minimum spanning tree on this graph. There will be only one possible MST.
Example
Input: 4 5 1 2 10 2 3 15 1 3 5 4 2 2 4 3 40 Output: 17
hide comments
az2019:
20181205 07:13:22
54 is wrong about capacity 

ameernsr:
20181205 06:19:41
SALAM GUYS 

masterchef2209:
20181017 15:34:28
100 with prims AC in one go \('_')/ 

hoang10tin:
20180924 12:13:09
AC in one go :)))) 

Erick:
20180727 23:30:00
AC in one go!! 100 :) 

abdelhameedddd:
20180719 02:19:30
ac in one go


cnavneet:
20180711 19:32:46
AC in one go.. Simple problem based on Kruskal's minimum spanning tree.. 

vd09:
20180708 20:08:36
stuck in 91.92 point, what should i do now?


adityad1998:
20180630 09:25:52
Simple Kruskal,exactly same as https://www.spoj.com/problems/CSTREET/. 

coollllmann:
20180504 15:08:21
int score: 81.82

Added by:  Nikola P Borisov 
Date:  20081020 
Time limit:  1s2s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 