Network Recovery Pathways
In a directed acyclic graph with some offline nodes, look at every route from the first node to the last that avoids offline nodes and costs at most k in total. Report the largest possible value of the cheapest edge on such a route, or -1 when no route qualifies.