title: Is Minimum Spanning Tree afraid of negative weights?
body: <p>This is a follow-up question of <a href="https://stackoverflow.com/questions/10381474/graph-why-most-graph-algorithms-do-not-adapt-so-easily-to-negative-numbers">Why most graph algorithms do not adapt so easily to negative numbers?</a>.</p>
  
  <p>I think Shortest Path (SP) has problem with negative weights, because it adds up all weights along the paths and tries to find the minimum one.</p>
  
  <p>But I don't think Minimum Spanning Tree (MST) has problems with negative weights, because it just takes the single minimum weight edge without caring about the overall total weights.</p>
  
  <p>Am I right?</p>