and the location of the first edge in the sequence of edges. The fifth element is be used to store a temporary replacement label. Initially, and between algorithm steps, this label is set to $-1$.

When a first drop of water reaches an inactive vertex $V$, we say that the vertex is [*triggered*]{}, and that state exists only temporarily during an algorithm cycle. In the end of the algorithm cycle some triggered vertices become active. However it could happen that a triggered vertex does not get a water flow of higher quality than the one already present at the vertex. The particular triggered vertex with this property does not get activated.

### Edges

Each edge $e$ takes $8$ integers in the sequence of edges. Although the graph is undirected, each edge is stored twice in the memory. The $8$ integers are the start point, the end point, remaining time for water to travel over the edge (if the edge is active), the weight of the travel $f_2(e)$, the initial passage time $f_1(e)$, the label of the vertex that is the source of the current flow through the edge (if there is a flow), status, and the location of the same 