But, but, but Dijkstra's algorithm solves a completely different task: find the shortest route between two points. And while you can construct graphs where there is a pair of points where the shortest path between them actually visits all other points, that's situation most traveling salesmen won't find themselves in. (Except maybe in Chili)
in reply to Re^2: Travelling Salesman
in thread Travelling Salesman
Either the OP is solving a different problem than the travelling salesman, or he's using something else than Dijkstra's.