1. Cheapest-Link Algorithm/Sorted Edges (Unit 10) SOL: DM.2
Classwork
worksheet
Homework (day 69)

2. Cheapest-link Algorithm- is used to piece together a tour by picking the separate “links” of the tour on the basis of cost.
Steps:
Pick the cheapest length available (i.e. the edge with the smallest weight). (In case of a tie pick one at random.)
Mark it (say in red).
Pick the next cheapest link available and mark it.
3,4,…,n-1. Continue picking and marking the cheapest length unmarked link available that does not:
a. Close a circuit.
b. Create three edges coming out of a single vertex.
3. Connect the last two vertices to close the red circuit. This circuit gives us the Cheapest-link tour .

3. Cheapest Link Algorithm
Review: using the diagram apply each method and calculate the weight.
Brute Force, Nearest Neighbor method and Repetitive Nearest Neighbor
Cheapest Link Algorithm

4. Sorted Edges (Cheapest-Link Algorithm) https://www. youtube. com/watch

5. Ex: Sorted Edges A C B D 155 124 179 126 190 157 Steps:
List numbers in order from least to greatest.
Check number from smallest to largest if the circuit allows you to follow the path.
Add together all the checked numbers.

6. Cheapest-Link Algorithm