# Dijkstra's Algorithm
Status: public
Confidence: medium (0.89) (verified)
Last verified: 2026-05-28
Generation: ai_structured


## TL;DR

Dijkstra algorithm computes shortest paths from a source vertex in weighted graphs under its usual nonnegative-weight assumptions.

## Core Explanation

Dijkstra shortest paths are built around repeatedly choosing the nearest unsettled vertex and relaxing outgoing edges. The algorithm is a standard single-source shortest-path method for graphs with nonnegative weights.

## Further Reading

- [A Note on Two Problems in Connexion with Graphs](https://doi.org/10.1007/BF01386390)
- [NIST DADS: Dijkstra Algorithm](https://xlinux.nist.gov/dads/HTML/dijkstraalgo.html)
- [Princeton Algorithms: Shortest Paths](https://algs4.cs.princeton.edu/44sp/)