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 :)