Minimum Connector Problems and Prim’s Algorithm is a part of the VCE Further Maths topic Networks and Decision Mathematics. It is part of the subtopic Trees and Minimum Connector Problems. A connector problem uses a minimum spanning tree to find the least cost to link locations or objects. These problems are often real-world scenarios. Prim’s Algorithm is a method of finding a minimum spanning tree of a weighted, non-directional network.
What is Prim’s Algorithm?
This video introduces Prim’s Algorithm as a method of finding the minimum spanning tree.
Minimum Connector Problems
This next video looks at solving minimum connector problems.
Want to learn more? Check out more of our VCE Mathematics resources here!
