Feb 27th 2017

Graph Search, Shortest Paths, and Data Structures (Coursera)

Created by:Delivered by:
Taught by:

The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from deduplication to social network analysis).

Who is this class for: Learners with at least a little bit of programming experience who want to learn the essentials of algorithms. In a University computer science curriculum, this course is typically taken in the third year.

Course 2 of 4 in the Algorithms Specialization.