The network below shows the distances, in kilometres, along a series of roads.
The vertices \(A, B, C, D, E, F, G\) and \(H\) represent the intersections of these roads.
Prim's algorithm can be used to find the
- critical path.
- shortest path.
- minimum cut.
- minimum allocation.
- minimum spanning tree.