Worksheet 4 - Prim’s/Kruskal’s algorithms
A Prim’s/Kruskal’s algorithms based worksheet. Ideal for use an introductory task/homework.
Curriculum areas covered:
• Understand the language of networks including node, arc and weight
• Solve network optimisation problems using spanning trees
• Minimum spanning tree/minimum connector problem
• Least weight route/set of arcs
• Prim’s algorithm
• Kruskal’s algorithm
This pack includes:
Cover Sheet
Student worksheet
Answer Sheet
Network problems and algorithms are common elements of Operational Research (OR). For more information visit our website: theorsociety .com
Something went wrong, please try again later.
Great to have a worksheet with the networks drawn out, a real time-saver. Unfortunately, the solutions for using Prim's algorithm (Q5,6,7,8) are incorrect - whoever put this together has made the classic error of assuming that next edge you add must join to the most recently-added vertex, rather than finding the shortest arc from ANY of the vertices already part of the spanning tree.
Great to be able to find these resources - very useful for Further maths A-Level Decision maths, a subject which is poorly resourced apart from the set texts - would also be nice to have access the 2012 "www.learnaboutor.com" resources, which have disappeared recently. These provided brilliant practical introductions to the algorithms. Thanks again for your good work!
Report this resourceto let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.
£0.00