Procedures done by the C language, using Visual Studio 2012 compiler to run. First graph format should be the adjacency matrix, the program prompts for the size of n, followed by the input node i, j, and the capacity and cost of the node. Freight capacity is 0 can not fill. And so on, until the input node is-1,-1 stop input. The minimum cost flow program output adjacency matrix and minimum cost.

最小成本流算法.c

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．