You live in Atlanta, and you need to visit Boston, Denver, Phoenix, and Portland.
a. How many different circuits does your graph have?
b. Approximate the cheapest route, using the nearest neighbor algorithm. Draw this route’s graph.
c. Approximate the cheapest route, using the repetitive nearest neighbor algorithm. Draw this route’s graph.
d. Approximate the cheapest route, using the cheapest edge algorithm. Draw this route’s graph.
e. Why would it not be appropriate to find the cheapest route, using the brute force method?
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here