Justification

We must show that A1 and A2 are satisfied at each stage of the algorithm and that the algorithm terminates with $S$ equal to the set $R$ of all nodes reachable from $s$.