Nearest Neighbor Repetitive Nearest Neighbor (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 68) Worksheet (Continue working on Project)

Nearest Neighbor (until 5:15) https://www. youtube. com/watch

Nearest Neighbor Is performed by continually taking an edge with the smallest weight. This will give you approximate solutions to traveling salesperson problems. https://www.youtube.com/watch?v=zPgsNsOfxQ8

Steps to solving Nearest Neighbor Start at the designated starting vertex. If there is no designated staring vertex pick any vertex. From the starting vertex go to its nearest neighbor (i.e. the vertex for which the corresponding edge has the smallest weight). From each vertex go to the nearest neighbor, choosing only among the vertices that have not been visited (if there are more than one nearest neighbor with the same measure choose from them at random). Continue the process until all the vertices have been visited. From the last vertex return to the starting vertex.

Repetitive Nearest Neighbor https://www. youtube. com/watch Is similar to nearest neighbor but you choose which vertex to start from. Repeat the process several times, each time starting from a different vertex. You may find different “nearest neighbor solutions” Then you can pick the best.