Scribd
Upload
4 views1 page

03 Dijkstra Algorithm

Dijkstra's algorithm efficiently solves the single-source shortest-path problem for graphs with non-negative edge weights by selecting the vertex with the smallest tentative distance. Its time complexity varies from O(V^2) to O((V+E) log V) depending on the data structure used. However, it is not applicable for graphs with negative edge weights, for which alternative algorithms like Bellman-Ford are necessary.

Uploaded by

- पार्थ ‹𝅮.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views1 page

03 Dijkstra Algorithm

Dijkstra's algorithm efficiently solves the single-source shortest-path problem for graphs with non-negative edge weights by selecting the vertex with the smallest tentative distance. Its time complexity varies from O(V^2) to O((V+E) log V) depending on the data structure used. However, it is not applicable for graphs with negative edge weights, for which alternative algorithms like Bellman-Ford are necessary.

Uploaded by

- पार्थ ‹𝅮.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Dijkstra's Shortest Path Algorithm: A Research Note

Abstract
Dijkstra's algorithm solves the single-source shortest-path problem for graphs whose edge weights are
non-negative. It repeatedly selects the unsettled vertex with the smallest tentative distance.

Introduction
Shortest-path algorithms are essential in navigation, network routing, robotics, and optimization. Dijkstra's
method is widely used for non-negative weighted graphs.

Method
Set the source distance to zero and all other distances to infinity. Repeatedly choose the unvisited vertex
with minimum tentative distance and relax its outgoing edges.

Complexity
With simple minimum selection, the time complexity is O(V^2). With adjacency lists and a binary heap, it is
commonly O((V+E) log V).

Limitations
Dijkstra's algorithm is not correct for graphs containing negative edge weights. Bellman-Ford or other
suitable algorithms are required in such cases.

Conclusion
Dijkstra's algorithm is efficient and practical for shortest-path problems with non-negative edge costs.

You might also like