Question: c) Given the following weighted undirected graph: 1 5 2 5 3 3 2 6 4 5 6 6 i) Draw the adjacency list for

c) Given the following weighted undirected graph: 1 5 2 5 3 3 2 6 4 5 6 6 i) Draw the adjacency list for the graph. (4 marks) ii) Draw and calculate the minimum spanning tree (MST) for the diagram using Prim's algorithm. Show all your work for determining the MST. (8 marks) iii) Discuss on a technique to improve the Prim's algorithm using parallel programming approach. (4 marks)
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
