MIT’s Introduction to Algorithms, Lectures 17, 18 and 19: Shortest Path Algorithms

This is the twelfth post in an article series about MIT’s lecture course “Introduction to Algorithms.” In this post I will review a trilogy of lectures on graph and shortest path algorithms. They are lectures seventeen, eighteen and nineteen. They’ll cover Dijkstra’s Algorithm, Breadth-First Search Algorithm and Bellman-Ford Algorithm for finding single-source shortest paths as well as Floyd-Warshall Algorithm and Johnson’s Algorithm for finding all-pairs shortest paths.

Continue reading over at dzone...