File:Bellman-Ford worst-case example.svg

From Wikimedia Commons, the free media repository
Jump to navigation Jump to search

Original file(SVG file, nominally 534 × 572 pixels, file size: 93 KB)

Captions

Captions

Add a one-line explanation of what this file represents

Summary[edit]

Description
English: 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.
Date
Source Own work
Author User:Dcoetzee

Licensing[edit]

I, the copyright holder of this work, hereby publish it under the following license:
Creative Commons CC-Zero This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication.
The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current11:00, 17 December 2012Thumbnail for version as of 11:00, 17 December 2012534 × 572 (93 KB)Dcoetzee (talk | contribs){{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...

The following page uses this file:

File usage on other wikis

The following other wikis use this file:

Metadata