Thinking Mathematically (6th Edition)

Published by Pearson
ISBN 10: 0321867327
ISBN 13: 978-0-32186-732-2

Chapter 14 - Graph Theory - 14.4 Trees - Concept and Vocabulary Check - Page 930: 4


Kruskal's, weight, circuits

Work Step by Step

A procedure that yields the tree in Exercise 3 is called Kruskal's Algorithm. The idea of the algorithm is to always pick the edge with the smallest available weight, but avoid creating any circuits.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

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