Before revision:  We discuss how to find a shortest path and introduce Dijkstra's algorithm to minimize the total cost of a path, where the cost may be the travel distance or travel time .
After revision:  We discuss how to construct a shortest path and introduce Dijkstra's algorithm to minimize the total cost of a path, where the cost may be the travel distance or travel time .