title: Finding the path with the maximum minimal weight
body: <p>I'm trying to work out an algorithm for finding a path across a directed graph. It's not a conventional path and I can't find any references to anything like this being done already.</p>
  
  <p>I want to find the path which has the maximum minimum weight.</p>
  
  <p>I.e. If there are two paths with weights 10->1->10 and 2->2->2 then the second path is considered better than the first because the minimum weight (2) is greater than the minimum weight of the first (1).</p>
  
  <p>If anyone can work out a way to do this, or just point me in the direction of some reference material it would be incredibly useful :)</p>
  
  <p>EDIT:: It seems I forgot to mention that I'm trying to get from a specific vertex to another specific vertex. Quite important point there :/</p>
  
  <p>EDIT2:: As someone below pointed out, I should highlight that edge weights are non negative.</p>