I'm looking for a way to, in any given connected, undirected graph, calculate a path between any two nodes with a cost as close as possible to a given value.
The example is in this image (sorry, I can't embed images yet): A simple graph
Note: the visual length of each edge doesn't exactly match the cost of the edge.
For example, say I want to find a path between A & C of cost as close as possible to 30. I don't want to find the shortest path (A->L->F->E->C) of cost 19, but the path with cost of 31 (A->B->C).
Anybody know of any efficient algorithms to do this?
I've also asked this question on StackOverflow, here.
Also, I am unsure of the tagging applicable to this question. I've attempted to make 'routing' and 'pathfinding' however they don't seem to exist.