Which of the following data structures is more suitable for graph representation in Floyd Warshall Algorithm?

Which of the following data structures is more suitable for graph representation in Floyd Warshall Algorithm?

a) Adjacency Matrix
b) Adjacency List
c) Incidence Matrix
d) Incidence List

From the Combined Bank Assistant Programmer (CSE) March 2021 – Preliminary exam, question 5 of 86.

More from this paper

Previous: In a shop, customers are provided the service as a first-come-first-served policy. But some special customers can be served at any time…
Next: Which of the following is not a method of the Thread class?
All questions in Combined Bank Assistant Programmer (CSE) March 2021 – Preliminary