Respond to the following required content in a minimum of 250 words: Discuss the advantages and disadvantages of adjacency list and adjacency matrix in relation to a weighted graph representation....

Adjacency Matrix and Adjacency Lists are two ways through which we can represent a graph.
In the Adjacency Matrix form of graph representation, we have a two dimensional NxN matrix where matrix[i][j] = 1 indicates that there is an edge from vertex i to vertex j in the graph. This can be slightly modified to represent weighted graphs as well, such as stating matrix[i][j] = w implies that there is an edge from vertex i to j with weight w.
When it comes to Adjacency list, we have an array consisting of all the addresses linked lists that are used to represent the graph. Here, each linked list represents the vertex and the...