Minimize the Maximum Edge Weight of Graph

Given a directed weighted graph, remove edges so every node has at most threshold outgoing edges and node 0 is reachable from all nodes, minimizing the largest remaining edge weight; return that minimum maximum weight or -1 if impossible. The core challenge is selecting edges under per-node out-degree caps to preserve reachability to node 0 (usually tackled by feasibility checks over candidate weight limits).