1. Use the Greedy Algorithm to find a Hamiltonian circuit starting at vertex D in the weighted graph shown below and show the total weight of the algorithm. Pickup Point A B 2. A bus that picks up day-workers for farmers has established pickup points at several places. The table below lists the distances (in miles) between the pickup points, measured along the only available routes. Starting at point D, use the Greedy Algorithm to find a route that takes the bus to each pickup point once and returns to point D. Give the total mileage for that route. C D E I 8 -14- 12 B 10 16 || 8 129 8 B I 16 18 8 16 8 18 8 15 9 16 16 15 3. A 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. (5pts)
1. Use the Greedy Algorithm to find a Hamiltonian circuit starting at vertex D in the weighted graph shown below and show the total weight of the algorithm. Pickup Point A B 2. A bus that picks up day-workers for farmers has established pickup points at several places. The table below lists the distances (in miles) between the pickup points, measured along the only available routes. Starting at point D, use the Greedy Algorithm to find a route that takes the bus to each pickup point once and returns to point D. Give the total mileage for that route. C D E I 8 -14- 12 B 10 16 || 8 129 8 B I 16 18 8 16 8 18 8 15 9 16 16 15 3. A 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. (5pts)
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
Use greedy algorithm to find a hamiltonian circuit starting at vertex D in the
Transcribed Image Text:ll Virgin Mobile
10:55 AM
O 38%
e elearn.xu.edu.ph
Instruction: Write on a white paper (i.e not yellow paper, not encoded but handwritten). Show
complete solution. Please scan your work and make sure that the output is in portrait mode. The
file type may be jpeg or pdf.
Deadline for submission: October 1, 2021 11PM
1. Use the Greedy Algorithm to find a Hamiltonian circuit starting at vertex D in the
weighted graph shown below and show the total weight of the algorithm.
10
B.
2. A bus that picks up day-workers for farmers has established pickup points at several
places. The table below lists the distances (in miles) between the pickup points, measured
along the only available routes. Starting at point D, use the Greedy Algorithm to find a
route that takes the bus to each pickup point once and returns to point D. Give the total
mileage for that route.
Pickup Point
A
C
A
12
8
16 18
8 -| 16 8
12
16 16
15
- 18 8 15
3. A 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. (5pts)
00
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 3 images
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
