File:Bellman-Ford worst-case example.svg
Appearance
Size of this PNG preview of this SVG file: 534 × 572 pixels. Other resolutions: 224 × 240 pixels | 448 × 480 pixels | 717 × 768 pixels | 956 × 1,024 pixels | 1,912 × 2,048 pixels.
Original file (SVG file, nominally 534 × 572 pixels, file size: 93 KB)
File history
Click on a date/time to view the file as it appeared at that time.
Date/Time | Thumbnail | Dimensions | User | Comment | |
---|---|---|---|---|---|
current | 11:00, 17 December 2012 | 534 × 572 (93 KB) | Dcoetzee | {{Information |Description ={{en|1=A worst-case example graph for Bellman-Ford algorithm, a simple path with 5 vertices. Assuming that the edges are processed from right to left, it will take |V| - 1 or 4 iterations for the minimum distances (labell... |
File usage
The following page uses this file:
Global file usage
The following other wikis use this file:
- Usage on bg.wikipedia.org
- Usage on hu.wikipedia.org
- Usage on it.wikipedia.org
- Usage on sr.wikipedia.org
- Usage on zh.wikipedia.org