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

Overview

Prepare for a new career with $100 off Coursera Plus
Gear up for jobs in high-demand fields: data analytics, digital marketing, and more.
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.

Taught by

Tim Roughgarden

Reviews

1.0 rating, based on 1 Class Central review

4.8 rating at Coursera based on 1958 ratings

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

  • Anonymous
    This is fake this guys are making bad practice showing course is fee and after clicking the button it open a page for payment

Never Stop Learning.

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

Someone learning on their laptop while sitting on the floor.