Distributed Bellman Ford Algorithm Quiz

Least cost paths (correct)

Optimal paths

Fastest paths

Shortest paths

$d(y) = \min(d(x), d(v) + c(x,y))$

$d(y) = \min(d(y), d(v) + c(v,y))$ (correct)

$d(y) = \min(d(x), d(x) + c(v,y))$

$d(y) = \min(d(y), d(x) + c(v,y))$

The source x

The destination y

The cost of g

One of x's neighbors (correct)

<p>Using local calculations to compute global results</p> Signup and view all the answers

<p>Distance vector algorithms</p> Signup and view all the answers