Figure 2.13: Figure 2.13 (a) Sites are linked in order of increasing cost until all locations are connected. (b) Circuit in part (a) highlighted. (c) Most expensive link in circuit in part (a) deleted. (d) Highlighted edges show, as a subgraph of the original graph, those links connecting the locations with minimum cost, obtained using Kruskal’s algorithm. The numbers show the order in which Kruskal’s algorithm selects the edges.