Year 11 General
Students explore the number of possible routes between various numbers of points. They create a network diagram to represent a particular situation and find the shortest route by trial and error. Students then apply the Nearest Neighbour and Minimum Spanning Tree algorithms to arrive at a good approximation of a solution.
