File:Bellman-Ford worst-case example.svg
From Infogalactic: the planetary knowledge core
Size of this PNG preview of this SVG file: 534 × 572 pixels. Other resolution: 224 × 240 pixels.
Original file (SVG file, nominally 534 × 572 pixels, file size: 93 KB)
Summary
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.
Licensing
Lua error in package.lua at line 80: module 'strict' not found.
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 06:15, 13 January 2017 | | 534 × 572 (93 KB) | 127.0.0.1 (talk) | 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. |
- You cannot overwrite this file.
File usage
The following page links to this file:
