title: What is Dijkstra's Minimum Spanning Tree?
body: <p>I'm having trouble finding an example algorithm for Dijkstra's Minimum Spanning tree. I already know about Dijkstra's Single Shortest Path algorithm, but not the spanning tree. I have the simple explanation from class which is this:</p>
  
  <blockquote>
    <p>For each edge, add it to the tree. If a cycle is detected, remove the heaviest edge.</p>
  </blockquote>
  
  <p>I've scoured the Internet and I couldn't find an algorithm for it. </p>
  
  <p>I might need to just code it for myself, but I thought I would ask if anyone has a good example.</p>
  
  <p>Can anyone help?</p>