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 it tries to find the shortest way, subject to those constraints, to get from Point A to Point B. And there are many, many other instances of this kind of thing.

然后谷歌地图开始寻找，满足这些条件的从A地到B地最短路径,还有很多这样的例子，明天我们会再复习一遍这些内容。

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

If it isn't, then I'm going to go back around the loop, and notice what happens. If I get all the way around the loop, that is, all the way through that FOR loop and I never find a path that takes me through here, then the last thing I'm going to do is return a pair or a tuple with a special simple number none twice.

如果没有,我会回到循环看看发生了什么,如果我运行了整个循环,也就是整个for循环,我仍没有找到符合条件的路径,那么我最后做的事情就是返回一对,或者一个数组的两次none值。

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