Exercises
You live in New York, and you need to visit Los Angeles, Miami, Seattle, and Houston.
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?
From: | |||||||
CHI | NYC | LAX | MIA | SEA | HOU | ||
CHI |
|
|
|
|
|
||
To: | NYC |
|
|
|
|
|
|
LAX |
|
|
|
|
|
||
MIA |
|
|
|
|
|
||
SEA |
|
|
|
|
|
||
HOU |
|
|
|
|
$294 |
Figure 9.119 Flight costs between Chicago, New York, Los Angeles, Miami, Seattle, and Houston. Source: www.travelocity.com.
Want to see the full answer?
Check out a sample textbook solutionChapter 9 Solutions
Mathematics: A Practical Odyssey
- Find the euler circuit from the following grapharrow_forwardIs the graph and find the nearest neighbor algorithm to find a Hamilton circuit that begins at vertex E.arrow_forwardRefer to the weighted graph attached, and answer the following: 1. What is the total weight of the shortest path from vertex A to E?2. The graph has an Euler circuit.3. What is the chromatic number of the graph? Choices: 1. True2. False3. 894. 725. 46. 907. 38. 70arrow_forward
- For which values of n does the graph Qn have an Euler circuit?arrow_forwardThe Roanoke, Virginia, distributor of Rainwater Beer delivers beer by truck to stores in six other Virginia cities, as shown in the following network: The mileage between cities is shown along each branch. Determine the shortest truck route from Roanoke to each of the other six cities in the network.arrow_forwardSolve the shortest path problems shown in the attached picture by hand using the original implementation of Dijkstra's algorithm. Count the number of distance updates, provide the shortest path solution and the hand-drawn trees of shortest paths for (a) and (b).arrow_forward
- Discrete Mathematics and Its Applications ( 8th I...MathISBN:9781259676512Author:Kenneth H RosenPublisher:McGraw-Hill EducationMathematics for Elementary Teachers with Activiti...MathISBN:9780134392790Author:Beckmann, SybillaPublisher:PEARSON
- Thinking Mathematically (7th Edition)MathISBN:9780134683713Author:Robert F. BlitzerPublisher:PEARSONDiscrete Mathematics With ApplicationsMathISBN:9781337694193Author:EPP, Susanna S.Publisher:Cengage Learning,Pathways To Math Literacy (looseleaf)MathISBN:9781259985607Author:David Sobecki Professor, Brian A. MercerPublisher:McGraw-Hill Education