MAKE A MEME
View Large Image
| View Original: | Bellman-Ford worst-case example.svg (534x572) | |||
| Download: | Original | Medium | Small | Thumb |
| Courtesy of: | commons.wikimedia.org | More Like This | ||
| Keywords: Bellman-Ford worst-case example.svg en A worst-case example graph for Bellman-Ford algorithm a simple path with 5 vertices Assuming that the source is A and the edges are processed from right to left it will take V - 1 or 4 iterations for the minimum distances labelled below each node to fully converge Conversely if the edges are processed from left to right it will converge in a single iteration and the diagram can be interpreted to mean how the estimates change after examining each edge own User Dcoetzee 2012-12-17 Shortest paths algorithms 5x5 arrays Linear graph 5 Directed graphs Graphs with 5 vertices Cc-zero | ||||
