[Solved] 2 Suppose Want Find Minimum Spanning Tree Following Graph Ab Ac Ad Bd Bg Cd Cf Cg De Eg Fg Q37284574

2. Suppose we want to find the minimum spanning tree of the following graph. AB AC AD BD BE BG CD CF CG DE EG FG 4 2 (a) Run Kruskal’s algorithm (in case of ties add the edge which is lexicographically first, that is, comes first in the table). Show how the disjoint-sets data structure looks at every intermediate stage (including the structure of the directed trees), assuming path compression is not used. (b) Run Prim’s algorithm; whenever there is a choice of nodes, always use alphabetic ordering (e.g., start from node A). Draw a table showing the intermediate values of the cost/prev values. Show transcribed image text 2. Suppose we want to find the minimum spanning tree of the following graph. AB AC AD BD BE BG CD CF CG DE EG FG 4 2 (a) Run Kruskal’s algorithm (in case of ties add the edge which is lexicographically first, that is, comes first in the table). Show how the disjoint-sets data structure looks at every intermediate stage (including the structure of the directed trees), assuming path compression is not used. (b) Run Prim’s algorithm; whenever there is a choice of nodes, always use alphabetic ordering (e.g., start from node A). Draw a table showing the intermediate values of the cost/prev values.

Expert Answer

---

Answer to 2. Suppose we want to find the minimum spanning tree of the following graph. AB AC AD BD BE BG CD CF CG DE EG FG 4 2 (a)… . . .