英语语法分析

The algorithm is also suitable to an Eulerian digraph.

此文所给出的算法同样适用于有向欧拉图。

A graph G is supereulerian if G has a spanning eulerian subgraph.

若图G含有生成欧拉子图，则称G是超欧拉的。

Eulerian and Lagrangian methods are used to deal with gas-field and discrete particles respectively.

欧拉方法与拉格朗日方法分别用来处理气相场与离散的颗粒场。