?

Algorithms & Data Structures

Free Version

Upgrade subject to access all content

Moderate

Using Kruskal's Algorithm

ALGOR-MEIRS5

Given the graph below, what would be the order in which you add edges to the minimum spanning tree using Kruskal's Algorithm? Edges are defined by their edge cost.

Ashley Salzetti. Created for Albert.io. Copyright 2016. All rights reserved.

A

2, 3, 4, 5, 6, 8, 9, 10, 15, 20

B

10, 2, 5, 20, 3, 4, 8

C

2, 3, 4, 5, 8, 10, 20

D

2, 3, 4, 5, 6, 8, 9