📘
Notes
Blog
Fundamental Algorithms
Fundamental Algorithms
  • Overview
  • Introduction
  • Recurrences
  • Search Trees
  • Dynamic Programming
  • Shortest Paths
  • NP Complete
Powered by GitBook
On this page

Shortest Paths

PreviousDynamic ProgrammingNextNP Complete

Last updated 2 years ago

Dijkastra

Shortest path between two certain vertices.

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

Dijkastra Example