Consider the following max flow problem. The tuple $(f,c)$ on each edge indicates the flow f on the edge and its capacity c $.$

You are asked to identify an augmenting path from $s$ to $d$

Label the nodes in ascending order along the augmenting path starting from $1$ on s $.$ Use as much labels as you need. Label with X nodes that are not visited by the augmenting path.

Note: You might need to build the residual network to see the augmenting path.