And it turns out, history created a Eulerian path of its own.

事实证明，历史创造了自己的欧拉路径。

A Eulerian path that visits each edge only once is only possible in one of two scenarios.

只访问每条边一次的欧拉路径只可能出现在两种情况之一中。

We just need to figure out how to travel what mathematicians call an Eulerian path, which traces every edge exactly once.

我们只需要弄清楚如何走数学家所说的欧拉路径，它恰好跟踪每条边一次。

Then, the Eulerian path will start and stop in the same location, which also makes it something called a Eulerian circuit.

然后， 欧拉路径将在同一位置开始和停止，这也使它成为欧拉回路。

Interestingly enough, any connected network that has exactly 2 nodes with an odd number of edges will also contain an Eulerian path.

有趣的是，任何恰好有 2 个节点且边数为奇数的连通网络也将包含欧拉路径。