1.
- Please Answer All Thank You 1 2 3 4 5 1 (24.58 KiB) Viewed 32 times
- Please Answer All Thank You 1 2 3 4 5 2 (22.05 KiB) Viewed 32 times
- Please Answer All Thank You 1 2 3 4 5 3 (93.49 KiB) Viewed 32 times
- Please Answer All Thank You 1 2 3 4 5 4 (6.33 KiB) Viewed 32 times
- Please Answer All Thank You 1 2 3 4 5 5 (25.69 KiB) Viewed 32 times
- Please Answer All Thank You 1 2 3 4 5 6 (31.79 KiB) Viewed 32 times
Which of the following is not an edge in the minimum spanning tree of the given graph? 2. 1 7 6 6 12 5 3 11 9 5 4. O a. 1-2 O b. 1-3 O c. 3-4 O d. 4-5 O e. 2-6
The Quick Union implementation assumes that the root nodes are assigned a parent ID of "-1". If I wanted to change this and set root nodes to have a parent ID of "o" instead of "-1", which lines in the following code would change? Select all that should change. 1 class QuickUnion: def_init__(self, size: int) -> None: size: number of elements to initialize self.size = size self.parent = (-1]*self.size def str__(self) -> str: return f"parent: {self.parent}" 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 def get_root (self, p: int) -> int: Find the root of p". idx = p while self.parent[idx] >= 0: idx = self.parent[idx] return idx def is connected(self, pl: int, p2: int) -> bool: return self.get_root(pl) == self.get_root(p2) def connect (self, pl: int, p2: int) -> None: Connects pl and p2" rl = self.get_root(pl) r2 = self.get_root(p2) self.parent[rl] = r2
a. Line 26 b. Line 15 c. Line 16 0 d. Line 20 e. Line 7 f. None of the above
Given the graph below, which of the following edges are part of the MST? Choose all the correct edges. 4 3 7 8 6 9 a. 4-7 O b. 5-8 C. 8-9 O d. 5-9 0 e. 5-7 f. 7-8 g. 4-5
Given the graph below: which node should be the source node ("x") in finding the shortest path tree (SPT) such that the SPT is the same as the MST? In other words, if you try to find the shortest path from node "x" to all the other nodes, all the edges belong to the MST. 4 9 7 8 -6 9 O a. 5 O b. 7 Oc. None of the above O d. 8 O e. 4