Most rewarding path in a graph

Question

I\'m faced with the following problem:

Given

• An undirected graph, where each edge E has:
  • Et - the time it takes to traverse E

Answer 1

This one reminded me this well known NP-hard problem http://en.wikipedia.org/wiki/Longest_path_problem

The problem you denoted must be NP-hard too.