title: Find Minimum Weight of Simple Path in Tree
body: <p>I ran into a problem, we want to design an efficient algorithm for finding a simple path with lightest weight. (simple path with minimum weights).</p>
  
  <p>i think this is not polynomial solution, but some friends say may be O(n) or O(n^2) or O(n lg n) would be... !</p>
  
  <p>programmers or expert man, would help me? any pesudocode? </p>
  
  <p>EDIT:</p>
  
  <p>The input to this problem is a tree T with integer weights on the edges. The weights may be negative, zero, or positive. The length of a path is the sum of the weights of the edges in the path. A path is simple if no vertex is repeated. </p>
  
  <p>Output: finding the least weights simple path in a given tree.</p>