It's not easy to explain those details in plain English, you need to use visuals, But the basics are, For dijkstra, Given a graph of nodes and weighted edges, and a Starting node. The "dijkstra shortest path" algorithm finds all shortest paths from the starting node to all other nodes. Here is an online applet that will help you understand how it works, You can draw your own graph with it:
Dijkstra:
www.dgp.toronto.edu/people/JamesStewart/.../DijkstraApplet.html
Bellman–Ford algorithm also computes the shortest paths in a weighted graph but with the advantage that some of the edge weights can be
negative). Dijkstra's algorithm solves the same problem with a lower running time, but requires edge weights to be
non-negative. So, Bellman–Ford is often used only when there are negative edge weights. Here is an applet for it:
Bellman–Ford (choose it from the list):
links.math.rpi.edu/applets/appindex/graphtheory.html
