title: Not sure about algorithm in graph
body: <p>I have this question :</p>
  
  <p>Given directed and connectivity graph G=(V,E) with positive weights define E(t) to be the group of edges whose weight is at most t. 
  Find an algorithm that calculates the minimal t that for him G(t) = (V,E(t)) is connectivity.</p>
  
  <p>I thought about finding the Max-flow min-cut of the graph but I am not sure the is the right direction to the solution. </p>