The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (1998 vol.47)
pp: 263
ABSTRACT
<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>
INDEX TERMS
Analysis of algorithms, combinatorial problems, data structures
CITATION
Michael Barbehenn, "A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices", IEEE Transactions on Computers, vol.47, no. 2, pp. 263, February 1998, doi:10.1109/12.663776
38 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool