Given a “n” number of non-repetitive points/vertexes in a 2-Dgraph, I want to find the closest pair of vertexes (have theshortest path, smallest length) amongst all the vertexes in thegraph. Please create a program in C/C++ that generates n randomvertexes and calculates the closest pair of vertexes with analgorithm that has a big O smaller than n^2 for the calculationportion. Also explain what type of algorithm was used for thecalculation.
Expert Answer
An answer will be send to you shortly. . . . .