Prototype: implement prototype(int n, List<Edge> edges) returning List<List<Long>> with a direct baseline.
Final: implement solve(int n, List<Edge> edges) with the mechanism and bounds described above. Return an n-by-n Long distance matrix with null for unreachable pairs. Directed edges may be negative. n=0 returns empty. Reject negative n, invalid endpoints, or any negative cycle. Prototype may run Bellman–Ford from each source. Both stages have the same observable contract. The prototype may use the simpler method; final must use the target data structure.
The supplied nested record types define the API. All methods are static members of Exercise.
Complete the starter code, then run the checks.
Results and errors will appear here.
Java runs on this device with CheerpJ 4.3.