Assume that the Floyd-Warshall algorithm is applied on a directed graph H. The graph H is represented by the adjacency matrix shown below, the adjacency matrix represents the initial distances between ith and jth vertices. Which of the following statements is false? A B с D A 0 5 1 11 B ∞ 0 3 3 C 2 0 2 D 0 Select one: O A. There is a directed edge of weight 3 from vertex B to vertex C. O B. There is a directed edge of weight 5 from vertex B to vertex A. O C. There is no edge between vertex C and vertex A. O D. There is a directed edge of weight 2 from vertex C to vertex B. OF. There is a directed edge of weight 5 from vertex A to vertex B.

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
icon
Related questions
Question

choose

Assume that the Floyd-Warshall algorithm is applied on a directed graph H. The graph H is represented by the adjacency matrix shown below, the adjacency matrix
represents the initial distances between ith and jth vertices. Which of the following statements is false?
A B C D
A
05
1 11
B
0
3 3
с
2 0 2
D
0
Select one:
O A. There is a directed edge of weight 3 from vertex B to vertex C.
O B.
There is a directed edge of weight 5 from vertex B to vertex A.
O C.
There is no edge between vertex C and vertex A.
O D. There is a directed edge of weight 2 from vertex C to vertex B.
OF There is a directed edge of weight 5 from vertex A to vertex B.
Transcribed Image Text:Assume that the Floyd-Warshall algorithm is applied on a directed graph H. The graph H is represented by the adjacency matrix shown below, the adjacency matrix represents the initial distances between ith and jth vertices. Which of the following statements is false? A B C D A 05 1 11 B 0 3 3 с 2 0 2 D 0 Select one: O A. There is a directed edge of weight 3 from vertex B to vertex C. O B. There is a directed edge of weight 5 from vertex B to vertex A. O C. There is no edge between vertex C and vertex A. O D. There is a directed edge of weight 2 from vertex C to vertex B. OF There is a directed edge of weight 5 from vertex A to vertex B.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Sets
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.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education