-1

I was learning for my Exams and I think im missing out on Something about the Traveling Salesman Problem, maybe some of you Guys can help me out

I was wondering If you couldn't use a MST to first find all the Vertices and afterwards use A* to get back to the starting point ? would that be polynomial complexity or am I missing out on Something.

edit: or use any other point-to-point shortest path algorithm

I appreciate any help or answers

Polynomial length of study
  • 35
  • 4
  • This might be a better question for the [computer science stack exchange site](https://cs.stackexchange.com/) – 3ocene Feb 14 '19 at 02:18

1 Answers1

1

The MST doesn't give you a single path containing all the vertices. Also the TSP asks you to find the shortest path, not just any path.

BlueRaja - Danny Pflughoeft
  • 84,206
  • 33
  • 197
  • 283