What is generally true of Adjacency List and Adjacency Matrix representations of graphs?

In graph theory and computer science, an adjacency list is a collection of unordered lists used to represent a finite graph. Each list describes the set of neighbors of a vertex in the graph. This is one of several commonly used representations of graphs for use in computer programs.

@moaaz said in What is generally true of Adjacency List and Adjacency Matrix representations of graphs?:
 Lists require less space than matrices but take longer to find the weight of an edge (v1,v2)