Given a weighted graph and find the weight of the lightest spanning tree?

Question

Mathematics

Given a weighted graph and find the weight of the lightest spanning tree? G = { (0, 1)/37, (0, 2)/29, (0, 3)/21, (0, 4)/77, (0, 5)/16, (1, 2)/42 , (1, 3)/28, (1, 4)/51, (1, 5)/17, (1, 6)/51, (2, 3)/15, (2, 4)/19, ( 2, 5)/54, (2, 6)/59, (3, 4)/79, (3, 5)/34, (3, 6)/35, (4, 6)/36, (5, 6)/28 }
Or a link to such a topic, because I can't find

Answer 1

Not a cover tree , my young friend - a spanning tree .
No wonder you ca n't find . Lost in three pines.