Bellman-Ford Algorithm: Proof of Correctness

View Syllabus

Skills You'll Learn

Graph Theory, Graphs, Graph Algorithms


4.7 (1,253 ratings)
  • 5 stars
    977 ratings
  • 4 stars
    219 ratings
  • 3 stars
    39 ratings
  • 2 stars
    14 ratings
  • 1 star
    4 ratings

Apr 24, 2018

This course is very much helpful for the graph beginners. As a suggestion, i would like to say that add some extra contents on the data structures which is to be used in the algorithm.


Jun 28, 2019

Loved the explanations and proofs. They are so explicitly told. And the discussion forum for you well assorted problems in assignment is really helpful.

From the lesson
Paths in Graphs 2

Taught By

  • Alexander S. Kulikov

    Alexander S. Kulikov

    Visiting Professor
  • Michael Levin

    Michael Levin

  • Daniel M Kane

    Daniel M Kane

    Assistant Professor
  • Neil Rhodes

    Neil Rhodes

    Adjunct Faculty

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.