Undergraduate homework question. Description from the assignment sheet:

Order the nodes 1,...,7, and order the arcs with tail node i, A(i), increasing by their head nodes. See next page for the algorithm.

The graph is at the same page. The FIFO Label-Correcting algorithm is exactly the same as Moore Bellman Ford Algorithm. Labels at the end should be: [0, -5, 15, -5, -10]