Q38
In which graph representation is it more efficient to perform BFS, an adjacency matrix or an adjacency list?
A.
Adjacency list
AnswerB.
Adjacency matrix
C.
Both are equally efficient.
D.
It depends on the graph density.
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board