Seonglae ChoMST
Connecting all vertices with the minimum cost
Prim’s algorithm
Initialization need and each vertex, we need to choose next
So Fibonacci heap is best for this algorithm for worst case
but as an Amortized analysis averages the running times of
operations in a sequence over that sequence.