Create a weighted graph whose vertices represent each location in the city plan below. The

weights of the edges are the number of blocks $($entered vertically or horizontally$)$ between

locations, going around obstacles. $($You may use squares with destinations in them but not

with trees or other obstacles.

Then, use the Nearest Neighbor Algorithm to find an efficient Hamiltonian circuit starting

and ending at the car wash. State the circuit.

Then, use the best edge algorithm to find an efficient Hamiltonian circuit. Stae the total

weight of each circuit.

Car

wash

Pizza

place

Phone

store

Pool

Gas

station

Lego

store

Taco

bar