Bellman-Ford Algorithm for Single Source Shortest Path

  1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 3rd Edition (2009), MIT Press (Chapter 24, Single-Source Shortest Paths)

  2. NPTEL - Algorithmic Graph Theory and Data Structures https://onlinecourses.nptel.ac.in/noc26_cs08/preview

    • Graph Algorithms and Bellman-Ford Algorithm (Week 9 & 10)
  3. NPTEL - Introduction to algorithms and analysis https://onlinecourses.nptel.ac.in/noc21_cs89/preview

    • Bellman-Ford Algorithm (Week 9)