Minimax Grid Paths and Network Delay

These two graph problems use different path costs. The first minimizes the maximum height visited; the second minimizes the sum of edge delays before taking the maximum over destinations.

Part 1: Minimax Grid Path

Problem Statement

Given a...