MatrixMathematics I

Bellman–Ford and Dijkstra

Bellman–Ford and Dijkstra one step at a time on a graph with negative edge weights, where Dijkstra gets some distances wrong.

Figure 1.7.Choose an algorithm and press Step. Click a vertex at any time to see the shortest path to it found so far. Open on its own

Dijkstra never updates a vertex once it is finalised. That is correct only when no edge weight is negative.