Consider the following edge weighted graph with 7 vertices and 11 edges. Note th

Question

Consider the following edge weighted graph with 7 vertices and 11 edges. Note that the edge weights are distinct integers between 1 and 11. a. What is the sequence of edges in the MST in the order that Kruskal's algorithm includes them? A. 1 2 3 4 5 7 B. 1 2 3 4 7 8 C. 1 2 4 5 9 10 D. 1 2 5 7 9 11 E. 1 2 3 4 5 6 b. What is the total weight of the edges in the MST? A. 31 B. 25 C. 21 D. 22 E. 35 Consider the digraph shown below. Assume that, in the internal representation, all vertices appear in numerical order in each adjacency list. What is the order in which the vertices appear in reverse postorder for a depth-first search starting at 0. A. 0 2 3 5 6 4 1 B. 0 2 3 4 5 1 4 C. 0 2 3 6 1 5 4 D. 0 2 3 1 5 4 6 E. 0 2 3 4 6 1 5

Explanation / Answer

Problem 10.
a. The sequence of edges in the MST in the order that Kruskal algorithm includes are:
A. 1, 2, 3, 4, 5, 7.

b. What is the total weight of the edge in the MST?
D. 1 + 2 + 3 + 4 + 5 + 7 = 22.

Problem 11.
A. 0, 2, 3, 5, 6, 4, 1.

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---