After studying conditions for generating PODCM in the critical path of data flow graph (DFG), an algorithm was introduced to produce PODCM.
通过分析在数据流图(DFG)关键路径上生成PODCM的条件，给出了在DF G关键路径上生成PODCM的算法并建立了PODCM库。
The result is that the delay-Jitter-SPF algorithm and the flow graph of the building of the multicast tree with QoS constraints are proposed.
结果是提出了基于延迟和延迟抖动约束的SPF算法，并给出了完整的建立组播树的流程图。
The algorithm is based on the principle of flow graph theory and set theory.
该算法基于流图理论的基本原理和简单的集合运算，概念明确，易于掌握；
The characteristics of dynamic liquid composition graph are analyzed. The main algorithm flow descriptions and implementation examples are shown, and main features of this algorithm are summarized.
分析了动态液体构图的特点，给出了主要的算法流程描述和算法实现的实例，总结了算法的主要特点。
The network flow sub-graph needed to adjust is extracted from the previous network flow graph and the min-cost max-flow augmentation algorithm is run on it.
首先对给定的数据流图进行单电压高层次综合，然后对单电压综合结果迭代地进行多电压调整；提取每次迭代时需要调整的网络流子图，对该子图运行最小费用最大流增量算法。
The network flow sub-graph needed to adjust is extracted from the previous network flow graph and the min-cost max-flow augmentation algorithm is run on it.
首先对给定的数据流图进行单电压高层次综合，然后对单电压综合结果迭代地进行多电压调整；提取每次迭代时需要调整的网络流子图，对该子图运行最小费用最大流增量算法。
应用推荐