Crowdly
Add to Chrome
Given a connected undirected graph with the following weighted edges: A–B(3), A–...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Given a connected undirected graph with the following weighted edges: A–B(3), A–C(1), B–C(2), B–D(4), C–D(5). For the graph above, if Prim’s algorithm starts at vertex B, which edge is added first?
0%
0%
0%
0%