Collection: | AlgoViz |
Source: | http://algoviz.org/node/502 |
Format: | Java Application |
Recommendation: Unrated. 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. |
Creator: | Pilu Crescenzi |
Publisher: | University of Florence |
Subject: | Graph Algorithms Single-source shortest path problem |
Language: | english |
Relation: | AlViE |
Rights: | Available on request |
Theory of computation Mathematics of computing Design and analysis of algorithms Discrete mathematics Graph algorithms analysis Graph theory Shortest paths Graph algorithms
Submitted by EnsembleAdmin on Mon, 10/18/2010 - 02:26