Exercises
You live in Chicago, and you need to visit New York, Los Angeles, Miami, and Seattle.
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
Bundle: Mathematics: A Practical Odyssey + WebAssign Printed Access Card for Johnson/Mowry's Mathematics: A Practical Odyssey, 8th Edition, Single-Term
- Social Network 4. A group of friends is represented by the graph given below. An edge connecting two names means that the two friends have spoken to each other in the last month. a. have John and Stacy talked to each other in the last week? b. How many of the friends in this group has Steve talked to in the last week? c. Among this group of friends, who has talked to the most people in the last week? d. Why would it not make sense for this graph to contain a loop? Michael John Steve Erin Stacy Adaarrow_forward17. Determine how many components the graph has, and explain why does it have that number. Marrow_forwardA delivery person must visit each street once before returning home (node E). What ordering of the streets minimize the total distance the delivery person must travel before returning home. (The numbers next to arc indicates the distance in meters for travelling). Based on the network below;arrow_forward
- Given the figure below. Redraw again the figure to determine the shortest path using The Edge – Picking Algorithm/Cheapest Link Methodarrow_forwardAnswer the following questions below by selecting the best answer. Which of the following is NOT a circuit in the graph? * B. F CC O ABFEA O BFDCB None of the Above 99 HUAWEIarrow_forwardA floor plan of a museum is shown. Draw a graph that represents the floor plan, where each vertex represents a room and an edge connects two vertices if there is a doorway between the two rooms. Is it possible to walk through the museum and pass through each doorway without going through any doorway twice? Does it depend on whether you return to the room you started at? Justify your conclusion.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