Here Appsrex giving you the Algorithm used in finding Minimum spanning tree called as Prim’s Algorithm.
Minimum Spanning Tree is the Tree Structure transformed from a weighted graph, but in this, the Sum of Weights on their edges connecting two vertices, should be minimum.
Prim’s Algorithm is one of the best algorithm for finding Minimum Spanning Tree.
It uses Greedy Approach/Method/Strategy for Transforming Given Graph into Minimum Spanning Tree.
Minimum Spanning Tree is the Tree Structure transformed from a weighted graph, but in this, the Sum of Weights on their edges connecting two vertices, should be minimum.
Prim’s Algorithm is one of the best algorithm for finding Minimum Spanning Tree.
It uses Greedy Approach/Method/Strategy for Transforming Given Graph into Minimum Spanning Tree.
MST PRIM’S(G,w,r)
For each u É› G.V
UNIX is the Operating System and Operating System is
the Program used for interaction of user (uses computer for his/her work) and
hardware (physical parts of the computer system).
In UNIX OS Architecture there are set of
layers as often does in all operating system architecture: 
Similarities in Database and Data warehouse:

So is that ‘Data warehouse' really different from the tables in your application?