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).
Graph Search, Shortest Paths, and Data Structures
Stanford University
via Coursera
Instructor(s)
Tim Roughgarden
Stanford University
via Coursera
Free (audit)
English
Paid Certificate Available
Approx. 15 hours to complete
Self paced
Intermediate Level
Subtitles: Subtitles: Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, Spanish