In this method, the nodes on the testing path are set in an array and the Max-flow algorithm is used to find the testing path. This paper describes the principle and flow of the Max-Flow algorithm in detail.
该方法利用数组来表示测试路径节点,结合最大流算法来寻找测试路径。
参考来源 - Virtex系列FPGA内部互连线测试·2,447,543篇论文数据，部分数据来源于NoteExpress
Constructing a simple network and converting the allocation problem into the min-cost max-flow in the network, we have developed an optimal algorithm for the allocation problem.
我们构造了一个简单网络，将布点问题转化为该网络中的最小费用最大流问题，从而给出了求解布点问题的最优性算法。
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.
首先对给定的数据流图进行单电压高层次综合，然后对单电压综合结果迭代地进行多电压调整；提取每次迭代时需要调整的网络流子图，对该子图运行最小费用最大流增量算法。
应用推荐