Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Stanford University

Graph Search, Shortest Paths, and Data Structures

Stanford University via Coursera


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


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

Taught by

Tim Roughgarden



4.8 rating at Coursera based on 1918 ratings

Start your review of Graph Search, Shortest Paths, and Data Structures

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.