G is a maximal acyclic graph.

是一个极大无圈图。

The graph must be acyclic to avoid program scheduling deadlocks.

这个图必须是无环的，以避免造成调度上的死锁。

Algorithm to find a hierarchy tree in a directed acyclic graph?

算法来找到一个层次树在一个有向无环图吗？

The model describing system is restricted to be acyclic at a cost.

作为代价，描写系统的模型限制是无环的。

Is it practical to store unique paths through a directed acyclic graph?

这是存储唯一的路径通过一个有向无环图的现实？