When we draw social networks, we make nodes and edges. Each node is represented by the circle which is our
subject, and each edge is represented by a line which tells us the relationship between the nodes. Each edge in a
network is indicated by listing the pair of nodes it connects. Or to put it simply, when two nodes show some
relationship between them, an edge is formed. When we make that list for all the edges in the network, we obtain an
adjacency list. An alternative to adjacency list, is adjacency matrix.
In an adjacency matrix, we list out all the subjects in both the rows and the columns. Then values are filled into each
cell to indicate if there is an edge between them or not. Typically, a 0 indicates no edge and a non - zero value
indicates the presence of an edge. It is also called the connection matrix sometimes.
3 of 9