title: Use Dijkstra's to find a Minimum Spanning Tree?
body: <p><a href="http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" rel="noreferrer">Dijkstra's</a> is typically used to find the shortest distance between two nodes in a graph. Can it be used to find a minimum <a href="http://en.wikipedia.org/wiki/Minimum_spanning_tree" rel="noreferrer">spanning tree</a>? If so, how?</p>
  
  <p>Edit: This isn't homework, but I am trying to understand a question on an old practice exam.</p>