neighbour has estimate unchanged | + | tight |yes yes yes yes no pred |none vertex has minimal estimateand so is tight neighbour is already tight neighbour is already tight | + | tight |yes yes yes yes yes pred |none end of dijkstra' computation shortest path from to isa once it is clear what is happening at each stageit is usually more convenient to adopt shorthand notation that allows the whole process to be represented in single table for exampleusing "*to represent tightthe distancestatus and predecessor for each node at each stage of the above example can be listed more concisely as followsstage + oo oo oo oo oo oo shortest path from to isa dijkstra' algorithmversion the time complexity of dijkstra' algorithm can be improved by making use of priority queue ( some form of heapto keep track of which node' distance estimate becomes tight next here it is convenient to use the convention that lower numbers have higher priority the previous algorithm then becomes