11. Apply the Nearest-Neighbor Algorithm to find a Hamiltonian circuit for the graph below. Begin at...

Transcribed Image Text:

11. Apply the Nearest-Neighbor Algorithm to find a Hamiltonian circuit for the graph below. Begin at vertex A. Find the cost. A 112 B 99 78 88 88 44 84 121 93 103 96 135 E D 12. Sort the edges from least to greatest. Apply the Sorted-Edges Algorithm to find a Hamiltonian circuit for the graph below. If an edge is not used, state the reason why (e.g., creates 3 edges at a vertex, closes circuit without all vertices). Find the cost. B 99 78 88 88 112 shar A 84 D 135 121 93 103 C cgid 1 w 01-10 06 96 no bra ading mainosios E GRAPH THEORY 3 11. Apply the Nearest-Neighbor Algorithm to find a Hamiltonian circuit for the graph below. Begin at vertex A. Find the cost. A 112 B 99 78 88 88 44 84 121 93 103 96 135 E D 12. Sort the edges from least to greatest. Apply the Sorted-Edges Algorithm to find a Hamiltonian circuit for the graph below. If an edge is not used, state the reason why (e.g., creates 3 edges at a vertex, closes circuit without all vertices). Find the cost. B 99 78 88 88 112 shar A 84 D 135 121 93 103 C cgid 1 w 01-10 06 96 no bra ading mainosios E GRAPH THEORY 3