Yes, by making sure the graph is having only two vertices and a single edge. In this case you need not to make any modifications to bellman ford algorithm and it will always gives the shortest distance in a single iteration.