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
- Suppose you wish to install a drip sprinkler system and need to run a drip water line to five areas, as shown in the given graph. TI numbers show the distances in feet. What is the smallest number of feet of drip hose necessary to install? 43 70 72 40 46arrow_forwardDoes the graph of the bridges to the parts of the city create an Euler circuit, an Euler path, or neither. Explain how you know. If the tour guide wants to end where he started so people can get back in their cars, then how many bridges will he have to reuse? Explain. Hint: Make it an Euler Circuit. Give the tour guide a sample plan where the group can see every bridge and end where they started. If the tour guide wants to just see every bridge and he ends in a different place than where the tour began, then how many bridges will he have to reuse? Explain. Hint: Make it an Euler Path 5. Give the tour guide a sample plan where the group can see every bridge and he ends in a different place than where the tour began.arrow_forwardHow many edges will you have in a complete graph made of 40 vertices? Show all steps of your calculation.arrow_forward
- 17. Determine how many components the graph has, and explain why does it have that number. Marrow_forwardGraph the following.arrow_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
- Given the figure below. Redraw again the figure to determine the shortest path using The Edge – Picking Algorithm/Cheapest Link Methodarrow_forward4. Suppose the city of Königsberg had the arrangement of islands and bridges pictured on the left instead of the arrangement that we introduced previously. Represent the map as graph. Would the citizens be able to complete a stroll across each bridge and return to their starting points without crossing the same bridge twice? Explain why or why not.arrow_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_forward
- Given the figure below. Redraw again the figure to determine the shortest path using Greedy Algorithm/Nearest Neighborarrow_forwardDraw the network diagram for the above project.arrow_forward5. Find the number of vertices, the number of edges, and the degree of each vertex in the given undirected graph. Identify all isolated and pendant vertices. Find the sum of the degrees of the vertices of the graph.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