▲

Visualisation concatenation process

Process notation Rain

name:rain.
droplet formation [1,2] = rising water vapour [1] ► coalescence [2];constraint:"true",
formation of nimbostratus [2,3] = coalescence [2] ► nimbostratus cloud [3];constraint:"false",
raining out nimbostratus [3,4] = nimbostratus cloud [3] ► rain on the ground plants and structures [4];constraint:"true".
precipitation convergence [4,5] = rain on the ground plants and structures [4] ► rainwater collection, wadis, canals, sewers [5];constraint:"true",
label:nimbostratus rain, time window: week, time unit: minute, measurement frequency: continuous (Edugraph).

Adjacency matrix Rain

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. The diagonal elements of the matrix are all 0, since edges from a vertex to itself, loops, are not allowed in simple graphs. The adjacency matrix of rain is just a diogenal.

0 1 0 0 0 rising water vapour [1]
0 0 1 0 0 coalescence [2]
0 0 0 1 0 nimbostratus cloud [3]
0 0 0 0 1 rain on the ground plants and structures [4]
0 0 0 0 0 rainwater collection wadis canals sewers [5]

Educative directed graph Rain