Consider the following graph G. The label of an edge is the cost of the edge....

 

Transcribed Image Text:

Consider the following graph G. The label of an edge is the cost of the edge. b 6 DZ 3 10 12 5 1 a 4 2 7 14 8 d h 8 (a) Using Prim's algorithm, draw a minimum spanning tree (MST) of the graph Also write down the change of the priority queue step by step and the order in which the vertices are selected. Is the MST drawn unique? (i.e., is it the one and only MST for the graph?) (7 marks) (b) Using Kruskal's algorithm, draw a minimum spanning tree (MST) of the graph G. Write down the order in which the edges are selected. Is the MST drawn unique? (i.e., is it the one and only MST for the graph?) (5 marks) (c) Referring to the same graph above, find the shortest paths from the vertex a to all other vertices in the graph G using Dijkstra's algorithm. Show the changes of the priority queue step by step and give the order in which edges are selected. (8 marks) Consider the following graph G. The label of an edge is the cost of the edge. b 6 DZ 3 10 12 5 1 a 4 2 7 14 8 d h 8 (a) Using Prim's algorithm, draw a minimum spanning tree (MST) of the graph Also write down the change of the priority queue step by step and the order in which the vertices are selected. Is the MST drawn unique? (i.e., is it the one and only MST for the graph?) (7 marks) (b) Using Kruskal's algorithm, draw a minimum spanning tree (MST) of the graph G. Write down the order in which the edges are selected. Is the MST drawn unique? (i.e., is it the one and only MST for the graph?) (5 marks) (c) Referring to the same graph above, find the shortest paths from the vertex a to all other vertices in the graph G using Dijkstra's algorithm. Show the changes of the priority queue step by step and give the order in which edges are selected. (8 marks)

Answer rating: 100% (QA)

To find the shortest paths from the vertex A to all other vertices in the graph G using Dijkstras al... View the full answer