A+ » VCE » Further Maths U3 & 4 Master Notes » OA2 Networks and Decision Mathematics » 3.3 Guide to Minimal Connector Problems

3.3 Guide to Minimal Connector Problems

Note: if you cannot remember how to construct minimum spanning trees using Prim’s algorithm, revise notes for 3.2 Minimum Spanning Trees.

Guide to Analysing Minimal Connector Problems

  • Minimal connector problems are problems which require the use of a minimum spanning tree.
  • Always use Prim’s algorithm unless otherwise stated as inspection is more error prone and generally slower.
  • It is generally easier to select a starting node with a small amount of edges.
This content is for Master Notes FM members only. Unlock the content by signing up for a membership level - quick and easy!
Log InSign Up