title: How to implement Prim's algorithm with a Fibonacci heap?
body: <p>I know <a href="http://en.wikipedia.org/wiki/Prim&#39;s_algorithm" rel="noreferrer">Prim's algorithm</a> and I know its implementation but always I skip a part that I want to ask now. It was written that Prim's algorithm implementation with <a href="http://en.wikipedia.org/wiki/Fibonacci_heap" rel="noreferrer">Fibonacci heap</a> is <code>O(E + V log(V))</code> and <strong>my question is:</strong> </p>
  
  <ul>
  <li>what is a Fibonacci heap in brief?  </li>
  <li>How is it implemented? And</li>
  <li>How can you implement Prim's algorithm with a Fibonacci heap?</li>
  </ul>