export JuMP models from maximum flow and minimum cost flow problems

Author: jbytecode

CHANGELOG.md

@@ -3,6 +3,8 @@
 - Optimize allocations in Minimal Spanning Tree.
 - Export JuMP model from assigment problems.
 - Export JuMP model from zero-sum games.
+- Export JuMP model from Maximum Flow problems.
+- Export JuMP model from Minimum Cost Flow problems.
 
 
 

src/maximumflow.jl

@@ -39,11 +39,13 @@ A structure to hold the result of the maximum flow problem.
 
 - `path::Vector{Connection}`: The connections (edges) in the flow path.
 - `flow::Float64`: The total flow through the network.
+- `model::JuMP.Model`: The JuMP model used to solve the problem.
 
 """
 struct MaximumFlowResult
     path::Vector{Connection}
     flow::Float64
+    model::JuMP.Model
 end
 
 
@@ -161,7 +163,7 @@ function solve(problem::MaximumFlowProblem)::MaximumFlowResult
         end
     end
 
-    return MaximumFlowResult(solutionnodes, cost)
+    return MaximumFlowResult(solutionnodes, cost, model)
 end
 
 

src/minimumcostflow.jl

@@ -41,11 +41,13 @@ A structure to hold the result of the minimum cost flow problem.
 
 - `path::Vector{Connection}`: The connections (edges) in the flow path.
 - `cost::Float64`: The total cost of the flow.
+- `model::JuMP.Model`: The JuMP model used to solve the problem.
 
 """
 struct MinimumCostFlowResult
     path::Vector{Connection}
     cost::Float64
+    model::JuMP.Model
 end
 
 
@@ -117,7 +119,7 @@ function solve(problem::MinimumCostFlowProblem, flow::Float64)::MinimumCostFlowR
         end
     end
 
-    return MinimumCostFlowResult(solutionnodes, cost)
+    return MinimumCostFlowResult(solutionnodes, cost, model)
 end