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 basic graph traversal algorithm
breadth–first search algorithm
depth–first search algorithm
shortest path algorithms
what are spanning trees
union find data structures
what are strongly connected components
the famous maximum flow problem
how to reduce most of the hard problems to maximum flow problem
bipartite matching problem
travelling salesman problem (TSP)
how to deal with NP–hard problems
using meta–heuristics: tabu search and simulated annealing
The course is going to take approximately 10 hours to completely but I highly suggest you typing these algorithms out several times in order to get a good grasp of it. You can download the source code of the whole course at the last lecture.
You should definitely take this course if you are interested in advanced topics concerning algorithms. There are a bunch of fields where these methods can be used: from software engineering to scientific research.
Courses : 24
Specification: Advanced Algorithms in Java