Help with min spanning trees

[almostdonewithschooling]

The answer is 94 km, but does anyone know how they got that?

[PhoenixxFire]

The answer is 94 km, but does anyone know how they got that?

So to work out a minimum spanning tree you pick a vertex and then draw a line from that vertex down the edge with the least weighting (ie. the smallest number next to it). Then you look at both of the vertexes and pick the edge with the least weighting off either of those.
-Every vertex needs to be connected
-Disregard loops
-You don't need to connect vertexes to multiple other vertexes. If A is connected to B and C, then B and C don't need to be connected to each other - just disregard that edge.

Give this a shot and see if it gives you 94km.