ProjectLinks - Bellman/Ford Algorithm
Recommendation |
Not Recommended |
||||
Link |
http://links.math.rpi.edu/devmodules/graph_networking/compat/page17.html |
||||
Delivery Method |
Java Applet |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
|
||||
Institution |
Rensselaer Polytechnic Institute |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Bellman-Ford algorithm to solve the single-source shortest paths problem. Unlike the better-known Dijkstra's algorithm, this will work even with edges of negative weight. |
||||
Evaluation |
An animation on a pre-determined graph. Very limited. You can't even control the pacing of the animation. |
||||
|
|||||
Lecture Aid |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2009-04-23 |
||||
Last Visited |
2009-04-23 |
||||
Last Updated |
1998 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
