Best algorithm to cover all points of a circle with a shortest distance


The Best Algorithm to find the path which covers all the points in a circle with minimum distance. starts from (0,0) .,no need to reach back (0,0) unlike TSP

If there's no need to return, then it's not a circle/cycle, but a path.

A path that goes through all the vertices in the graph is called an Hamiltonian path, and the problem you are describing is the "minimum weight Hamiltonian path", which is as hard as the TSP. so you won't find a better algorithm than any of the available algorithms for the TSP (but you can use known algorithms for the TSP with small adjustments to solves this problem such as Dynamic Programming and Branch and Bound).