图论中，已知费用矩阵和容量矩阵的情况下，求最小费用最大流问题-In graph theory, the problem of minimum cost maximum flow is obtained in the case of known cost matrix and capacity matrix.