Q. Consider the following graph. Using Kruskal’s algorithm, which edge will be selected first?

(A) gf
(B) de
(C) be
(D) bg

💬 Discuss

✅ Correct Answer: (C) be

Explanation: in krsuskal’s algorithm the edges are selected and added to the spanning tree in increasing order of their weights.

Published by Mr. Dubey ⭐ 104.82K Points at 16-Sep-2023 03:43 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

in krsuskal’s algorithm the edges are selected and added to the spanning tree in increasing order of their weights.

💬 Discussion

📊 Question Analytics

👁️

413

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

85%

Success Rate