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.

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

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

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

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

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

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

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

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

事实证明，历史本身也创造了一条欧拉路径。