What is the most efficient way of finding a path through a small world graph?

Question

I have a sea of weighted nodes with edges linking clusters of nodes together. This graph follows the typical small world layout.

I wish to find a path finding algori

Answer 1

Would a common Dijkstra's not be sufficient?

http://improve.dk/generic-dijkstras-algorithm/