How to implement Bellman-Ford in such a way that it takes only one iteration to find the shortest paths?
a) Decrease relaxation steps
b) Increase the number of vertices
c) Use a different algorithm
d) It is not possible