Likewise, we might want to use a graph to represent the connections between cities, and we might be interested in finding the fastest way to travel cross-country. In this case it is again probably not appropriate for each edge to be equal to every other, for some inter-city distances will likely be much larger than others. Thus, it is natural to consider graphs whose edges are not weighted equally. Demonstration Applets None yet. Web Resources Dijkstra's Shortest Path Algorithm Animation in Java is a demonstration of Dijkstra's algorithm.
Source code is available.
Dijkstra's Graph Algorithm with Weighted Graphs is a good animated demonstration. Source Code None yet. Teaching Aids None yet.