模型的几何、尺寸、外观、位置以及相互关系组成一个无回路有向图(Directed Acyclic Graph)， 那些数据的功能性通过字段参数的形式包含在节点中，字段参数可以包含简答数据类型的数值或 者是其他的节点。
基于40个网页-相关网页
在算法设计与实现中采用一个链接结构的“优先序列”，用它保证有向无回路图顶点的分层拓扑排序。
A "priority queue" which has a linked structure is used in this algorithm, which insures to complete LTP with the vertices in directed acyclic graph.
接着把这一特殊的指派问题用有向无回路图表示出来，从而使指派问题的求解转化为求解有向无回路图的划分问题。
Then the assignment problem is illustrated with the directed acyclic graphs. The assignment problem becomes the partition problem of directed acyclic graphs.
描述了有向无回路图的构造性定义，指出问题一定有不超过所有任务执行时间总和的解。
A constructible definition of the directed acyclic graph was described, and the reason why exists a solution that does not exceed the total execution time of all tasks was explained.
应用推荐