export JuMP model from Shortest Path problems

Author: jbytecode

src/pmedian.jl

@@ -15,6 +15,7 @@ using JuMP, HiGHS
 - `objective::Float64`: Objective value.
 - `z::Matrix`: Binary matrix of assignments. If z[i, j] = 1 then ith point is connected to the jth point.
 - `y::Vector`: Binary vector. If y[i] is 1 then ith point is a depot.
+
 """
 struct PMedianResult
     centers::Vector

src/shortestpath.jl

@@ -39,11 +39,13 @@ A structure to hold the result of the shortest path problem.
 
 - `path::Vector{Connection}`: The connections (edges) in the shortest path.
 - `cost::Float64`: The total cost of the shortest path.
+- `model::JuMP.Model`: The JuMP model used to solve the problem.
 
 """
 struct ShortestPathResult
     path::Vector{Connection}
     cost::Float64
+    model::JuMP.Model
 end
 
 
@@ -182,7 +184,7 @@ function solve(problem::ShortestPathProblem)
         end
     end
 
-    return ShortestPathResult(solutionnodes, cost)
+    return ShortestPathResult(solutionnodes, cost, model)
 end