Add backtracking to max-sum, improve greedy solver

With this change, the solver is now exact, i.e. it should always find a solution if it exists, and fail only when it doesn't, producing a reasonable log trace in that case. (Optimality is still based on a heuristic, unless the solution is found by the greedy solver, which is quite improved as well anyway.)
JuliaLang · Jan 5, 2018 · 98e1e8f · 98e1e8f
1 parent 698be15
commit 98e1e8f
Show file tree

Hide file tree

Showing 7 changed files with 747 additions and 360 deletions.
diff --git a/bin/Pkg2/types.jl b/bin/Pkg2/types.jl
@@ -5,7 +5,6 @@ module Types
 export VersionInterval, VersionSet
 import Base: show, isempty, in, intersect, union!, union, ==, hash, copy, deepcopy_internal
 
-import Pkg3.equalto
 import Pkg3.iswindows
 
 struct VersionInterval