@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)