Johnson's algorithm

Given below is a directed weighted graph:

For each node $v$, amid all shortest paths starting from $v$ to all other nodes, find the one with the lowest weight, say $d_v$. The output should contain the corresponding weights in the following order: $d_1, d_2, d_3, d_4, d_5$.

Answer format example: 11 -7 4 16 -3