最近邻算法和贪心算法有什么区别？

Question

I'm trying to develop 2 different algorithms for Travelling Salesman Algorithm (TSP) which are Nearest Neighbor and Greedy. I can't figure out the differences between them while thinking about cities.

I think they will follow the same way because shortest path between two cities is greedy and the nearest at the same time. which part am i wrong? Can you explain with a few cities example thank you!

Answer 1

Check out this link here: https://en.wikipedia.org/wiki/Travelling_salesman_problem It gives an in depth description of the problem. There are many different solutions to the TSP, the Nearest Neighbour solution is a Greedy Solution, so these are indeed the same.

Answer 2

Answer is NN Algorithm basically creates segments to closest nodes that it can reach, Greedy is the method of it but it directly takes the node which is the closest to current node.