Similar to text analysis, graphs can be represented by a very large matrix encoding the relationships between nodes. We have already used such a matrix in the preceding chapters – the adjacency matrix, named M in the following diagram:
Other algorithms rely on the graph Laplacian matrix L = D - M where D is the diagonal matrix containing the degree of each node. But the principles remain unchanged.