Swim in Rising Water

Minimax path problem: minimize the maximum edge weight on a path. Dijkstra with cost = max(path_cost_so_far, cell_value) solves it in O(n² log n). The key insight is that unlike standard Dijkstra (sum of weights), here cost = max, which is still monotonically non-decreasing, so Dijkstra's greedy property holds.