A network topology connects n servers labeled 1 to n. Each connection is a bidirectional link with a bandwidth cost. A network engineer needs to route traffic from server 1 to server n.

The path may use at most k network hops (edges). The path's bottleneck is defined as the maximum edge cost along the path. Find the minimum possible bottleneck over all valid paths from server 1 to server n that use at most k hops. If no such path exists, return -1. ...