After reading Dijkstra and Bellman-ford I have one doubt that why Dijkstra give the answer in one iteration while bellman ford take n-1 iteration ?
Since i have new id i can not comment . Here is something to read which might help you.
While doing on paper you might be assuming the best order for bellman-ford that why you got the confusion.
Remember that the algorithm bellman ford works no matter in which order the edges are processed .Now try to rethink different order you will see that in worst case it will be n-1.
In fact this is the reason why you have to do n-1 iterations. If you would know, what is the best order of edges - only one iteration would be enough.
Here is a link which might help you https://stackoverflow.com/a/41772030/13265840
Hope this might help you !!!