title: Why Do |V|-1 Iterations In The Bellman Ford Algorithm Guarantee a Shortest Path?
body: <p>Let V be the set of vertices in a graph. I understand that given a graph of |V| vertices with no negative cycles, a shortest path will always have |V|-1 edges. I still don't quite understand why checking every edge |V|-1 times guarantees that Bellman Ford's algorithm will produce the shortest path. Can someone help me understand this better?</p>