Consider a Directed Acyclic Graph in which every node has a value and a cost and edges do not have any weight. I need to find a path containing nodes such that sum of values of these nodes is maximized, but sum of cost over all these nodes must be at most C.
I am thinking of some modification of Dijkstra's algorithm. Any ideas? Is there any standard algorithm for this?