title: How to update MST from the old MST if one edge is deleted
body: <p>I am studying algorithms, and I have seen an exercise like this</p>
  
  <p>I can overcome this problem with exponential time but. I don't know how to prove this linear time O(E+V)</p>
  
  <p>I will appreciate any help.</p>