This activity from the Nuffield Foundation shows students how to use Kruskal’s and Prim’s algorithms to solve minimum connector problems. A cable TV company wants to lay cables to connect the towns, laying the cable along the roads shown on a map of the Isle of Wight. They want to connect all of these towns to their cable network using the minimum total length of cable. The students are then set a second problem involving a theme park, where the manager of the theme park wants to widen and re-surface some of the paths to provide better access to the rides for wheelchairs. His aim is to provide better paths to connect all parts of the theme park, but using the minimum total length possible.

Show health and safety information

Please be aware that resources have been published on the website in the form that they were originally supplied. This means that procedures reflect general practice and standards applicable at the time resources were produced and cannot be assumed to be acceptable today. Website users are fully responsible for ensuring that any activity, including practical work, which they carry out is in accordance with current regulations related to health and safety and that an appropriate risk assessment has been carried out.

Downloads

Published by

Actions

Share this resource