Graph Search, Shortest Paths, and Data Structures

Go to class
Write Review

Free Online Course: Graph Search, Shortest Paths, and Data Structures provided by Coursera is a comprehensive online course, which lasts for 4 weeks long, 15 hours worth of material. The course is taught in English and is free of charge. Upon completion of the course, you can receive an e-certificate from Coursera. Graph Search, Shortest Paths, and Data Structures is taught by Tim Roughgarden.

Overview
  • 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).

Syllabus
    • Week 1
      • Breadth-first and depth-first search; computing strong components; applications.
    • Week 2
      • Dijkstra's shortest-path algorithm.
    • Week 3
      • Heaps; balanced binary search trees.
    • Week 4
      • Hashing; bloom filters.