论文标题
找到自己的方式：网络上的最短路径
Finding Your Way: Shortest Paths on Networks
论文作者
论文摘要
前往不同目的地是我们生活的重要组成部分。在日常生活和度假时，我们都会参观各种地点。我们如何找到从一个地方到另一个地方导航的最佳方法？也许我们可以测试两个地方之间旅行的所有不同方式，但另一种方法是使用数学和计算来找到最短的路径。我们讨论了如何构建最短路径并引入Dijkstra的算法，以最大程度地减少一条路径的总成本，在该路径的总成本可能是旅行距离，旅行时间或其他一些测量值。我们还讨论了如何在现实世界中使用最短路径来节省时间并提高旅行效率。
Traveling to different destinations is a big part of our lives. We visit a variety of locations both during our daily lives and when we're on vacation. How can we find the best way to navigate from one place to another? Perhaps we can test all of the different ways of traveling between two places, but another method is to use mathematics and computation to find a shortest path. 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, travel time, or some other measurement. We also discuss how to use shortest paths in the real world to save time and increase traveling efficiency.
