Backtrack after transitive version conflicts

Review the independently proposed patch below, including its unchanged callers. A greedy first choice makes a satisfiable multi-root dependency graph appear unsatisfiable. Search remaining versions after a branch conflict, carrying all root and transitive requirements and preserving deterministic version preference.

Review focus: Repository Implementation

src/services/Solver.java

BeforeProposed

+0−1

2727 Map<String,Candidate> next=new TreeMap<>(chosen);

2828 next.put(missing,candidate);

2929 search(next);

30 break;

3130 }

3231 }

3332 public Map<String,Candidate> solve() {

Your review

0 / 10,000 characters · A verdict needs supporting evidence.

30 more characters to give a verdict