good for dense graphs; connectivity between two vertices can be tested quickly.
a matrix which records the number of direct links between vertices
- square matrix of vertices where the elements of the matrix describe the edges - vertices will be listed in sorted order - e.g. binary adjacency matrix