1) In network figure below, use Floyd's algorithm to determine the shortest routes between each of the following pairs of nodes: 10 5 15 1.1.) From node 5 to node 1. a) 5-1,5-4-1, 5-4-2-1, distance 12 b) 5-1,5-4-2,5-4-2-1, distance 12 1.2. From node 3 to node 5. a) 3-5, 3-5, distance 15 b) 3-5, 3-4-5, distance = 10 c) 3-5, 4-3-5, distance = 21 c) 5-1,5-4-1,5-4-3-1, distance 20 5-1,5-4-3,5-4-2-1, distance 20 d) d) 3-5, 3-4, 3-4-5, distance = 10
1) In network figure below, use Floyd's algorithm to determine the shortest routes between each of the following pairs of nodes: 10 5 15 1.1.) From node 5 to node 1. a) 5-1,5-4-1, 5-4-2-1, distance 12 b) 5-1,5-4-2,5-4-2-1, distance 12 1.2. From node 3 to node 5. a) 3-5, 3-5, distance 15 b) 3-5, 3-4-5, distance = 10 c) 3-5, 4-3-5, distance = 21 c) 5-1,5-4-1,5-4-3-1, distance 20 5-1,5-4-3,5-4-2-1, distance 20 d) d) 3-5, 3-4, 3-4-5, distance = 10
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
100%
UPVOTE WILL BE GIVEN. PLEASE WRITE THE COMPLETE SOLUTIONS. NO LONG EXPLANATION NEEDED. CHOOSE THE CORRECT ANSWER.
![1) In network figure below, use Floyd's algorithm to determine the shortest
routes between each of the following pairs of nodes:
2
Love
10
15
1.1.) From node 5 to node 1.
a) 5-1, 5-4-1, 5-4-2-1,
distance 12
b) 5-1, 5-4-2,5-4-2-1,
distance 12
1.2. From node 3 to node 5.
a) 3-5, 3-5, distance 15
b) 3-5, 3-4-5, distance 10
c) 3-5, 4-3-5, distance = 21
1.3. From node 5 to node 3.
a) 5-3, distance 15
b) 5-3,5-4-2-1-3, distance
= 22
1.4) From node 5 to node 2
a) 5-2,5-3-4-2, distance = 26
b) 5-2,5-4-2, distance = 9
5
c) 5-1,5-4-1, 5-4-3-1,
distance 20
d) 5-1, 5-4-3,5-4-2-1,
distance 20
d) 3-5, 3-4, 3-4-5, distance =
10
c) 5-3,5-4-3, distance = 10
d) 5-3, 3-4-5, distance 10
c) 5-2,5-4-3-1-2, distance
d) 5-2,5-3-1-2, distance = 28
= 23](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F38238e24-86d8-49cc-88db-deb012ae0a0f%2Ff3e76dcb-5210-43e2-9e86-b1e46b4931f4%2Faw4stjxc_processed.png&w=3840&q=75)
Transcribed Image Text:1) In network figure below, use Floyd's algorithm to determine the shortest
routes between each of the following pairs of nodes:
2
Love
10
15
1.1.) From node 5 to node 1.
a) 5-1, 5-4-1, 5-4-2-1,
distance 12
b) 5-1, 5-4-2,5-4-2-1,
distance 12
1.2. From node 3 to node 5.
a) 3-5, 3-5, distance 15
b) 3-5, 3-4-5, distance 10
c) 3-5, 4-3-5, distance = 21
1.3. From node 5 to node 3.
a) 5-3, distance 15
b) 5-3,5-4-2-1-3, distance
= 22
1.4) From node 5 to node 2
a) 5-2,5-3-4-2, distance = 26
b) 5-2,5-4-2, distance = 9
5
c) 5-1,5-4-1, 5-4-3-1,
distance 20
d) 5-1, 5-4-3,5-4-2-1,
distance 20
d) 3-5, 3-4, 3-4-5, distance =
10
c) 5-3,5-4-3, distance = 10
d) 5-3, 3-4-5, distance 10
c) 5-2,5-4-3-1-2, distance
d) 5-2,5-3-1-2, distance = 28
= 23
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
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 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education