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.

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

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

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

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

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

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

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

Here, a solution is proposed for the Eulerian approach, which means that we do not compute these quantities everywhere in the continuum of space, but we use a fine 3D grid, and we compute these quantities only in these gridpoints.

这里提出了个基于欧拉方法的方案，这意味着我们不去计算这些遍布连续空间里的量，而是使用个精细的三维网格，我们仅在这些网格点中计算这些量。