28.1.3. Module – 03

Try these first

1. 1.

   What is the initial distance set for all vertices except the source in the Bellman-Ford algorithm?

   Hint

   Think about how prepared we need to assume our distances are at the start.

2. 2.

   How many iterations does the Bellman-Ford algorithm perform?

   Hint

   Consider the maximum number of edges between vertices.

3. 3.

   What does the Bellman-Ford algorithm initialize the source vertex distance to?

   • 0
   • Infinity
   • 1

   Hint

   Think about how we would represent distance to ourselves compared to other vertices.

4. 4.

   True or False: The Bellman-Ford algorithm can handle graphs with negative cycles.

   • True
   • False

   Hint

   Consider the implications of a path going to infinity.

5. 5.

   Design a graph with at least one negative edge and demonstrate how the Bellman-Ford algorithm would identify the shortest path from a designated source.

   Hint

   Focusing on how each path refines the distances will guide your answer!

6. 6.

   Explain how you would modify the Bellman-Ford algorithm to detect negative cycles in your graph.

   Hint

   Think about what continuously changing distances signify in your path calculations.