concept straight - line distance in category algorithms

This is an excerpt from Manning's book Algorithms and Data Structures in Action MEAP V14. Login to get full access to this book.

Figure 14.18 Running Dijkstra’s algorithm on a directed graph (derived from the example in figure 14.10).

The running time using an array for the priority queue is going to be O(|V|2), because each vertex will require O(|V|) operations to update priority or to adjust the queue after extraction.