Back to the full dot-point answer
QLDGeneral MathematicsQuick questions
Unit 4: Investing and networking
Quick questions on Minimum spanning trees and connector problems (QCE General Mathematics Unit 4)
2short Q&A pairs drawn directly from our worked dot-point answer. For full context and worked exam questions, read the parent dot-point page.
What is the minimum spanning tree?Show answer
When the edges carry weights (distances, costs, times), the minimum spanning tree is the spanning tree whose total edge weight is the smallest. It is the cheapest way to connect every vertex with no redundant link. This solves the minimum connector problem.
What is prim's algorithm?Show answer
Prim's algorithm grows the tree one vertex at a time.
Have a question we have not covered?
This dot-point answer is short enough that we have not extracted many short questions yet. Read the full dot-point answer or ask Mo, our study assistant, in the chat for follow ups.