What are the advantages of using adjacency lists over adjacency matrices for representing graphs in non-linear data structures?
I’m currently learning about different ways to represent graphs in non-linear data structures, such as using adjacency lists and adjacency matrices. I understand that both have their pros and cons, but I’m curious about the specific scenarios where one might be preferred over the other