matlab

2 4 30 #3 10 46 TE 15 5 6 21 X 20 60 15 20 3 53 40 7 Finding a minimum spanning tree using Prim's algorithm Execution order: Part 1. 1.To comprehend how Prim's algorithm is working. 2.For given network variants to find minimum spanning tree using Prim's and Kruskal's algorithm. To compare results. 3. Network Variants are given in next slide Part 2. Paper work (report with conclusions !!!!!!!!!!)