So if you think about the way something like, say, Mapquest works, and last week in recitation you looked at the fact that shortest path is exponential.

所以如果你想想电子地图，还有上周学的列举法,你就会发现一般最简单的方法,都是指数递增的。

麻省理工公开课 - 计算机科学及编程导论课程节选

End up where you started. It's not quite the same as the shortest path, and figure out the way to do that that involves spending the least money. Or the least time, or something else.

最后回到最初的地方,这和最短路径问题有些不同,需要找出一条花费最少,或者费时最少或者满足其它条件的路径。

麻省理工公开课 - 计算机科学及编程导论课程节选

And tomorrow it's recitation, we'll spend quite a bit of time on shortest path problems.

也就是说我们会在最短路径问题上,花上很多时间。

麻省理工公开课 - 计算机科学及编程导论课程节选