0 votes 0 votes How much storage is needed to represent a simple graph with n vertices and m edges using a) adjacency lists? b) an adjacency matrix? c) an incidence matrix? Rosen_discrete_mathematics section 10.4 question 70. thankyou. Mathematical Logic discrete-mathematics + – iamdeepakji asked Oct 29, 2018 iamdeepakji 205 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Adjacency List- O(V+E) Adjacency Matrix- O(V^2) Incident Matrix -O(VE) Soumya Tiwari answered Oct 29, 2018 Soumya Tiwari comment Share Follow See all 0 reply Please log in or register to add a comment.