- row and column indices of matrix represent distinct vertices in graph - a value of 1 in matrix means there is an edge (directed edge from row ind to col ind if graph is directed) - a value of 0 means there is no edge ![[CleanShot 2024-05-25 at 13.53.31.png | 500]] - like the [[Array of Edges]], you could also preprocess the graph & build a hashmap of node neighbors (info for building that in the link) - if you want instant neighbors access for each node, instead of having to iterate through a row array