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

A Adjancency Matrix

B Adjacency List

C Incidence Matrix

D Incidence List

Solution

Correct Answer: Option A

Practice More Questions on Our App!

Download our app for free and access thousands of MCQ questions with detailed solutions

Download Android App Login to Website

Related Topics