For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex, look easy in example above, they are only 6 vertex(node),but just thinking when coin spread to world they will be a big number of nodes,
and it could take more time to cpu found the shortest path more than use traditional algorithm, besides just giving another simple example
if we have 5 nodes A,B,D,F,C(pls consider B y C being more shortest between both)  if A want send coins to C but first going to B(according to Dijkstra algorithm and B could be a node hacker or so) then is better send A to D,after to F and every node until to arrive c(longest path), in this case always the shortest path could dont be through reliable node so what do you think?