Answer
minimum spanning
Work Step by Step
A tree that is created from a weighted graph and that has the smallest possible weight is called the minimum spanning tree.
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.