Skip to main content
. Author manuscript; available in PMC: 2018 Nov 1.
Published in final edited form as: Cogn Sci. 2016 Dec 18;41(8):2234–2252. doi: 10.1111/cogs.12467

Figure 1.

Figure 1

Network depicting the shortest-path problem. Nodes represent locations (e.g, cities), and the numbers adjacent to the arrows, or directional edges, connecting the nodes represent the cost (distance) of moving from one node to another. The red line from A to E is the path (global cost of 25) taken when using one-step-ahead optimization, a strategy in which the next node that is chosen is always the least costly. The green line denotes the shortest path from A to E (global cost of 19), and can be identified through backward induction by looking beyond the next node to consider the costs of future transitions between nodes.