28.1.2. Department of Computer Science and Engineering

Now, let us look at shortest paths in graphs where we allow Negative Edge weights. In particular let us look at the Bellman-Ford Algorithm.

This chunk introduces the concept of shortest paths in graphs that have negative edge weights. It specifically points towards the Bellman-Ford Algorithm, which is designed to handle such cases. Unlike other algorithms that assume non-negative weights, the Bellman-Ford Algorithm can find the shortest paths even when edges have negative values.

Think of navigating a city where some roads may have negative weights, like getting money back for using a certain route due to a toll rebate. The Bellman-Ford algorithm helps find the shortest route considering all these rebates, similar to how you would calculate your total expenses with discounts.

So, recall that the correctness for Dijkstra's algorithm relied on an invariant property that every vertex that we burn automatically has the shortest path computed at the time when we burn it. However, as we saw this argument does not work if we can have negative edge weights.

Dijkstra's Algorithm, known for efficiently finding the shortest path, depends on the idea that once a vertex is 'burnt' (or finalized), its shortest distance is determined. However, this assumption fails in cases with negative edge weights. A shorter path may become available after a vertex is finalized, leading to incorrect results.

Imagine you complete a puzzle by locking certain pieces in place. If the pieces resemble roads with fixed distances, you'd always consider them final. Now, if it turns out you could re-arrange the pieces (like finding a shortcut), your completed puzzle (or path) may no longer be the best one!

So, let us first look at two basic properties about shortest paths which hold regardless of whether the edges can be negative or not, provided we do not have negative cycles.

Two key properties of shortest paths are discussed. First, a shortest path won't contain loops, which prevents unnecessary increases in distance. Second, every segment (prefix) of the shortest path is also a shortest path. These properties help form the basis for considering the Bellman-Ford algorithm.

Consider taking a road trip. If you circle back to an earlier stop (loop), it only increases your total travel distance. However, if you trace back any part (prefix) of your route, it’s guaranteed to be part of your shortest distance to your destination.

So, Bellman-Ford algorithm basically says do not write to your find the particular sequence, just generally compute all possible sequence have updates.

The Bellman-Ford Algorithm takes a straightforward approach by initializing distances from a source vertex and repeatedly updating these distances for all edges in the graph. After performing these updates a total of 'n-1' times, where 'n' is the number of vertices, it ensures that the shortest paths will be correctly computed under the presence of negative edges as long as there are no negative cycles.

Think of cleaning your room. Instead of focusing on one specific area repeatedly, you decide to clear each section thoroughly a number of times. By the end of your efforts, your room will be entirely tidy, ensuring any mess created from the first pass is cleaned on subsequent passes!

The algorithm is actually remarkably simple, do you start from a source vertex s. So, initially you assign the distance to be infinity for every vertex and you initialize the distance of s to be 0. Now, n minus 1 times you blindly repeat the following operation for every edge in your graph apply the distance updates.

To implement the Bellman-Ford algorithm, you start with a source vertex and set the distances to infinity for all vertices except the source, which is set to zero. You then perform updates for all edges a total of 'n-1' times, ensuring that all potential paths are explored thoroughly, leading to the correct shortest path calculations.

Imagine a baker preparing multiple batches of cookies. Each time they bake a batch, they ensure every ingredient is added and measured correctly. Repeating this process until all recipes are complete ensures the final outcome is the perfect batch of cookies, just as repeated updates ensure the shortest paths are accurately calculated.

--