Graphs
8:00
Question 1 of 8
Which of the following data structures is most efficient for representing a sparse graph? [GATE CS 2011]
Adjacency Matrix
Adjacency List
Incidence Matrix
Adjacency Multi-list
Question 1 of 8
Which of the following data structures is most efficient for representing a sparse graph? [GATE CS 2011]