The most common implementation is the adjacency matrix. Each node is associated with an integer, which is the array index. We will represent the connectivity between vertices using a two-dimensional array, as array[i][j] = = = 1 if there is an edge from the node with index i to the node with index j or as array[i][j] = = = 0 otherwise, as demonstrated by the following diagram:
Graphs that are not strongly connected (sparse graphs) will be represented by a matrix with many zero entries in the adjacency matrix. This means we would waste space in the computer memory to represent edges that do not exist. For example, if we ...
