Home Hospital Mall Esplanade Pet Shop Home 2 4 3.53 Hospital 3.53 3 2.40 Mall 4 3.53 30 2.40 --- Esplanade 3.53 3 30 2.22 Pet Shop 6 2.40 2.40 2.22

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
100%

[2B] (Please type and draw your answers digitally).The given table below (1st picture) shows the 5 different places that you would like to visit on a particular day. The table below shows the estimated distance (in kilometers per hour) it takes you to travel from one place to another. If you will visit each of these places exactly once, determine the shortest time possible it would take you to do using the Edge-Picking AlgorithmExample (2nd photo) already provided in the photos below..

 

 

Home
Hospital
Mall
Esplanade
Pet Shop
Home
4
3.53
---
Hospital
2
3.53
3
2.40
Mall
4
3.53
30
2.40
Esplanade
3.53
3
30
2.22
---
Pet Shop
2.40
2.40
2.22
Transcribed Image Text:Home Hospital Mall Esplanade Pet Shop Home 4 3.53 --- Hospital 2 3.53 3 2.40 Mall 4 3.53 30 2.40 Esplanade 3.53 3 30 2.22 --- Pet Shop 2.40 2.40 2.22
H.
Grocery
Video rental
Home
Post office
store
store
Bank
Required answer:
Home
14
12
20
23
12
Post office
8
12
21
14
23
12
17
Grocery
store
26
G
Video rental
20
12
17
18
store
Bank
23
21
11
18
17
21
\11
12
NOTE: THIS IS ONLY A
SAMPLE
18
Required answer:
Applying the Edge Picking Algorithm, we find the following Hamiltonian circuit with the
minimum weight (in minutes): HV – VP – PG – GB – BH, or HVPGBH
The obtained minimum time is: 20 + 12 + 8 + 11 + 23 = 74 minutes.
|
|
%3D
14
Transcribed Image Text:H. Grocery Video rental Home Post office store store Bank Required answer: Home 14 12 20 23 12 Post office 8 12 21 14 23 12 17 Grocery store 26 G Video rental 20 12 17 18 store Bank 23 21 11 18 17 21 \11 12 NOTE: THIS IS ONLY A SAMPLE 18 Required answer: Applying the Edge Picking Algorithm, we find the following Hamiltonian circuit with the minimum weight (in minutes): HV – VP – PG – GB – BH, or HVPGBH The obtained minimum time is: 20 + 12 + 8 + 11 + 23 = 74 minutes. | | %3D 14
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY