Please answer questions both of them with explanation number 4is just as is the question and 2 is everything
2. (15 points) Consider the graph G given below. Compute an MST of G using Prim's algorithm. Specifically, list the edges selected into the tree in the correct order, and then draw the final MST. Must show all the intermediate steps for full credit a b h i 1 6 g 4 2 d 14 f 9 10 e 4. (15 points) Consider the graph G given in Problem 3 above. Compute an MST of G using Kruskal's algorithm. Specifically, list the edges selected into the tree in the correct order, and draw the final MST. (You are encouraged to include all intermediate work, such as the results after doing each UNION operation, so that you can still receive partial credit if your final answer is incorrect.)
Please answer questions both of them with explanation number 4 is just as is the question and 2 is everything
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am