In value iteration algorithm we update the utility of all possible states ("for each state update its new utility").
After we've updated all states we check to see if the delta is smaller than some value. If not we loop again over all sates.
If we have 2 adjacent sates say A, B - after updating A we can move on to updating since they are adjacent. Is it possible to go back to update A again since its value will be different again (since B just changed) ? or is the order should be to go over all states exactly once per the inner loop and go back to a state already visited only when we implement the inner loop again ?