With a simple data structure, it runs in worst case of Big O of V squared, but that worst case runtime can be improved to Big O of E plus V log V by employing a Fibonacci Heap.
It does not add an edge at each step to create a subgraph. A hybrid algorithm first uses Big O of log of log of n passes in Boruvka's Algorithm before switching to it. With a simple data structure, it runs in worst case of Big O of V squared, but that worst case runtime can be improved to Big O of E plus V log V by employing a Fibonacci Heap. This greedy algorithm works by creating a heap of edge weights and at each step adding the edge with the smallest edge weight with a vertex not already in the graph to the graph. FTP, identify this alternative to Kruskal's Algorithm that finds a minimum spanning tree of a graph.
It does not add an edge at each step to create a subgraph. A hybrid algorithm first uses Big O of log of log of n passes in Boruvka's Algorithm before switching to it.
{Prim}'s-Jarnik Algorithm [or {Jarnik} Algorithm or {D}jikstra- {J}arnik-{P}rim Algorithm]