Prototype: implement prototype(int n, List<Link> edges, int source) returning List<Long> with a direct baseline.
Final: implement solve(int n, List<Link> edges, int source) with the mechanism and bounds described above. Vertices are 0..n-1. Return hop distances as Long values in vertex order, with source zero and unreachable null. Self-loops and parallel undirected edges are valid. Reject n <= 0, invalid source, or invalid endpoint. 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.