Answer
{e, f }, {c, f }, {e, h}, {h, i}, {b, c}, {b, d}, {a, d}, {g, h}
Work Step by Step
--using Prim’s algorithm to find a minimum spanning tree for the given weighted graph.
-{e, f }, {c, f }, {e, h}, {h, i}, {b, c}, {b, d}, {a, d}, {g, h}
Discrete Mathematics and Its Applications, Seventh Edition
by Rosen, Kenneth
Published by
McGraw-Hill Education
ISBN 10:
0073383090
ISBN 13:
978-0-07338-309-5
Chapter 11 - Section 11.5 - Minimum Spanning Trees - Exercises - Page 802: 3
Update this answer!
You can help us out by revising, improving and updating this answer.
Update this answerAfter you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.
