State the number of edges in a minimum spanning tree of a network with 11 vertices.
State the number of edges in a minimum spanning tree of a network with \(n\) vertices.
The following network has 11 vertices, \(A , B , \ldots , K\). The number on each edge represents the distance, in miles, between a pair of vertices.
\includegraphics[max width=\textwidth, alt={}, center]{4c5c963b-0183-4dc7-9054-b2c7a3eb8c1b-03_1468_1239_721_404}
Use Prim's algorithm, starting from \(A\), to find a minimum spanning tree for the network.