Graph | Question 1

Last Updated :
Discuss
Comments

Which of the following ways is preferred to represent a graph for its efficient BFS and DFS traversals for a general graph which may not be very well connected?

Adjacency Matrix

Adjacency List

Both are same efficiency wise

None of the two are efficient

This question is part of this quiz :

Quiz On Graph Data Structure
Tags:
MCQ
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy