An undirected graph with ‘n’ vertices and ‘e’ edges will require a memory space of n locations plus:

1.2 An undirected graph with ‘n’ vertices and ‘e’ edges will require a memory space of n locations
plus:
A) 2e+1
B) 2e-1
C) 2e
D) None of the above

Leave a Reply