Efficient Algorithm for the Minimum Cost Flow in DAG
Fang Yuanping · Microcomputer applications · 2010
According to the Special nature of the DAG,A high-efficient algorithm to seek the shortest path in DAG is presented by the idea of breadth first search,on this basis,we Propose an algorithm for the minimum cost flow in DAG.The Complexity of the two Algorithms are respectively in time o(m) and o(mvo).Correlative analysis and instances indicate that this algorithm is superior to other current algorithms in respect of computing complexity,operation,etc.