For a simple graph with vertex set U = {u1, ..., un}, the adjacency matrix is a square n × n matrix A such that its element Aij is 1 when there is an edge from vertex ui to vertex uj, and 0 when there is no edge.[1] The diagonal elements of the matrix are all 0, since edges from a vertex to itself, loops, are not allowed in simple graphs.
0 1 0 0 0 0 above-ground freshwater collection [1] 0 0 1 1 0 0 groundwater vadose zone [2] 0 0 0 1 0 0 partially permeable layer [3] 0 0 0 0 1 0 permeable layer [4] 0 0 0 0 0 1 groundwater flow [5] 0 0 0 0 0 0 upper course rivers [6]
From this matrix, you can see horizontally how many paths branch off from a node. For the ‘groundwater-saturated zone’, there are two. There is therefore divergence. Vertically, you can see that two also arrive at the ‘permeable layer’. There is therefore divergence there as well.