Home/ Questions/Q 9123119
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-17T06:15:44+00:00

There’s 2d array, with points marked on it – just like in the first

  • 0

There’s 2d array, with points marked on it – just like in the first picture. What I have to do, is to find connection between all the points on that map (so you can travel from any point to all other points). Sum of length of all edges has to be possibly smallest.

enter image description here

Input:

(0, 0) (5, 5) (5, 1) (4, 4) (1, 5) (2, 4) (2, 1) // 1st,2nd,3rd city ...

Output:

1-7, 7-3, 7-6, 6-5, 6-4, 4-2
Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Treat your input set of points as a fully connected graph, with the distance between a pair of points as the edge weight. Then find the minimum spanning tree of the graph.

    Kruskal’s algorithm is particularly easy:

    • Start with no edges in your output graph.
    • Go through each edge of your input graph in order of weight, smallest first.
      • If the two vertices aren’t already part of the same tree in your output graph, then add the edge to your output graph.

    There are various techniques you can use to make this very fast if speed is an issue.

    • 0