Page "Dynamic programming" Paragraph 4

Figure 1.

Finding the shortest path in a graph using optimal substructure ; a straight line indicates a single edge ; a wavy line indicates a shortest path between the two vertices it connects ( other nodes on these paths are not shown ); the bold line is the overall shortest path from start to goal.