<p><b>Abstract</b>—Let <tmath>${\cal G}(V,\ E)$</tmath> be a directed graph in which each vertex has a nonnegative weight. The cost of a path between two vertices in <tmath>$\cal G$</tmath> is the sum of the weights of the vertices on that path. In this paper, we show that, for such graphs, the time complexity of Dijkstra's algorithm, implemented with a binary heap, is <tmath>${\cal O}(|E| + |V|\ \log\ |V|).$</tmath></p>