First videos on shortest paths
Dear all
I uploaded the first set of videos on shortest paths. They cover the general framework that we will use to find shortest paths, and the algorithm of Bellman-Ford for single source shortest paths in directed weighted graphs (allowing negative edges as along as no negative cycles are reachable from the source).
I hope you'd enjoy watching this. It is split into 4 relatively short videos, each about 30 minutes long.
Please watch this before your upcoming recitation after the holiday.
יום עצמאות שמח
Haim