Question

draw step by step, this is C++. The first picture is the problem and the second picture is an example

Q2. (30 pts) Find the minimum spanning tree using Prim's algorithm for the following graph. For this question, the solution must be provided step by step as shown in your textbook in Figures 9.51 in page 415. 6 B F 4 2 7 A 3 1 5 D 5 N 3 G C h 1 E 9

Answer 1

It is followed greedy cherithm for finding minimum of start from Source vertex Seleet minimum nerant , next Seleet minimum weight with connections only until Jepeat *) In gjaph have n restices mst have an-Dedges Prim's Algorithm those steps coresed all the restex's, cycle is not toomed Spanning Tree * In Yes Problems have gevesties mST have sodges SIX

Prim's algoritmi - I hon with a min neamt Act Hash Table A B = 4 AC-2 B C =1 2. with A, C comotion minnepit eB=1 TG-3 A 2 EI=5 3 with connection A, C, B min hefut 1902 10م (8) 4 next min nein BOT? A

5 next min hepht DE 3 & forms cyce} AB=4 {Chole3 so select EF=5 9 B 26 6. not caged isfer is 6 usthminaat 163 A S finou mST cost-2+1+1+2+5+3 14

Any queries please comment

Please thumbsup for my effort

Thank you and all the best