title: Path finding algorithm on graph considering both nodes and edges
body: <p>I have an undirected graph. For now, assume that the graph is complete. Each node has a certain value associated with it. All edges have a positive weight.
  I want to find a path between any 2 given nodes such that the sum of the values associated with the path nodes is maximum while at the same time the path length is within a given threshold value.
  The solution should be "global", meaning that the path obtained should be optimal among all possible paths. I tried a linear programming approach but am not able to formulate it correctly.
  Any suggestions or a different method of solving would be of great help.</p>
  
  <p>Thanks! </p>