?

Algorithms & Data Structures

Free Version

Upgrade subject to access all content

Moderate

Using Prim's Algorithm

ALGOR-@NYXC1

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

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

A

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 15, 18, 20

B

1, 2, 3, 4, 5, 6, 7, 8

C

1, 2, 3, 4, 5, 6, 8, 12

D

1, 6, 3, 5, 12, 4, 8, 2