Home /
Expert Answers /
Computer Science /
for-all-the-questions-below-use-the-undirecged-graoh-shown-in-figure-1-and-or-table-1-where-node-h-pa189
(Solved): For all the questions below use the undirecged graoh shown in Figure 1 and/or Table 1, where node H ...
For all the questions below use the undirecged graoh shown in Figure 1 and/or Table 1, where node H is the root.
Figure 1
1. (10 points) Use Kruskal's Algorithm to find an MST in G. a. Give the edges in the tree b. Is this tree unique? Explain. c. Is the order in which the edges are scanned unique? Explain 2. (10 points) Use Prim's Algorithm to find an MST in G a. Give the order the edges are scanned when running the algorithm b. How many times is each edge examined when running the algorithm? Explain. 3. (10 points) Use Dijkstra's Algorithm to find the shortest paths from the root to all other nodes a. Give the predecessor of each node b. Give shortest paths and their lengths c. How many times was each node scanned? Explain 4. (10 points) Use Bellman's Algorithm to find the shortest paths from the root to all other nodes a. Give the predecessor of each node b. Give shortest paths and their lengths c. How many times was each node scanned? Explain 5. ( 10 points) What is the total length of the each of the trees found by the 4 algorithms? a. Explain any differences or similarities among them?