Consider the graph G below. Which of the following show a correct order of addin

Question

Consider the graph G below. Which of the following show a correct order of adding edges to the MST using Kruskal's algorithm? (a, b), (c, d), (c, a), (e, d), (f, a) (a, b), (c, d), (e, d), (f, a), (c, a) (a, b), (c, d), (e, d), (a, f), (a, c), (c, e), (f, b), (b, c), (f, e), (b, e) (c, d), (a, b), (e, d), (a, f), (a, c) (a, b), (c, d), (f, a), (d, e), (a, c) (a, b), (a, f), (a, c), (c, d), (d, e) Consider the graph G below. Which of the following statements are TRUE? delta (d, e) = 2 delta(s, b) = -infinity delta(s, a) = 2 delta(s, c) = 6 delta(s, d) = -infinity delta(s, e) = infinity

Explanation / Answer

Answer:

1) b) (a, b ) , (c , d ) , ( e , d ) , ( f , a ) , ( c , a )

Start with lowest cost and progress until n-1 edges r added in incresing costs

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---