0

For my A-level computing project I am coding a route planner in VB. I am planning on implementing Dijkstra's algorithm to do this, but I was wondering if there is a way in which it can find the shortest route, whilst also visiting every node once?

Thanks in advance :)

Finn Wilkinson
  • 1
  • 1
    Basically what you want is a solution to the Traveling Salesman Problem? https://en.wikipedia.org/wiki/Travelling_salesman_problem Does it have to be Dijkstra's? – Thomas Hilbert Jan 04 '17 at 17:44
  • No it doesn't have to be Dijkstra's that was just the initial idea that I had thought of. Sorry for the late reply – Finn Wilkinson Jan 12 '17 at 22:19

0 Answers0