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.

于是， 欧拉路径将从同地点开始并结束，也其成为所谓的欧拉回路。

During World War II, the Soviet Air Force destroyed two of the city's bridges, making a Eulerian path easily possible.

在第二次世界大战期间， 苏联空军摧毁了该市的两座桥梁，次轻松实现欧拉路径成为可能。

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.

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