Shortest Path Problem - Dijkstra's Algorithm


Collection:   AlgoViz
Source: http://algoviz.org/node/1184
Format: Java Applet

Recommendation: Unrated.
Description: Easy-to-follow implementation of Dijkstra's algorithm. No controls necessary; clicking the graph works through one step of the process.
Evaluation: Strengths: easy to follow; 10 developer-supplied data sets; shows edges as either used or not used. Weaknesses: no continuous operation; no user-defined data sets

Creator(s):
Publisher:   University of Tokushima
Subject: Graph Algorithms, Single-source shortest path problem
Relation: Stand-alone
Language: english


Attachments:

No votes yet
feedback