Find a path within a specific cost
问题 There are many algorithms or policies for finding a path with minimum or maximum costs. But, it is hard to find an approach that can find a path within (or below) a required cost (RC), i.e., such an RC is not a minimum or maximum one, and the actual cost should less than such an RC. I am looking for a feasible algorithm to find a path satisfying the two constraints: The cost of such a path should be lower than the required cost. The path from source to destination should contain as many hops