Programming, Graph Theory, Computer Science, Data Science.
They tend to be slow for other operations — for example, listing everything adjacent to a vertex requires checking every single vertex in the graph. They also typically require more space than other models, especially with sparse graphs (graphs with “few” edges). An adjacency matrix needs to