DSA 2024 föreläsning 11 2024-02-21: Bellman-Fords algoritm. Hashtabeller.
Thomas Padron-McCarthy · 87:04
This lecture finishes shortest paths. It shows why Dijkstra's algorithm gives wrong answers when some edges have negative weights, and introduces Bellman-Ford as the fix: it relaxes every edge |V| times, which handles...