A

Admin • 831.35K Points
Coach

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

  • (A) gf
  • (B) de
  • (C) be
  • (D) bg
Explanation by: Admin
in krsuskal’s algorithm the edges are selected and added to the spanning tree in increasing order of their weights.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.