Back to the full dot-point answer
QLDGeneral MathematicsQuick questions
Unit 4: Investing and networking
Quick questions on Networks and decision mathematics (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 minimum spanning tree with Prim's algorithm?Show answer
A spanning tree connects every vertex with no cycles. The minimum spanning tree (MST) is the one with the smallest total edge weight. Prim's algorithm builds it greedily:
What is shortest path?Show answer
The shortest path between two vertices is the route of least total weight. In General Mathematics you find it by inspection on small networks, systematically comparing the total weight of each candidate route and keeping the smallest. Weights often represent distance, time or cost.
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.