In a directed, weighted graph with non-negative weights we are asked to find a path from a starting node s to node t that weights $\leq W$. In our given graph there is no such path but we have the ability to skip as many edges as we like.
How can I create an algorithm that calculates the number of minimum skips needed to find a path from s to t with weight $\leq W$?
Thoughts: In general we can use Dijkstra's algorithm to find a shortest in the given graph.
If the number of skips available in the graph was given the solution would be solution