Use Kruskal’s Algorithm to find a minimum weight spanning tree for the following weighted
graph

Question

Use Kruskal’s Algorithm to find a minimum weight spanning tree for the following weighted
graph

bee_see · Answer

attachment

bee_see · Answer

https://docs.google.com/document/d/1EpOHan8ZG3z8msTltLhix-WfvKnPcxcsmyk15uJZq7c/edit?usp=sharing

triciaal · Answer

sorry don't know what that algorithm is.

triciaal · Answer

@freckles  @jim_thompson5910  @ganeshie8     will you please help?

triciaal · Answer

@zepdrix help?

triciaal · Answer

@UnkleRhaukus

unklerhaukus · Answer

`E13 (e,c) 13`
this one should be 
`E13 (d,c) 13`

unklerhaukus · Answer

...but that edge didn't make to the mst anyway,
    so i guess you should also 'whiteout' the 13 on your graph too.

Then you might like to find the weight of this minimal spanning tree,

triciaal · Answer

@UnkleRhaukus thanks for responding  think person is not here now.  I was messaged and tagged earlier but never did this. could not help.
thanks.

bee_see · Answer

@UnkleRhaukus so my answer is correct? was that vertex pair the only mistake I did?

unklerhaukus · Answer

Yeah the rest is good