Understand the Bellman-Ford algorithm for shortest paths. Learn how it handles negative weight edges and detects negative weight cycles in graphs.