Learn how to create robust algorithms on your own

This course is about advanced algorithms focusing on graph traversal, shortest path problems, spanning trees and maximum flow problems and a lots of its applications from Google Web Crawler to taking advantage of stock market arbitrage situations.

The course is going to take approximately 7 hours to completely but I highly suggest you typing these algorithms out several times in order to get the grasp of it. You can download the source code of the whole lecture at the last video.

In the first section we are going to talk about the main graph traversal algorithms and its applications of course such as WebCrawler or topological ordering. The next section is about shortest paths: there are several applications which we are going to be familiar with from image processing to stock market. The third chapter is about minimum spanning trees and clustering algorithms. Lastly, we are going to learn about the maximum flow problem, maybe the most important algorithm in this course.