The Algorithm Visualization Catalog is a comprehensive collection of links to algorithm visualizations, or AVs.

ALVIE - Dijkstra and Bellman-Ford Sortest Paths Algorithms

Link(s)
http://alvie.algoritmica.org/
Topic(s)
Single-source shortest path problem, Graph Algorithms

Videos


Recommendation
  
Lecture Aide Unrated
Self-study Supplement Unrated
Standalone Unrated
Debugging Aide Not Recommended
Works?
Yes
Delivery Method(s)
Java Application
Project
AlViE
Project Relationship
Part of project
Language(s)
English
Author(s)
Pilu Crescenzi
Institution(s)
University of Florence
Activity Level(s)
Canned data, Step control
Source Code License
Available on request
First Published
N/A
Last Modified
N/A

Description

Walkthroughs on an example graph for Dijkstra's and Bellman-Ford's algorithms to solve the single-source shortest paths problem. Unlike the better-known Dijkstra's algorithm, the Bellman-Ford algorithm will work even with edges of negative weight.

Evaluation

Simple-to-use user interface for walking through the example, since a good example is already provided with the algorithm. Simply open up the AV (see directions below) and step through the example with pseudo-code. As you go through the example, you are directed to the corresponding line in the pseudocode and given a line or two of explanation in the message window. Attractive layout of the data, including colors indicating the current nodes being processed.

Usage Notes

The link above will take you to the ALVIE website. That page should lead you to a download link. Download and unzip the ALVIE system. Double click on the .jar file. Within the ALVIE pane (not the GRIND pane), click on the "eye" icon (third icon from the left in the toolbar) to get a list of algorithms from which select the AV that you want. Once selected, click OK and step through the AV with the arrow icons.

Field Report(s)
References
N/A
Rating
0
No votes yet
Your rating: None
AV of the Day
No
Score
24