Respuesta :
The technique used is Minimum spanning tree if your goal was to construct a network in which all points were connected and the distance between them was as short as possible.
A spanning tree is a subset of Graph G that has the fewest number of edges feasible connecting every vertex. As a result, spanning trees are unconnected and lack cycles.
We can infer from this definition that every linked and undirected Graph G has at least one spanning tree. Since a disconnected network cannot be spanned to all of its vertices, it lacks a spanning tree.
A minimum spanning tree in a weighted graph is one that has the least weight among all the other spanning trees in the same graph. This weight can be quantified in the actual world as distance, traffic load, congestion, or any other arbitrary number indicated to the edges. Minimum spanning tree uses either of the two greedy algorithms namely Algorithm Kruskal and The Prim algorithm.
To learn more Spanning tree about click here:
brainly.com/question/28111068
#SPJ4
