**> ABOUT ME**** ****>RESUME**** ****>LINKS I LIKE**** >MAIN PAGE****>GUESTBOOK****>PROGRAMS**

( Click on the underlined heading above to see the program code . )

Here 's the Kruskal Algorithm for finding the Minimum Spanning Tree :

Kruskal-Algorithm ( Graph G ( Vertices V , Edges E ) )

{ Minimum Spanning Tree = Null initially

Sort The Edges by Weight

Assume that the Edges are Labelled Edges[1] .... Edges[n] after the Sorting

For i = 1 to n : Add Edge[i] to the Minimum Spanning Tree if it doesn't make a cycle

Display the Spanning Tree

}

**> ABOUT ME**** ****>RESUME**** ****>LINKS I LIKE**** >MAIN PAGE****>GUESTBOOK****>PROGRAMS**

Home Page of
Prashant Bhattacharji , Sophomore , IIT Kharagpur . Contains
Resume , programs in Visual Basic , C , **C++** , graphics in
2 D and 3 D .

Programs for : **Eight
Queens** / N **Queens** using backtracking /recursion ,
heuristics . Program for Knight's Tour using Warsndorff
Accessibility heuristic .