Programming, Graph Theory, Computer Science, Data Science.
columns. A given intersection is true if those vertices are adjacent, or false if they are not (note: if the graph is directed, be sure to define that relationship in rows vs columns). Adjacency matrices perform strongly with edge lookups, with a constant-time lookup given a pair of vertex IDs.