title: An algorithm to see if there are exactly two MSTs in a graph?
body: <p>I have an undirected connected graph G. I wish to find an algorithm that return true if there are at least 2 MSTs.</p>
  
  <p>What if I want to see if there are exactly 2 MSTs?</p>