title: Check if edge is included in SOME MST in linear time (non-distinct values)
body: <p>I am working on an algorithm to check if a given edge is included in one of all possible mst's.</p>
  
  <p>For this question, we are considering non-distinct values and our edge e connects vertices A &amp; B.</p>
  
  <p>So far, I have: If a path can be made from A to B consisting of edges with weights less than or equal to the weight of our edge e--we can say that edge e is not a part of any MST.</p>
  
  <p>Am I missing anything here/ ideas on a better algorithm?</p>
  
  <p>EDIT:</p>
  
  <p>What are thoughts on a solution involving the cycle property-- So, we consider all edges with weight less than the edge we are considering. If we can make a path from A->B with those edges, we can say that it is not part of any MST?</p>