Skip to content
Skein

Bellman-Ford

RU: Bellman-Ford

A shortest-path algorithm that relaxes all edges V-1 times, running in O(V*E). It handles negative edge weights, which Dijkstra's algorithm cannot, and can detect negative cycles.

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