Question

Respond to the following in a minimum of 175 words:

Discuss the disadvantages of adjacency list representation of a weighted graph representation.

Answer 1

`Hey,

Note: Brother if you have any queries related the answer please do comment. I would be very happy to resolve all your queries.

Adjacency lists are not well suited for parallelism since the lists require that we traverse the neighbors of a vertex sequentially.

Access Time
In an adjacency matrix, it takes O(1) time to check the distance between two connected nodes, since you can just look it up in the array. However, in the adjacency list, you need to list all the nodes that the node is connected to, in order to find the other node of the edge required.

adjacency lists are simple, but if we want to find whether the graph contains a particular edge, we have to search through the edge list. If the edges appear in the edge list in no particular order, that's a linear search through |E|∣E∣vertical bar, E, vertical bar edges.

Kindly revert for any queries

Thanks.