Skip to content
Skein

Dijkstra's algorithm

RU: алгоритм Дейкстры

An algorithm for shortest paths from a source in a weighted graph with non-negative edge weights. It generalizes BFS by replacing the FIFO queue with a min-priority-queue keyed by tentative distance; with a binary heap it runs in O((V+E) log V).

shortcutsexpand
search
⌘K
prev piece
k
next piece
j
cycle tier
t
this menu
?