A Dual Graph Algorithm Model and Its Implementation of the Maximun Flow on the Large-scale Networks

In the study of the maximum flow algorithm,improved methods are proposed for reducing the calculation volume.Based on the theorem of max-flow min-cut,using the maximum flow algorithm through the shortest path of the dual graph of network flow graph,the Dijkstra algorithm is improved and an optimized Dijkstra algorithm model is proposed.The shortest path nodes are selected by utilizing the small root heap of heap sort in the improved algorithm.The nodes of heap are processed by using set computation.In this way,the nodes taking part in operations have been reduced,the efficiency of algorithm is increased.