最后求得各有向无环网络的组播容量，找出具有最大组播容量的无环组播网络进行线性网络编码构造。
Finally, it achieves the throughput of each network, we can find out the directed acyclic network which has the maximum throughput and construct the linear network coding for it.
描述了有向无回路图的构造性定义，指出问题一定有不超过所有任务执行时间总和的解。
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.
描述了有向无回路图的构造性定义，指出问题一定有不超过所有任务执行时间总和的解。
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.
应用推荐