determine the value $F_2\left(\hat \pi\right)$. Namely, $F_2 \left(\hat \pi\right)=M-L(\hat B)$. The [*used*]{} edge $f$ (or one of the used edges, if there are more than one) that is adjacent to $\hat B$ can help us in finding the second to last point of the path $\hat \pi$. Namely, if $F$ is the other endpoint of $f$ we first check whether $F\in\mathcal C$. If this is not the case, then $F$ is the second to last element of the path $\hat \pi$. If $F\in\mathcal C$ then the vertex $F$ is a copy of some other vertex in the graph and we have the pointer to the origin of this copy. This origin is the second to last point on the path $\hat\pi$.

2.  There is no [*active*]{} edge in the graph. In this case there is no path that satisfies the constraint $F_2\leq M$.

Sequences accessible to all processing elements
-----------------------------------------------

It is convenient to store the vertices and edges in sequences accessible to all processing elements. We will assume here that the degree of each vertex is bounded above by $d$.

### Vertices

Each vertex takes $5$ integers in the sequence of vertices. The first four are name, label, status, 