Shortest distance observes optimal substructure and therefore every shortest distance problem can be solved with dynamic programming. However, as you can see or already has learned that Dijkstra's algorithm is one of greedy algorithm. What makes greedy algorithm to work in this instance?