You say that, but I'm not convinced.
Type: Posts; User: tabstop
You say that, but I'm not convinced.
If you run Dijkstra's algorithm for every pair of vertices, you'll get much the same result, yes. (Dijkstra's algorithm also produces the shortest path; this algorithm just tells us the length of...
Are you sure it solves the TSP problem? It looks a lot more like "find the edge in the graph with least cost, and return twice that value".