# Shortest Paths

## Dijkastra

Shortest path between two certain vertices.

![Dijkastra Example](https://4258085521-files.gitbook.io/~/files/v0/b/gitbook-x-prod.appspot.com/o/spaces%2F9G7bk8jPRz85XaeJtlxH%2Fuploads%2Fgit-blob-2fcb6f1469a69f511d2422ae305cc31fe53c319a%2Fdijkastra.png?alt=media)

Number of decreaseKeys is 14. All updates except Stage 0 and the circled ones.