Answer (Choose 1 answer)
Using Prim's algorithm to find a minimal spanning tree. What is the list of edges chosen?
A. CE, AB, BC, DZ, BD
AO
2
4
3
Z
6
4
B. AB, BC, CE, BD, DZ
C. CE, AB, BC, BD, DZ
D. None of the other choices is correct
CO
1
E. CE, BC, AB, BD, DZ
3
2
2
an tot ni
Exit 8
