Leetcode 3112. Minimum Time to Visit Disappearing Nodes

Find the minimum travel time from node 0 to every node in a weighted undirected graph under the constraint that each node must be reached strictly before its given disappear time (otherwise it's unreachable); return -1 for nodes that can't be visited. This is essentially a shortest-path problem with per-node time-window availability.