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 diffusion water vapor land plants [13] 0 0 0 0 0 0 rising water vapor [17] 0 1 0 0 0 0 rivers, lakes and estuaries [14] 0 1 0 0 0 0 open sea [8] 0 1 0 0 0 0 interception soil vegetation [15] 0 1 0 0 0 0 glaciers, ground ice, ice caps [16]
From the adjacency matrix of an undirected graph, one can see how many paths lead from one node to another or arrive at it. Undirected graphs are symmetric.
Here, however, we are dealing with a directed graph. From this matrix, you can see vertically how many paths lead to a node. For ‘rising water vapour’, there are five. There is therefore convergence.