in reply to Re^3: Travelling Salesman
in thread Travelling Salesman

I didn't do the analysis and I am guess but it should look something like this. On the whole graph, compute the shortest distance between two points in the graph(From the start point). Then the next shortest distance point from that and so on. Such that already visited points are removed from the graph every time a shortest distance point from the current point is computed.

Every time you find the shortest distance between two points, and reach the destination point. The source point is removed. At each step you end up having a smaller graph. There fore lesser points to work on each step. While at the same time you compute shortest distance point available from the current point.

Replies are listed 'Best First'.
Re^5: Travelling Salesman
by JavaFan (Canon) on May 09, 2012 at 06:55 UTC
    That sounds like you're computing the smallest spanning tree. Which is *not* what Dijkstra's algorithm is doing. Given a smallest spanning tree, one can compute an approximation of the shortest hamiltonian path, which I think is at most a factor 2 off.

    Dijkstra's algorithm in a nutshell:

    1. Mark all nodes in the graph unvisited with distance infinite.
    2. Mark the start node unvisited with distance 0.
    3. Off all the unvisited nodes, pick the one (or one of) with smallest distance. Call this node X.
    4. For all unvisited neighbours of X, calculate their distance to the start node (which is the distance X has, plus the length of the edge between X and its neighbour). If said distance is less than the current distance stored at the neighbour, update the distance.
    5. Mark X as visited. If X is the destination node, you're done.
    6. Goto 3. (Hah! A Goto in Dijkstra's algorithm. The irony...)