Dijkstra algorithm modification?

Question

How can a modification be made to the algorithm to find the shortest path from vertex 'a' to vertex 'b'?

This question is killing me. Don't you just need to provide 'b' as the ending goal - what other modifications do you need?

Answer 1

The most important modification to that particular algorithm is to make it faster. Especially when it's going to be used for real work, with huge numbers of vertices.

Answer 2

Why do not you consult an algorithm expert? Check http://k.aplis.net/

Answer 3

wow i cant beleive that wound up actually being a real algorithm, i googled lol