I would like to build, applying Dijkstra's algorithm, all paths of least weight starting from s and arriving at every other vertex of the graph:
This is my attempt.
The distance values are shown in the following table for each step of the algorithm:
The resulting shortest path from s is marked in blu in the following graph:
Is it correct?