Dijkstra’s algorithm is well known in computer science, but as other comments say it, Google uses a much more advanced algorithm. Furthermore the complexity O(n×log(n)) we know dates from the 80’s. Many years after Dijktra’s original article.

I wrote a year ago a small blog post where I tried to show the chronology: http://blog.tristramg.eu/short-history-of-routes-computation...