Graphs II: Basic Algorithms :

• In the above figure there are two least weighted edges. We can choose any one of them. Lets choose edge (v₄,v₅).
• Next least weighted edge is between (v₃,v₆), add this edge to MST edges, since it is not creating any cycle.
• Next edge is (v₇,v₉). Repeat the processes of adding edges till we found n-1 edges without forming any    cycle. The number of vertices's in the graph is n.
• This is method is Kurskal's algorithm, named after the inventor.
• The following sequence of figures shows a way of adding edges to obtain a MST.