Draw the circuit produced using the nearest neighbor...

Name: Draw the circuit produced using the nearest neighbor algorithm starting at the vertex on the far right. Draw by clicking on a starting vertex, then clicking on each subsequent vertex. Be sure to draw the entire circuit in one continuous sequence. Click outside the graph to end your path. Clear All Draw: Polygon
Uploaded: 2022-02-23T06:34:53-08:00
Duration: 4 min 46 s
Channel: Kranti S
Description: Draw the circuit produced using the nearest neighbor algorithm starting at the vertex on the far right. Draw by clicking on a starting vertex, then clicking on each subsequent vertex. Be sure to draw the entire circuit in one continuous sequence. Click outside the graph to end your path. Clear All Draw: Polygon

Draw the circuit produced using the nearest neighbor algorithm starting at the vertex on the far right. Draw by clicking on a starting vertex, then clicking on each subsequent vertex. Be sure to draw the entire circuit in one continuous sequence. Click outside the graph to end your path. Clear All Draw: Polygon

Transcript

00:01 In this question we need to draw the circuit produced using the nearest neighbor algorithm starting at the vortex on the far right and so for this we first name the vortex point as a b c and d that is first this will be a this will be b d d and e now we have to draw the entire circuit in one continuous sequence is starting on a vortex so we use an nearest sequence starting on a vortex so we use a nearer neighbor algorithm nearest neighbor algorithm starting at a to find a hamiltonian circuit starting at a to find a hamiltonian circuit to find a hamiltonian circuit to find a hamiltonian circuit so to draw this circuit we will follow some steps so first step is from the starting vertex choose the edge with the smallest cost from the starting vertex choose the edge with the smallest cost choose the edge with smallest cost and use that as the first edge of your circuit now in this second step what we have to do continue in this manner choosing the among choosing among the edges that connect from the current vertex to the you have not yet visited like continue this process and step second it was and step three when you have visited every vertex return to the starting vertex when you have visited every vertex return to the starting vertex so what we have the first vortex as a let it be and the smallest cost will be one here it is one and eight so 14 and 4 so the smallest one is one so we need to follow this path this will be the first edge now from the vortex b the minimum will be excluding which edge we have used already is 2 then 15 then 16 so the smallest one is 2 so we will connect that this will be the third point now from the point e from the point e from the vertex e the edges are 7 5 and 8 so the smallest one is 5 only so we will connect that so we got this edge now from point d we have 10 15 and 4 but we can't go directly to a because we have to reach each and every vertex so after 4 the smallest one is so we have to reach the point c.

04:08 So we will get this vertex and from the point c the smallest one is 6, 14 and 15, 6, 14 and 7.

04:21 So the smallest one is 6...

Question

Please give Ace some feedback