Bellman Ford Algorithm | Shortest path & Negative cycles | Graph Theory

Bellman Ford algorithm explanation video on how to find the shortest path and handle negative cycles.

Support me by purchasing the full graph theory course on Udemy which includes additional problems, exercises and quizzes not available on YouTube:
https://www.udemy.com/course/graph-theory-algorithms

Github source code link:
https://github.com/williamfiset/algorithms

===============================================================================
Developer tools I used in the creation/testing of the content in these videos:

1) Sublime text, my favorite lightweight code editor (https://www.sublimetext.com).
NOTE: I'm often asked about the color scheme I use, find it here: https://github.com/williamfiset/dotfiles/tree/master/sublime

2) Kite, a free AI-powered coding assistant that provides smart code completions while typing:
https://www.kite.com/get-kite/?utm_medium=referral&utm_source=youtube&utm_campaign=williamfiset&utm_content=description-only
===============================================================================

Видео Bellman Ford Algorithm | Shortest path & Negative cycles | Graph Theory канала WilliamFiset