3620. Network Recovery Pathways

Given a directed acyclic graph of n nodes (0…n−1). Edges edges[i] = [u, v, cost] are one-way u→v with recovery cost cost. The online array marks which nodes are in the network; nodes 0 and n−1 are…