2. 16, 10 19- A B 21 24 Apply the nearest neighbor algorithm to the graph above starting at vertex A. Give your answer as a list of vertices, starting and ending at vertex A. Example: ABCDA
2. 16, 10 19- A B 21 24 Apply the nearest neighbor algorithm to the graph above starting at vertex A. Give your answer as a list of vertices, starting and ending at vertex A. Example: ABCDA
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
8
![16
10
19
A
21
24
Apply the nearest neighbor algorithm to the graph above starting at vertex A. Give your answer as a list of
vertices, starting and ending at vertex A. Example: ABCDA
Enter text [more..]](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F821086ed-6eae-43c8-985a-f958464543dc%2Fa41a731c-ebc6-487b-899e-81bcdffe7665%2Fgrxpj3p_processed.jpeg&w=3840&q=75)
Transcribed Image Text:16
10
19
A
21
24
Apply the nearest neighbor algorithm to the graph above starting at vertex A. Give your answer as a list of
vertices, starting and ending at vertex A. Example: ABCDA
Enter text [more..]
Expert Solution

Step 1
In the graphical representation of Travelling Salesman Problem vertices corresponds to the cities and weights of the edges denotes the distance between the cities .
Nearest Neighbour Algorithm :
- Choose an arbitrary vertex x as starting vertex and find all the vertices adjacent to vertex v , say v1,v2,........,vn .
- Find the vertex vk that is closet to vertex v w(v,vk) = min { w(v,v1),w(v,v2),......,w(v,vi)} , 1<= k <=1 join the two vertices v and vk to form a path of length one say p .
- Select a vertex which is not selected earlier from the last traced vertex and join it in the path to extend the path .
- If the path contains all vertices of the graph . Then we are done . Now to obtain Hamiltonian circuit join the terminal vertices of the path by edge of minimum weight existing between the two vertices . Otherwise repeat steps 2 and 3 .
Step by step
Solved in 2 steps with 1 images

Recommended textbooks for you

Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated

Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY

Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated

Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY

Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,

