A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

Bee_see

  • one year ago

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

  • This Question is Closed
  1. Bee_see
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

  2. Bee_see
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

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

  3. triciaal
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    sorry don't know what that algorithm is.

  4. triciaal
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    @freckles @jim_thompson5910 @ganeshie8 will you please help?

  5. triciaal
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    @zepdrix help?

  6. triciaal
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    @UnkleRhaukus

  7. UnkleRhaukus
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

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

  8. UnkleRhaukus
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    ...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,

  9. triciaal
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

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

  10. Bee_see
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

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

  11. UnkleRhaukus
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Yeah the rest is good

  12. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...

23

  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.